✦ LIBER ✦

Exactness conditions for a convex differentiable exterior penalty for linear programming

✍ Scribed by Mangasarian, O.L.; Wild, E.W.

Book ID: 115529663
Publisher: Taylor and Francis Group
Year: 2011
Tongue: English
Weight: 171 KB
Volume: 60
Category: Article
ISSN: 0233-1934
DOI: 10.1080/02331930903100158

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Exact Penalty Functions for Convex Bilev

Exact Penalty Functions for Convex Bilevel Programming Problems

✍ G. S. Liu; J. Y. Han; J. Z. Zhang 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 152 KB

New Conditions for Exactness of a Simple

New Conditions for Exactness of a Simple Penalty Function

✍ Howe, Stephen 📂 Article 📅 1973 🏛 Society for Industrial and Applied Mathematics ⚖ 311 KB

ε-optimality criteria for convex program

ε-optimality criteria for convex programming problems via exact penalty functions

✍ Kazunori Yokoyama 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 376 KB

Differentiable Exact Penalty Functions f

Differentiable Exact Penalty Functions for Nonlinear Second-Order Cone Programs

✍ Fukuda, Ellen H.; Silva, Paulo J. S.; Fukushima, Masao 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 343 KB

A sufficient condition for exact penalty

A sufficient condition for exact penalty functions

✍ Alexander J. Zaslavski 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 134 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