Relation between the constant rank and the relaxed constant rank constraint qualifications

DOI10.1080/02331934.2010.527972zbMath1246.90144OpenAlexW1986179207MaRDI QIDQ2903140

Shu Lu

Publication date: 23 August 2012

Published in: Optimization (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Set-valued and variational analysis (49J53) Set-valued maps in general topology (54C60)

Related Items (9)

A penalty method for rank minimization problems in symmetric matrices ⋮ On Lipschitz continuity of projections onto polyhedral moving sets ⋮ On Lipschitz-like continuity of a class of set-valued mappings ⋮ On second-order optimality conditions for vector optimization: Addendum ⋮ Convergence conditions for Newton-type methods applied to complementarity systems with nonisolated solutions ⋮ On relaxing the Mangasarian-Fromovitz constraint qualification ⋮ On Lipschitz-Like Property for Polyhedral Moving Sets ⋮ Note on Mangasarian-Fromovitz-like constraint qualifications ⋮ Optimality properties of an augmented Lagrangian method on infeasible problems

Cites Work

• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• Calmness of constraint systems with applications
• Lipschitz Behavior of Solutions to Convex Minimization Problems
• Directional derivative of the marginal function in nonlinear programming
• Implicit Functions and Solution Mappings
• Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
• A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
• Variational Analysis

This page was built for publication: Relation between the constant rank and the relaxed constant rank constraint qualifications