✦ LIBER ✦

Feasible descent algorithms for mixed complementarity problems

✍ Scribed by Michael C. Ferris; Christian Kanzow; Todd S. Munson

Publisher: Springer-Verlag
Year: 1999
Tongue: English
Weight: 146 KB
Volume: 86
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s101070050101

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Strictly feasible equation-based methods

Strictly feasible equation-based methods for mixed complementarity problems

✍ Christian Kanzow 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 181 KB

A feasible semismooth asymptotically New

A feasible semismooth asymptotically Newton method for mixed complementarity problems

✍ Defeng Sun; Robert S. Womersley; Houduo Qi 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 170 KB

A feasible descent algorithm for solving

A feasible descent algorithm for solving variational inequality problems

✍ Deren Han; Hong K. Lo 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 262 KB

A descent algorithm for solving monotone

A descent algorithm for solving monotone variational inequalities and monotone complementarity problems

✍ M. J. Smith 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 452 KB

A feasible directions algorithm for nonl

A feasible directions algorithm for nonlinear complementarity problems and applications in mechanics

✍ José Herskovits; Sandro R. Mazorche 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 650 KB

FEASIBLE DESCENT CONE METHODS FOR INEQUA

FEASIBLE DESCENT CONE METHODS FOR INEQUALITY CONSTRAINED OPTIMIZATION PROBLEMS

✍ J. A. SNYMAN; N. STANDER 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 784 KB

A new Feasible Descent Cone (FDC) method for constrained optimization, previously restricted to linear objectives, is here generalized to include non-linear objective functions as well. In the basic and exact algorithm a sequence of descent steps is taken through the interior of the feasible region