Constraint qualifications in nonsmooth optimization: Classification and inter-relations

DOI10.23952/JNVA.6.2022.2.06MaRDI QIDQ5088836zbMATH OpenOpenAlexFDO

Authors Rimpi, C. S. Lalitha

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

zbMATH Keywords

constraint qualificationslocally LipschitzClarke subdifferentialKarush-Kuhn-Tucker optimality conditionssemilocal convexity

Mathematics Subject Classification ID

Functional analysis (46-XX) Operator theory (47-XX)

Cites work

• scientific article; zbMATH DE number 5866943 (Why is no real title available?)
• scientific article; zbMATH DE number 439380 (Why is no real title available?)
• scientific article; zbMATH DE number 3940090 (Why is no real title available?)
• scientific article; zbMATH DE number 3737398 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 2120969 (Why is no real title available?)
• scientific article; zbMATH DE number 3291743 (Why is no real title available?)
• scientific article; zbMATH DE number 3310599 (Why is no real title available?)
• scientific article; zbMATH DE number 3084780 (Why is no real title available?)
• A Lagrange multiplier rule with small convex-valued subdifferentials for nonsmooth problems of mathematical programming involving equality and nonfunctional constraints
• A generalized derivative for calm and stable functions
• A nonsmooth variant of the Mangasarian-Fromovitz constraint qualification
• A survey of recent[1985-1995]advances in generalized convexity with applications to duality theory and optimality conditions
• Concepts on generalized -subdifferentials for minimizing locally Lipschitz continuous functions
• Constraint qualification in a general class of Lipschitzian mathematical programming problems
• Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
• Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
• Constraint qualifications in a class of nondifferentiable mathematical programming problems
• Constraint qualifications in maximization problems
• Constraint qualifications in semi-infinite systems and their applications in nonsmooth semi-infinite problems with mixed constraints
• Convex Analysis
• General constraint qualifications in nondifferentiable programming
• Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
• Generalized convexity, nonsmooth variational inequalities, and nonsmooth optimization
• Lectures on convex optimization
• Mangasarian-Fromovitz and Zangwill conditions for non-smooth infinite optimization problems in Banach spaces
• Necessary optimality conditions for nonsmooth semi-infinite programming problems
• Nonsmooth semi-infinite programming problems with mixed constraints
• On constraint qualifications in nonsmooth optimization.
• On constraint qualifications: motivation, design and inter-relations
• Optimality conditions for non-smooth semi-infinite programming
• Optimality conditions in convex optimization revisited
• Optimization and nonsmooth analysis
• Programming with semilocally convex functions
• Sufficient Conditions for Global Minima of Suitably Convex Functionals from Variational and Control Theory
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• Theory of Positive Linear Dependence

Cited in

(2)

• A nonsmooth variant of the Mangasarian-Fromovitz constraint qualification
• Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints

This page was built for publication: Constraint qualifications in nonsmooth optimization: Classification and inter-relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088836)