Implications of the constant rank constraint qualification
From MaRDI portal
Publication:623372
DOI10.1007/s10107-009-0288-3zbMath1214.90113MaRDI QIDQ623372
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
projector; set-valued map; prox-regular; constant rank constraint qualification; parametric constraints
90C30: Nonlinear programming
65K10: Numerical optimization and variational techniques
90C31: Sensitivity, stability, parametric optimization
Related Items
Constant-rank condition and second-order constraint qualification, On second-order optimality conditions for vector optimization, On relaxing the Mangasarian-Fromovitz constraint qualification, Variational analysis and full stability of optimal solutions to constrained and minimax problems, Optimality properties of an augmented Lagrangian method on infeasible problems, Second-order characterizations of tilt stability with applications to nonlinear programming, Unnamed Item, On the sensitivity of a Euclidean projection, Complete Characterizations of Tilt Stability in Nonlinear Programming under Weakest Qualification Conditions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partial inverse of a monotone operator
- Sensitivity analysis for variational inequalities
- Optimization. Algorithms and consistent approximations
- Upper Lipschitz behavior of solutions to perturbed \(C^{1,1}\) programs
- On the relation between constant positive linear dependence condition and quasinormality constraint qualification
- Directional derivatives of the solution of a parametric nonlinear program
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- Directional differentiability of optimal solutions under Slater's condition
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Piecewise Ck functions in nonsmooth analysis
- Lipschitz Behavior of Solutions to Convex Minimization Problems
- Directional derivative of the marginal function in nonlinear programming
- Sensitivity Analysis for Nonlinear Programs and Variational Inequalities with Nonunique Multipliers
- Implicit Functions and Solution Mappings
- Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy
- Sensitivity Analysis of Nonlinear Programs and Differentiability Properties of Metric Projections
- Strongly Regular Generalized Equations
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
- Differential Stability in Nonlinear Programming
- Tilt Stability of a Local Minimum
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Strong Stability in Variational Inequalities
- Sensitivity Analysis in Nonlinear Programs and Variational Inequalities via Continuous Selections
- Prox-regular functions in variational analysis
- Piecewise Smoothness, Local Invertibility, and Parametric Analysis of Normal Maps
- Stability of Locally Optimal Solutions
- Convex Analysis
- Constraint Nondegeneracy in Variational Analysis
