Perturbation analysis of second order programming problems

We discuss first and second order optimality conditions for nonlinear second-order cone programming problems, and their relation with semidefinite programming problems. For doing this we extend in an abstract setting the notion of optimal partition. Then we state a characterization of strong regularity in terms of second order optimality conditions. Citation Research Report 5293 (August … Read more

Necessary and Sufficient Optimality Conditions for Mathematical Programs with Equilibrium Constraints

In this paper we consider a mathematical program with equilibrium constraints (MPEC) formulated as a mathematical program with complementarity constraints. Various stationary conditions for MPECs exist in literature due to different reformulations. We give a simple proof to the M-stationary condition and show that it is sufficient or locally sufficient for optimality under some MPEC … Read more

Universal Duality in Conic Convex Optimization

Given a primal-dual pair of linear programs, it is well known that if their optimal values are viewed as lying on the extended real line, then the duality gap is zero, unless both problems are infeasible, in which case the optimal values are +infinity and -infinity. In contrast, for optimization problems over nonpolyhedral convex cones, … Read more

A robust SQP method for mathematical programs with linear complementarity constraints

The relationship between the mathematical program with linear complementarity constraints (MPCC) and its inequality relaxation is studied. A new sequential quadratic programming (SQP) method is presented for solving the MPCC based on this relationship. A certain SQP technique is introduced to deal with the possible infeasibility of quadratic programming subproblems. Global convergence results are derived … Read more