Skip to Main content Skip to Navigation
Journal articles

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.
Complete list of metadatas

https://hal-enac.archives-ouvertes.fr/hal-01294921
Contributor : Laurence Porte <>
Submitted on : Wednesday, March 30, 2016 - 8:56:06 AM
Last modification on : Friday, July 26, 2019 - 11:58:03 AM
Document(s) archivé(s) le : Monday, November 14, 2016 - 9:10:16 AM

File

36394.pdf
Files produced by the author(s)

Identifiers

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⟩

Share

Metrics

Record views

255

Files downloads

220