Automatic decrease of the penalty parameter in exact penalty function methods

Abstract : This paper presents an analysis of the involvement of the penalty parameter in exact penalty function methods that yields modifications to the standard outer loop which decreases the penalty parameter (typically dividing it by a constant). The procedure presented is based on the simple idea of making explicit the dependence of the penalty function upon the penalty parameter and is illustrated on a linear programming problem with the l1 exact penalty function and an active-set approach. The procedure decreases the penalty parameter, when needed, to the maximal value allowing the inner minimization algorithm to leave the current iterate. It moreover avoids unnecessary calculations in the iteration following the step in which the penalty parameter is decreased. We report on preliminary computational results which show that this method can require fewer iterations than the standard way to update the penalty parameter. This approach permits a better understanding of the performance of exact penalty methods.
Type de document :
Article dans une revue
European Journal of Operational Research, Elsevier, 1995, 83 (3), pp. 686-699. 〈10.1016/0377-2217(93)E0339-Y〉
Liste complète des métadonnées

https://hal-enac.archives-ouvertes.fr/hal-01294921
Contributeur : Laurence Porte <>
Soumis le : mercredi 30 mars 2016 - 08:56:06
Dernière modification le : jeudi 26 octobre 2017 - 16:34:02
Document(s) archivé(s) le : lundi 14 novembre 2016 - 09:10:16

Fichier

36394.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Marcel Mongeau, Annick Sartenaer. Automatic decrease of the penalty parameter in exact penalty function methods. European Journal of Operational Research, Elsevier, 1995, 83 (3), pp. 686-699. 〈10.1016/0377-2217(93)E0339-Y〉. 〈hal-01294921〉

Partager

Métriques

Consultations de la notice

177

Téléchargements de fichiers

81