Necessary optimality conditions for nonsmooth semi-infinite programming problems
From MaRDI portal
Publication:537966
DOI10.1007/s10898-010-9561-5zbMath1254.90264OpenAlexW2040427335MaRDI QIDQ537966
Publication date: 23 May 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9561-5
Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Related Items (23)
Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems ⋮ Solving vector interval-valued optimization problems with infinite interval constraints via integral-type penalty function ⋮ DC semidefinite programming and cone constrained DC optimization. I: Theory ⋮ A Unified Study of Necessary and Sufficient Optimality Conditions for Minimax and Chebyshev Problems with Cone Constraints ⋮ Constraint qualifications in nonsmooth optimization: Classification and inter-relations ⋮ Non-convex semi-infinite min-max optimization with noncompact sets ⋮ On saddle points in nonconvex semi-infinite programming ⋮ Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems ⋮ Sufficient Optimality Conditions for a Robust Multiobjective Problem ⋮ Stationarity and regularity of infinite collections of sets: applications to infinitely constrained optimization ⋮ Necessary conditions for nonsmooth multiobjective semi-infinite problems using Michel-penot subdifferential ⋮ Unnamed Item ⋮ On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming ⋮ Optimality conditions for semi-infinite programming problems involving generalized convexity ⋮ Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators ⋮ On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data ⋮ Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems ⋮ $$\varPhi -$$ Weak Slater Constraint Qualification in Nonsmooth Multiobjective Semi-infinite Programming ⋮ Karush-Kuhn-Tucker Optimality Conditions and Duality for Multiobjective Semi-Infinite Programming Via Tangential Subdifferentials ⋮ Optimality and duality for nonsmooth semi-infinite multiobjective programming with support functions ⋮ Competitive equilibriums and social shaping for multi-agent systems ⋮ Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification ⋮ On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle
Cites Work
- Unnamed Item
- On constraint qualifications in nonsmooth optimization.
- Semi-infinite programming
- Locally Farkas-Minkowski linear inequality systems
- Handbook of global optimization
- Locally Farkas-Minkowski systems in convex semi-infinite programming
- On strong and total Lagrange duality for convex optimization problems
- Nonsmooth semi-infinite programming problems with mixed constraints
- Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
- Optimality conditions for non-smooth semi-infinite programming
- Accurate Numerical Approximations of Eigenfrequencies and Eigenfunctions of Elliptic Membranes
- General Semi-Infinite Programming: Symmetric Mangasarian–Fromovitz Constraint Qualification and the Closure of the Feasible Set
- Optimality conditions for nondifferentiable convex semi-infinite programming
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Optimization and nonsmooth analysis
- Variational Analysis
- Lagrange Multipliers in Nonsmooth Semi-Infinite Optimization Problems
- New Farkas-type constraint qualifications in convex infinite programming
- Mathematical theory of optimization
This page was built for publication: Necessary optimality conditions for nonsmooth semi-infinite programming problems
