✦ LIBER ✦

A new linesearch method for quadratically constrained convex programming

✍ Scribed by A. Melman

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 532 KB
Volume: 16
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(94)90062-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A decomposition procedure for convex qua

A decomposition procedure for convex quadratic programs

✍ C. M. Shetty; Mohammed Ben Daya 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 339 KB

Splitting methods for constrained quadra

Splitting methods for constrained quadratic programs in data analysis

✍ E. Galligani; V. Ruggiero; L. Zanni 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 440 KB

This paper is concerned with the numerical solution of a linearly constrained quadratic programming problem by methods that use a splitting of the objective matrix. We present an acceleration step for a general splitting algorithm and we establish the convergence of the resulting accelerated scheme.

A sequential quadratically constrained q

A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function

✍ Chun-Ming Tang; Jin-Bao Jian 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 281 KB

A sequential equality constrained quadra

A sequential equality constrained quadratic programming algorithm for inequality constrained optimization

✍ Zhibin Zhu 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 200 KB

A method for quadratic programming

✍ Shang-Wang Chang 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 374 KB

QHOPDM — A higher order primal-dual meth

QHOPDM — A higher order primal-dual method for large scale convex quadratic programming

✍ Anna Altman 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 187 KB