On relaxed constant rank regularity condition in mathematical programming

DOI10.1080/02331930902971377zbMath1250.90093OpenAlexW2086194488MaRDI QIDQ3093072

Sergey Stakhovski, Leonid Minchenko

Publication date: 12 October 2011

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930902971377

zbMATH Keywords

Lagrange multiplierserror boundsregularity conditionsconstraint qualificationsnon-linear programming

Mathematics Subject Classification ID

Sensitivity, stability, well-posedness (49K40) Sensitivity, stability, parametric optimization (90C31) Best approximation, Chebyshev systems (41A50)

Related Items (46)

On the best achievable quality of limit points of augmented Lagrangian schemes ⋮ A globally convergent regularized interior point method for constrained optimization ⋮ A relaxed constant positive linear dependence constraint qualification for mathematical programs with equilibrium constraints ⋮ Characterization of Tilt Stability via Subgradient Graphical Derivative with Applications to Nonlinear Programming ⋮ First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition ⋮ Second-order strong Karush/Kuhn-Tucker conditions for proper efficiencies in multiobjective optimization ⋮ A Note on the McCormick Second-Order Constraint Qualification ⋮ Weak notions of nondegeneracy in nonlinear semidefinite programming ⋮ A second-order convergence augmented Lagrangian method using non-quadratic penalty functions ⋮ Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints ⋮ Optimality conditions for nonlinear second-order cone programming and symmetric cone programming ⋮ Relaxed constant positive linear dependence constraint qualification and its application to bilevel programs ⋮ Sequential constant rank constraint qualifications for nonlinear semidefinite programming with algorithmic applications ⋮ Unnamed Item ⋮ Error Bounds and Multipliers in Constrained Optimization Problems with Tolerance ⋮ New results on constraint qualifications for nonlinear extremum problems and extensions ⋮ On Lipschitz continuity of projections onto polyhedral moving sets ⋮ On Lipschitz-like continuity of a class of set-valued mappings ⋮ Optimality Conditions and Constraint Qualifications for Generalized Nash Equilibrium Problems and Their Practical Implications ⋮ On second-order optimality conditions for continuously Fréchet differentiable vector optimization problems ⋮ An adaptively regularized sequential quadratic programming method for equality constrained optimization ⋮ Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points ⋮ On a conjecture in second-order optimality conditions ⋮ Error estimation in nonlinear optimization ⋮ On error bounds for quasinormal programs ⋮ A relaxed constant positive linear dependence constraint qualification and applications ⋮ On second-order optimality conditions for vector optimization: Addendum ⋮ Convergence conditions for Newton-type methods applied to complementarity systems with nonisolated solutions ⋮ On error bounds and Newton-type methods for generalized Nash equilibrium problems ⋮ Optimality conditions and exact penalty for mathematical programs with switching constraints ⋮ Optimality conditions and global convergence for nonlinear semidefinite programming ⋮ On relaxing the Mangasarian-Fromovitz constraint qualification ⋮ An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem ⋮ Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization ⋮ On strong and weak second-order necessary optimality conditions for nonlinear programming ⋮ On Lipschitz-Like Property for Polyhedral Moving Sets ⋮ Note on Mangasarian-Fromovitz-like constraint qualifications ⋮ New constraint qualifications and optimality conditions for second order cone programs ⋮ Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming ⋮ On tangent cone to systems of inequalities and equations in Banach spaces under relaxed constant rank condition ⋮ A flexible inexact-restoration method for constrained optimization ⋮ Optimality properties of an augmented Lagrangian method on infeasible problems ⋮ Convergence results of an augmented Lagrangian method using the exponential penalty function ⋮ Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming ⋮ R-regularity of set-valued mappings under the relaxed constant positive linear dependence constraint qualification with applications to parametric and bilevel optimization ⋮ Erratum to: ``New constraint qualifications and optimality conditions for second order cone programs

Cites Work

• On the relation between constant positive linear dependence condition and quasinormality constraint qualification
• Multivalued analysis and nonlinear programming problems with perturbations
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• Directional derivative of the marginal function in nonlinear programming
• Calmness and Error Bounds for Convex Constraint Systems
• Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
• On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
• On the Calmness of a Class of Multifunctions
• Piecewise Smoothness, Local Invertibility, and Parametric Analysis of Normal Maps
• First-order approximations of multivalued mappings and directional differentiability of maximum functions

This page was built for publication: On relaxed constant rank regularity condition in mathematical programming