Constraint qualifications in nonsmooth optimization: Classification and inter-relations
From MaRDI portal
Publication:5088836
DOI10.23952/jnva.6.2022.2.06OpenAlexW4312771625MaRDI QIDQ5088836
Publication date: 13 July 2022
Published in: Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.23952/jnva.6.2022.2.06
Karush-Kuhn-Tucker optimality conditionsClarke subdifferentialconstraint qualificationslocally Lipschitzsemilocal convexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- On constraint qualifications: motivation, design and inter-relations
- Necessary optimality conditions for nonsmooth semi-infinite programming problems
- On constraint qualifications in nonsmooth optimization.
- Lectures on convex optimization
- General constraint qualifications in nondifferentiable programming
- A generalized derivative for calm and stable functions
- Programming with semilocally convex functions
- Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
- A nonsmooth variant of the Mangasarian-Fromovitz constraint qualification
- Constraint qualifications in a class of nondifferentiable mathematical programming problems
- A Lagrange multiplier rule with small convex-valued subdifferentials for nonsmooth problems of mathematical programming involving equality and nonfunctional constraints
- Optimality conditions in convex optimization revisited
- Constraint qualification in a general class of Lipschitzian mathematical programming problems
- Nonsmooth semi-infinite programming problems with mixed constraints
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Optimality conditions for non-smooth semi-infinite programming
- Generalized Convexity, Nonsmooth Variational Inequalities, and Nonsmooth Optimization
- Constraint Qualifications in Semi-Infinite Systems and Their Applications in Nonsmooth Semi-Infinite Problems with Mixed Constraints
- Optimization and nonsmooth analysis
- Sufficient Conditions for Global Minima of Suitably Convex Functionals from Variational and Control Theory
- A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions]
- Constraint qualifications in maximization problems
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- Convex Analysis
- Theory of Positive Linear Dependence
This page was built for publication: Constraint qualifications in nonsmooth optimization: Classification and inter-relations