An interior-point ℓ1-penalty method for nonlinear optimization

Nick I M Gould, Dominique Orban, Philippe L. Toint

Résultats de recherche: Contribution dans un livre/un catalogue/un rapport/dans les actes d'une conférenceChapitre (revu par des pairs)Revue par des pairs

Résumé

We describe a mixed interior/exterior-point method for nonlinear programming that handles constraints by way of an ℓ1-penalty function. The penalty problem is reformulated as a smooth inequality-constrained problem that always possesses bounded multipliers, and that may be solved using interior-point techniques as finding a strictly feasible point is trivial. If finite multipliers exist for the original problem, exactness of the penalty function eliminates the need to drive the penalty parameter to infinity. If the penalty parameter needs to increase without bound and if feasibility is ultimately attained, a certificate of degeneracy is delivered. Global and fast local convergence of the proposed scheme are established and practical aspects of the method are discussed.

langue originaleAnglais
titreSpringer Proceedings in Mathematics and Statistics
Sous-titreProceedings of NAOIII 2014
EditeurSpringer New York
Pages117-150
Nombre de pages34
Volume134
ISBN (imprimé)9783319176888
Les DOIs
Etat de la publicationPublié - 2015
Evénement3rd International Conference on Numerical Analysis and Optimization: Theory, Methods, Applications and Technology Transfer, NAOIII-2014 - Muscat, Oman
Durée: 5 janv. 20149 janv. 2014

Une conférence

Une conférence3rd International Conference on Numerical Analysis and Optimization: Theory, Methods, Applications and Technology Transfer, NAOIII-2014
Pays/TerritoireOman
La villeMuscat
période5/01/149/01/14

Empreinte digitale

Examiner les sujets de recherche de « An interior-point ℓ1-penalty method for nonlinear optimization ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation