𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal objective function approximation for separable convex quadratic programming

✍ Scribed by F. Güder; J. G. Morris

Publisher
Springer-Verlag
Year
1994
Tongue
English
Weight
513 KB
Volume
67
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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