The Constant Positive Linear Dependence (CPLD) condition for feasible points of nonlinear programming problems was introduced by Qi and Wei and used for the analysis of SQP methods. In the paper where the CPLD was introduced, the authors conjectured that this condition could be a constraint qualification. This conjecture is proved in the present paper. Moreover, it will be shown that the CPLD c...

We study a general multiobjective optimization problem with variational inequality, equality, inequality and abstract constraints. Fritz John type necessary optimality conditions involving Mordukhovich coderivatives are derived. They lead to Kuhn-Tucker type necessary optimality conditions under additional constraint qualifications including the calmness condition, the error bound constraint qu...

Necessary conditions of optimality (NCO) play an important role in optimization problems. They are the major tool to select a set of candidates to minimizers. In optimal control theory, the NCO appear in the form of a Maximum Principle (MP). For certain optimal control problems with state constraints, it might happen that the MP are unable to provide useful information — the set of all admissib...

Abstract: We show how to use intensively local cone approximations to obtain results in some fields of optimization theory such as optimality conditions, constraint qualifications, mean value theorems and error bound.

We consider optimization problems with equality, inequality, and abstract set constraints. We investigate the relations between various characteristics of the constraint set related to the existence of Lagrange multipliers. For problems with no abstract set constraint, the classical condition of quasiregularity provides the connecting link between the most common constraint qualifications and e...

We present a version of the classical Mountain Pass Lemma and explain how to combine it with constraint qualifications to prove that nonlinear programming problems have a unique local minimizer.

For some optimal control problems with pathwise state constraints the standard versions of the necessary conditions of optimality are unable to provide useful information to select minimizers. There exist some literature on stronger forms of the maximum principle, the so-called nondegenerate necessary conditions, that can be informative for those problems. These conditions can be applied when c...

We consider a difficult class of optimization problems that we call a mathematical program with vanishing constraints. Problems of this kind arise in various applications including optimal topology design problems of mechanical structures. We show that some standard constraint qualifications like LICQ and MFCQ usually do not hold at a local minimum of our program, whereas the Abadie constraint ...

We discuss assumptions on the constraint functions that allow constructive description of the geometry of a given set around a given point in terms of the constraints derivatives. Consequences for characterizing solutions of variational and optimization problems are discussed. In the optimization case, these include primal and primal-dual firstand second-order necessary optimality conditions.