Steering exact penalty methods for nonlinear programming
Optimization Methods & Software - Dedicated to Professor Michael J.D. Powell on the occasion of his 70th birthday
A Complementarity Constraint Formulation of Convex Multiobjective Optimization Problems
INFORMS Journal on Computing
Infeasibility Detection and SQP Methods for Nonlinear Optimization
SIAM Journal on Optimization
A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints
SIAM Journal on Optimization
A general MPCC model and its solution algorithm for continuous network design problem
Mathematical and Computer Modelling: An International Journal
A smoothing-regularization approach to mathematical programs with vanishing constraints
Computational Optimization and Applications
| Hi-index | 0.00 |
We prove that any accumulation point of an elastic mode approach, that approximately solves the relaxed subproblems, is a C-stationary point of the problem of optimizing a parametric mixed P variational inequality. If, in addition, the accumulation point satisfies the MPCC-LICQ constraint qualification, and if the solutions of the subproblem satisfy approximate second-order sufficient conditions, then the limiting point is an M-stationary point. Moreover, if the accumulation point satisfies the upper-level strict complementarity condition, the accumulation point will be a strongly stationary point. If we assume that the penalty function associated with the feasible set of the mathematical program with complementarity constraints has bounded level sets, and if the objective function is bounded below, we show that the algorithm will produce bounded iterates and will therefore have at least one accumulation point. We prove that the obstacle problem satisfies our assumptions for both a rigid and a deformable obstacle. The theoretical conclusions are validated by several numerical examples.