Second order necessary and sufficient conditions for convex composite NDO
Mathematical Programming: Series A and B
Calmness and exact penalization
SIAM Journal on Control and Optimization
Optimality conditions for non-finite valued convex composite functions
Mathematical Programming: Series A and B
Error bounds in mathematical programming
Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Asymptotic analysis for penalty and barrier methods in convex and linear programming
Mathematics of Operations Research
Second-order global optimality conditions for convex composite optimization
Mathematical Programming: Series A and B
Convergence to Second Order Stationary Points in Inequality Constrained Optimization
Mathematics of Operations Research
An Augmented Lagrangian Function with Improved Exactness Properties
SIAM Journal on Optimization
A Nonlinear Lagrangian Approach to Constrained Optimization Problems
SIAM Journal on Optimization
Penalty/Barrier Multiplier Methods for Convex Programming Problems
SIAM Journal on Optimization
Decreasing Functions with Applications to Penalization
SIAM Journal on Optimization
Penalty and Barrier Methods: A Unified Framework
SIAM Journal on Optimization
A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
Mathematics of Operations Research
Further Study on Augmented Lagrangian Duality Theory
Journal of Global Optimization
Hi-index | 0.00 |
We introduce the concept of partially strictly monotone functions and apply it to construct a class of nonlinear penalty functions for a constrained optimization problem. This class of nonlinear penalty functions includes some (nonlinear) penalty functions currently used in the literature as special cases. Assuming that the perturbation function is lower semi-continuous, we prove that the sequence of optimal values of nonlinear penalty problems converges to that of the original constrained optimization problem. First-order and second-order necessary optimality conditions of nonlinear penalty problems are derived by converting the optimality of penalty problems into that of a smooth constrained vector optimization problem. This approach allows for a concise derivation of optimality conditions of nonlinear penalty problems. Finally, we prove that each limit point of the second-order stationary points of the nonlinear penalty problems is a second-order stationary point of the original constrained optimization problem.