On constraint qualifications in nonsmooth optimization.
From MaRDI portal
Publication:703169
DOI10.1023/B:JOTA.0000037607.48762.45zbMath1062.49014OpenAlexW1983523168MaRDI QIDQ703169
Publication date: 11 January 2005
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:jota.0000037607.48762.45
nonsmooth optimizationoptimality conditionssemi-infinite programmingconstraint qualificationsSlater conditionreverse-convex problems
Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Semi-infinite programming (90C34)
Related Items
Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems ⋮ Optimality conditions for semi-infinite and generalized semi-infinite programs via lower order exact penalty functions ⋮ Smoothness properties of a regularized gap function for quasi-variational inequalities ⋮ Nonsmooth multiobjective programming: strong Kuhn-Tucker conditions ⋮ On generalized semi-infinite programming. (With comments and rejoinder). ⋮ Constraint qualifications in nonsmooth optimization: Classification and inter-relations ⋮ Constraint qualifications and optimality criteria for nonsmooth multiobjective programming problems on Hadamard manifolds ⋮ Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints ⋮ A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information ⋮ An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems ⋮ Generalized semi-infinite programming: a tutorial ⋮ Smoothing by mollifiers. I: Semi-infinite optimization ⋮ On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming ⋮ First order optimality conditions for generalized semi-infinite programming problems ⋮ On smoothness properties of optimal value functions at the boundary of their domain under complete convexity ⋮ How to solve a semi-infinite optimization problem ⋮ Necessary optimality conditions for nonsmooth semi-infinite programming problems ⋮ Optimality conditions for non-smooth semi-infinite programming ⋮ On differentiability properties of player convex generalized Nash equilibrium problems
Cites Work
- Constraint qualifications in quasidifferentiable optimization
- General constraint qualifications in nondifferentiable programming
- Differential stability in infinite-dimensional nonlinear programming
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Partially finite convex programming. II: Explicit lattice models
- Generalized semi-infinite optimization: A first order optimality condition and examples
- First-order optimality conditions in generalized semi-infinite programming
- Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
- A nonsmooth variant of the Mangasarian-Fromovitz constraint qualification
- Semi-infinite optimization: Structure and stability of the feasible set
- Bi-level strategies in semi-infinite programming.
- On optimality conditions for generalized semi-infinite programming problems
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
- Generalized semi-infinite programming: numerical aspects
- First-Order Optimality Conditions for Degenerate Index Sets in Generalized Semi-Infinite Optimization
- Semi-Infinite Programming: Theory, Methods, and Applications
- A duality theorem for semi-infinite convex programs and their finite subprograms
- Some examples and counterexamples for the stability analysis of nonlinear programming problems
- On uniqueness of Kuhn-Tucker multipliers in nonlinear programming
- A simple constraint qualification in infinite dimensional programming
- On stability and stationary points in nonlinear optimization
- Structural stability in nonlinear optimization
- Geometry of optimality conditions and constraint qualifications: The convex case
- Differential properties of the marginal function in mathematical programming
- A constraint qualification in quasidifferentiable programming
- Differential Stability in Nonlinear Programming
- Variational Analysis
- Directional Derivatives for Extremal-Value Functions with Applications to the Completely Convex Case
- Geometry of optimality conditions and constraint qualifications
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- Convex Analysis
- Point-to-Set Maps in Mathematical Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
