✦ LIBER ✦

A feasible descent cone method for linearly constrained minimization problems

✍ Scribed by E. de Klerk; J.A. Snyman

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 955 KB
Volume: 28
Category: Article
ISSN: 0898-1221
DOI: 10.1016/0898-1221(94)00150-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Decomposition branch and bound method fo

Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems

✍ Thai Quynh Phong; Le Thi Hoai An; Pham Dinh Tao 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 393 KB

A descent method for a reformulation of

A descent method for a reformulation of the second-order cone complementarity problem

✍ Jein-Shan Chen; Shaohua Pan 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 196 KB

Analogous to the nonlinear complementarity problem and the semi-definite complementarity problem, a popular approach to solving the second-order cone complementarity problem (SOCCP) is to reformulate it as an unconstrained minimization of a certain merit function over R n . In this paper, we present

A globally convergent method based on Fi

A globally convergent method based on Fischer–Burmeister operators for solving second-order cone constrained variational inequality problems

✍ Juhe Sun; Liwei Zhang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 632 KB