On the Relation between Constant Positive Linear Dependence Condition and Quasinormality Constraint Qualification

@article{Andreani2005OnTR,
  title={On the Relation between Constant Positive Linear Dependence Condition and Quasinormality Constraint Qualification},
  author={Roberto Andreani and J. M. Mart{\'i}nez and Mar{\'i}a Laura Schuverdt},
  journal={Journal of Optimization Theory and Applications},
  year={2005},
  volume={125},
  pages={473-483}
}
The constant positive linear dependence (CPLD) condition for feasible points of nonlinear programming problems was introduced by Qi and Wei (Ref. 1) and used in the analysis of SQP methods. In that paper, the authors conjectured that the CPLD could be a constraint qualification. This conjecture is proven in the present paper. Moreover, it is shown that the CPLD condition implies the quasinormality constraint qualification, but that the reciprocal is not true. Relations with other constraint… 

The Constant Rank Condition and Second Order Constraint Qualifications

This work proves that the Janin Constant Rank condition is, in addition, a second order constraint qualification.

Relaxed constant positive linear dependence constraint qualification and its application to bilevel programs

  • Mengwei XuJ. Ye
  • Computer Science, Mathematics
    Journal of Global Optimization
  • 2020
This paper extends relaxed constant positive linear dependence constraint qualification to a very general feasibility system which may include Lipschitz continuous inequality constraints, complementarity constraints and abstract constraints and introduces and study some sufficient conditions for RCPLD including the relaxed constant rank constraint qualification.

On relaxed constant rank regularity condition in mathematical programming

It is shown that the relaxed CRCQ (and, consequently, CRCQ too) implies the R-regularity (in other terms the error bound property) of a system of inequalities and equalities and it is proved that the constant positive linear dependence condition also implies R- regularity.

Constant-Rank Condition and Second-Order Constraint Qualification

This work proves that the constant-rank condition is also a second-order constraint qualification, and defines other second- order constraint qualifications.

Sequential constant rank constraint qualifications for nonlinear semidefinite programming with applications

New constraint qualification conditions for nonlinear semidefinite programming are presented that extend some of the constant rank-type conditions from nonlinear programming and provide a unified global convergence proof of a class of algorithms to stationary points without assuming neither uniqueness of the Lagrange multiplier nor boundedness of thelagrange multipliers set.

Implications of the constant rank constraint qualification

  • Shu Lu
  • Mathematics
    Math. Program.
  • 2011
Under the CRCQ, it is shown that the indicator function of this set is prox-regular with compatible parametrization, that the set-valued map that assigns each parameter to the set defined by that parameter satisfies a continuity property similar to the Aubin property, and that the Euclidean projector onto this set are piecewise smooth function.

A Cone-Continuity Constraint Qualification and Algorithmic Consequences

A cone-continuity property (CCP) is defined that will be shown to be the weakest possible constraint qualification (SCQ) and its relation to other constraint qualifications will be clarified.

Sequential constant rank constraint qualifications for nonlinear semidefinite and second-order cone programming with applications

We present new constraint qualification conditions for nonlinear semidefinite and second-order cone programming that extend some of the constant rank-type conditions from nonlinear programming. As an

On strong second-order optimality conditions under relaxed constant rank constraint qualification

We discuss the (first- and second-order) optimality conditions for nonlinear programming under the relaxed constant rank constraint qualification. This condition generalizes the so-called linear

Enhanced Karush–Kuhn–Tucker Conditions for Mathematical Programs with Equilibrium Constraints

  • J. YeJin Zhang
  • Economics, Computer Science
    Journal of Optimization Theory and Applications
  • 2013
It is proved that quasi-normality with regularity implies the existence of a local error bound and several other new constraint qualifications are introduced and shown that the enhanced Mordukhovich stationary condition holds under them.
...

References

SHOWING 1-10 OF 10 REFERENCES

On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods

This paper introduces a constant positive linear dependence condition (CPLD), which is weaker than the Mangasarian--Fromovitz constraint qualification (MFCQ), and shows that a limit point of a sequence of approximating Karush--Kuhn--Tucker points is a KKT point if the CPLD holds there.

The relation between pseudonormality and quasiregularity in constrained optimization

This paper shows that, unlike pseudonormality, quasiregularity cannot play the role of a general constraint qualification in the presence of an abstract set constraint, and investigates the relations between various characteristics of the constraint set related to the existence of Lagrange multipliers.

Pseudonormality and a Lagrange Multiplier Theory for Constrained Optimization

Two new properties, pseudonormality and quasinormality, emerge as central within the taxonomy of interesting constraint characteristics and provide the connecting link between the classical constraint qualifications and two distinct pathways to the existence of Lagrange multipliers.

On combining feasibility, descent and superlinear convergence in inequality constrained optimization

In this note, the essential ingredients for an SQP-based method exhibiting the desired properties are highlighted and a class of such algorithms is described and analyzed.

Lagrange Multipliers and Optimality

Lagrange multipliers are now being seen as arising from a general rule for the subdifferentiation of a nonsmooth objective function which allows black-and-white constraints to be replaced by penalty expressions.

Directional derivative of the marginal function in nonlinear programming

Under the constant rank regularity assumption, a maximin formula is obtained for the directional derivative of the marginal value function of a perturbed nonlinear mathematical programming problem.

Nonlinear Programming

It is shown that if A is closed for all k → x x, k → y y, where ( k A ∈ ) k y x , then ( ) A ∉ y x .

Nonlinear Programming