Enhanced Karush-Kuhn-Tucker condition and weaker constraint qualifications
From MaRDI portal
Publication:353154
DOI10.1007/s10107-013-0667-7zbMath1285.90078MaRDI QIDQ353154
Publication date: 12 July 2013
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-013-0667-7
nonsmooth analysis; value function; calmness; constraint qualification; limiting subdifferential; complementary violation condition; enhanced Fritz John condition; enhanced KKT condition; Ljusternik theorem; local error bound; pseudonormal; quasinormal
90C30: Nonlinear programming
90C46: Optimality conditions and duality in mathematical programming
90C31: Sensitivity, stability, parametric optimization
49J52: Nonsmooth analysis
Related Items
A Sequential Optimality Condition Related to the Quasi-normality Constraint Qualification and Its Algorithmic Consequences, Multiobjective Problems: Enhanced Necessary Conditions and New Constraint Qualifications through Convexificators, Constraint qualifications for nonsmooth programming, Unnamed Item, Unnamed Item, Directional Quasi-/Pseudo-Normality as Sufficient Conditions for Metric Subregularity, New Constraint Qualifications for S-Stationarity for MPEC with Nonsmooth Objective, Second-order enhanced optimality conditions and constraint qualifications, Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints, New results on constraint qualifications for nonlinear extremum problems and extensions, Constraint qualifications for mathematical programs with equilibrium constraints and their local preservation property, Enhanced Karush-Kuhn-Tucker conditions for mathematical programs with equilibrium constraints, On an \(l_1\) exact penalty result for mathematical programs with vanishing constraints, A symmetric Gauss-Seidel based method for a class of multi-period mean-variance portfolio selection problems, Saddle point approximation approaches for two-stage robust optimization problems, On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees, Characterization of generalized FJ and KKT conditions in nonsmooth nonconvex optimization, Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint, Necessary optimality conditions and exact penalization for non-Lipschitz nonlinear programs, Enhanced Fritz John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraints, Characterizing FJ and KKT Conditions in Nonconvex Mathematical Programming with Applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On error bounds for quasinormal programs
- Subgradients of marginal functions in parametric mathematical programming
- Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
- Convex analysis and nonlinear optimization. Theory and examples
- Pseudonormality and a Lagrange multiplier theory for constrained optimization
- Techniques of variational analysis
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Sensitivity Analysis of the Value Function for Optimization Problems with Variational Inequality Constraints
- Sufficient Conditions for Error Bounds
- Mathematical Programs with Equilibrium Constraints: Enhanced Fritz John-conditions, New Constraint Qualifications, and Improved Exact Penalty Results
- Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
- The Lagrange Multiplier Rule
- A New Approach to Lagrange Multipliers
- Variational Analysis
- Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- The relation between pseudonormality and quasiregularity in constrained optimization
- Lagrange Multipliers for Nonconvex Generalized Gradients with Equality, Inequality, and Set Constraints
- On the Calmness of a Class of Multifunctions
- Enhanced Fritz John Conditions for Convex Programming