RAIRO Oper. Res. | 2019
A penalty method for nonlinear programming
Abstract
This paper presents a variant of logarithmic penalty methods for nonlinear convex programming. If the descent direction is obtained through a classical Newton-type method, the line search is done on a majorant function. Numerical tests show the efficiency of this approach versus classical line searches.