Constant rank constraint qualifications: a geometric introduction
نویسندگان
چکیده
Constraint qualifications (CQ) are assumptions on the algebraic description of the feasible set of an optimization problem that ensure that the KKT conditions hold at any local minimum. In this work we show that constraint qualifications based on the notion of constant rank can be understood as assumptions that ensure that the polar of the linear approximation of the tangent cone, generated by the active gradients, retains it geometric structure locally.
منابع مشابه
Constant-Rank Condition and Second-Order Constraint Qualification
The constant-rank condition for feasible points of nonlinear programming problems was defined by Janin (Math. Program. Study 21:127–138, 1984). In that paper, the author proved that the constant-rank condition is a first-order constraint qualification. In this work, we prove that the constant-rank condition is also a secondorder constraint qualification. We define other second-order constraint ...
متن کاملTwo New Weak Constraint Qualifications for Mathematical Programs with Equilibrium Constraints and Applications
We introduce two new weaker Constraint Qualifications (CQs) for mathematical programs with equilibrium (or complementarity) constraints, MPEC for short. One of them is a tailored version of the constant rank of subspace component (CRSC) and the other is a relaxed version of the MPECNo Nonzero Abnormal Multiplier Constraint Qualification (MPEC-NNAMCQ). Both incorporate the exact set of gradients...
متن کاملA relaxed constant positive linear dependence constraint qualification and applications
In this work we introduce a relaxed version of the constant positive linear dependence constraint qualification (CPLD) that we call RCPLD. This development is inspired by a recent generalization of the constant rank constraint qualification from Minchenko and Stakhovski that was called RCR. We show that RCPLD is enough to ensure the convergence of an augmented Lagrangian algorithm and asserts t...
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملPseudonormality and a Lagrange Multiplier Theory
Lagrange multipliers are central to analytical and computational studies in linear and nonlinear optimization and have applications in a wide variety of fields, including communication, networking, economics, and manufacturing. In the past, the main research in Lagrange multiplier theory has focused on developing general and easily verifiable conditions on the constraint set, called constraint ...
متن کامل