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… Expand
On Error Bounds for Quasinormal Programs
TLDR
This note investigates the relation between some constraint qualifications and proves that quasinormality implies the error bound property, while the reciprocal is not true. Expand
A relaxed constant positive linear dependence constraint qualification and applications
TLDR
This work introduces a relaxed version of the constant positive linear dependence constraint qualification (CPLD) that it is shown is enough to ensure the convergence of an augmented Lagrangian algorithm and that it asserts the validity of an error bound. Expand
Relaxed constant positive linear dependence constraint qualification and its application to bilevel programs
TLDR
This paper shows that RCPLD for the general system is a constraint qualification for the optimality condition in terms of limiting subdifferential and limiting normal cone and it is a sufficient condition for the error bound property under the strict complementarity condition under the complementarity system and Clarke regularity conditions for the inequality constraints and the abstract constraint set. Expand
The Constant Rank Condition and Second Order Constraint Qualifications
The Constant Rank condition for feasible points of nonlinear programming problems was defined by Janin in [1]. In that paper the author proved that the condition was a first order constraintExpand
On relaxed constant rank regularity condition in mathematical programming
Regularity conditions or constraint qualifications play an important role in mathematical programming. In this article we present a relaxed version of the constant rank constraint qualificationExpand
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-rankExpand
Sequential constant rank constraint qualifications for nonlinear semidefinite programming with applications
We present new constraint qualification conditions for nonlinear semidefinite programming that extend some of the constant rank-type conditions from nonlinear programming. As an application of theseExpand
Implications of the constant rank constraint qualification
  • Shu Lu
  • Mathematics, Computer Science
  • Math. Program.
  • 2011
TLDR
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. Expand
Implications of the Constant Rank Constraint Qualification
This paper investigates properties of a parametric set defined by finitely many equality and inequality constraints under the constant rank constraint qualification (CRCQ). We show, under the CRCQ,Expand
A Cone-Continuity Constraint Qualification and Algorithmic Consequences
TLDR
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. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 10 REFERENCES
On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
TLDR
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. Expand
The relation between pseudonormality and quasiregularity in constrained optimization
TLDR
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. Expand
Pseudonormality and a Lagrange Multiplier Theory for Constrained Optimization
TLDR
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. Expand
On combining feasibility, descent and superlinear convergence in inequality constrained optimization
TLDR
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. Expand
Lagrange Multipliers and Optimality
TLDR
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. Expand
The Fritz John Necessary Optimality Conditions in the Presence of Equality and Inequality Constraints
Optimality criteria form the foundations of mathematical programming both theoretically and computationally. In general, these criteria can be classified as either necessary or sufficient. Of course,Expand
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
TLDR
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 . Expand
Nonlinear Programming