Saddle point criteria and the exact minimax penalty function method in nonconvex programming. (English) Zbl 1279.49022

Antczak, Tadeusz

Taiwanese J. Math. 17, No. 2, 559-581 (2013).

Summary: A new characterization of the exact minimax penalty function method is presented. The exactness of the penalization for the exact minimax penalty function method is analyzed in the context of saddle point criteria of the Lagrange function in the nonconvex differentiable optimization problem with both inequality and equality constraints. Thus, new conditions for the exactness of the exact minimax penalty function method are established under the assumption that the functions constituting the considered constrained optimization problem are invex with respect to the same function \(\eta \) (except those equality constraints for which the associated Lagrange multipliers are negative – these functions should be assumed to be incave with respect to the same function \(\eta \)). The threshold of the penalty parameter is given such that, for all penalty parameters exceeding this treshold, the equivalence holds between a saddle point of the Lagrange function in the considered constrained extremum problem and a minimizer in its associated penalized optimization problem with the exact minimax penalty function.

MSC:

49M37	Numerical methods based on nonlinear programming
49M30	Other numerical methods in calculus of variations (MSC2010)
90C26	Nonconvex programming, global optimization
90C30	Nonlinear programming

Keywords:

exact minimax penalty function method; minimax penalized optimization problem; saddle point; invex function