Implications of the constant rank constraint qualification
From MaRDI portal
Publication:623372
DOI10.1007/S10107-009-0288-3zbMATH Open1214.90113OpenAlexW2009233589MaRDI QIDQ623372FDOQ623372
Authors: Shu Lu 
Publication date: 14 February 2011
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-009-0288-3
Recommendations
- Relation between the constant rank and the relaxed constant rank constraint qualifications
- Constant-rank condition and second-order constraint qualification
- Variational Conditions Under the Constant Rank Constraint Qualification
- A constant rank constraint qualification in continuous-time nonlinear programming
- scientific article; zbMATH DE number 1908161
- Sequential constant rank constraint qualifications for nonlinear semidefinite programming with algorithmic applications
- Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming
- Implications of rank one convexity
- On relaxed constant rank regularity condition in mathematical programming
- Rank-constrained optimization and its applications
Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)
Cites Work
- Title not available (Why is that?)
- Convex Analysis
- Optimization. Algorithms and consistent approximations
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Directional derivative of the marginal function in nonlinear programming
- Implicit Functions and Solution Mappings
- Strongly Regular Generalized Equations
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Prox-regular functions in variational analysis
- Sensitivity analysis for variational inequalities
- Lipschitz Behavior of Solutions to Convex Minimization Problems
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- Strong Stability in Variational Inequalities
- Partial inverse of a monotone operator
- Upper Lipschitz behavior of solutions to perturbed \(C^{1,1}\) programs
- Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy
- On the relation between constant positive linear dependence condition and quasinormality constraint qualification
- Tilt Stability of a Local Minimum
- Directional derivatives of the solution of a parametric nonlinear program
- Sensitivity Analysis of Nonlinear Programs and Differentiability Properties of Metric Projections
- Stability of Locally Optimal Solutions
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- Constraint Nondegeneracy in Variational Analysis
- Title not available (Why is that?)
- Piecewise Smoothness, Local Invertibility, and Parametric Analysis of Normal Maps
- Sensitivity Analysis in Nonlinear Programs and Variational Inequalities via Continuous Selections
- A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
- Directional differentiability of optimal solutions under Slater's condition
- Piecewise Ck functions in nonsmooth analysis
- Sensitivity Analysis for Nonlinear Programs and Variational Inequalities with Nonunique Multipliers
- Differential Stability in Nonlinear Programming
- Aspects of the projector on prox-regular sets
Cited In (19)
- Variational Conditions Under the Constant Rank Constraint Qualification
- Relation between the constant rank and the relaxed constant rank constraint qualifications
- Piecewise Smoothness, Local Invertibility, and Parametric Analysis of Normal Maps
- Variational analysis and full stability of optimal solutions to constrained and minimax problems
- Note on Mangasarian-Fromovitz-like constraint qualifications
- On Lipschitz continuity of projections onto polyhedral moving sets
- On the sensitivity of a Euclidean projection
- Two new weak constraint qualifications for mathematical programs with equilibrium constraints and applications
- Optimality properties of an augmented Lagrangian method on infeasible problems
- On relaxing the Mangasarian-Fromovitz constraint qualification
- Second-order characterizations of tilt stability with applications to nonlinear programming
- Tilt stability in nonlinear programming under Mangasarian-Fromovitz constraint qualification
- ADMM for multiaffine constrained optimization
- On approximate Karush-Kuhn-Tucker conditions for multiobjective optimization problems
- Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming
- On second-order optimality conditions for vector optimization
- On Lipschitz-like continuity of a class of set-valued mappings
- Constant-rank condition and second-order constraint qualification
- Complete characterizations of tilt stability in nonlinear programming under weakest qualification conditions
This page was built for publication: Implications of the constant rank constraint qualification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623372)
