✦ LIBER ✦

Smoothing methods for convex inequalities and linear complementarity problems

✍ Scribed by Chunhui Chen; O. L. Mangasarian

Publisher: Springer-Verlag
Year: 1995
Tongue: English
Weight: 819 KB
Volume: 71
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01592244

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Smoothing methods for complementarity pr

Smoothing methods for complementarity problems in process engineering

✍ Vipin Gopal; Lorenz T. Biegler 📂 Article 📅 1999 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 192 KB 👁 1 views

Nonlinear complementarity problem and sy

Nonlinear complementarity problem and systems of convex inequalities

✍ W. Takahashi 📂 Article 📅 1978 🏛 Springer 🌐 English ⚖ 326 KB

Global linear and quadratic one-step smo

Global linear and quadratic one-step smoothing newton method for vertical linear complementarity problems

✍ Zhang Li-ping; Gao Zi-you 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 457 KB

On the convergence of SOR- and JOR-type

On the convergence of SOR- and JOR-type methods for convex linear complementarity problems

✍ Alvaro R. De Pierro; Alfredo N. Iusem 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 661 KB

Inexact multisplitting methods for linea

Inexact multisplitting methods for linear complementarity problems

✍ Jun-Liang Dong 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 571 KB

We present an inexact multisplitting method for solving the linear complementarity problems, which is based on the inexact splitting method and the multisplitting method. This new method provides a specific realization for the multisplitting method and generalizes many existing matrix splitting meth

IGAOR and multisplitting IGAOR methods f

IGAOR and multisplitting IGAOR methods for linear complementarity problems

✍ Sheng-Guo Li; Hao Jiang; Li-Zhi Cheng; Xiang-Ke Liao 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 264 KB

In this paper, we propose an interval version of the generalized accelerated overrelaxation methods, which we refer to as IGAOR, for solving the linear complementarity problems, LCP (M, q), and develop a class of multisplitting IGAOR methods which can be easily implemented in parallel. In addition,