✦ LIBER ✦

An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints

✍ Scribed by Le Thi Hoai An

Publisher: Springer-Verlag
Year: 2000
Tongue: English
Weight: 218 KB
Volume: 87
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s101070050003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A robust algorithm for quadratic optimiz

A robust algorithm for quadratic optimization under quadratic constraints

✍ Hoang Tuy; N. T. Hoai-Phuong 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 207 KB

Maximization of A convex quadratic funct

Maximization of A convex quadratic function under linear constraints

✍ Hiroshi Konno 📂 Article 📅 1976 🏛 Springer-Verlag 🌐 English ⚖ 522 KB

An algorithm for indefinite quadratic pr

An algorithm for indefinite quadratic programming with convex constraints

✍ LêD. Muu; W. Oettli 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 284 KB

An Efficient Algorithm for Solving Conve

An Efficient Algorithm for Solving Convex–Convex Quadratic Fractional Programs

✍ R. Yamamoto; H. Konno 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 389 KB

Sufficient Global Optimality Conditions

Sufficient Global Optimality Conditions for Non-convex Quadratic Minimization Problems With Box Constraints

✍ V. Jeyakumar; A. M. Rubinov; Z. Y. Wu 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 189 KB

A new penalty function algorithm for con

A new penalty function algorithm for convex quadratic programming

✍ M. Ben-Daya; K.S. Al-Sultan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 607 KB

In this paper, we develop an exterior point algorithm for convex quadratic programming using a penalty function approach. Each iteration in the algorithm consists of a single Newton step followed by a reduction in the value of the penalty parameter. The points generated by the algorithm follow an e