Optimality conditions for nondifferentiable convex semi-infinite programming
From MaRDI portal
Publication:3308655
DOI10.1007/BF02591906zbMath0527.49029OpenAlexW2035264075MaRDI QIDQ3308655
Marco A. López, Enriqueta Vercher
Publication date: 1983
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02591906
constraint qualificationsconvex semi-infinite programmingFarkas-Minkowski qualificationLagrange saddle pointsSlater qualification
Convex programming (90C25) Semi-infinite programming (90C34) Methods of successive quadratic programming type (90C55) Optimality conditions for free problems in two or more independent variables (49K10)
Related Items (24)
Saddle point criteria in nonsmooth semi-infinite minimax fractional programming problems ⋮ Optimality conditions for semi-infinite and generalized semi-infinite programs via lower order exact penalty functions ⋮ A theory of linear inequality systems ⋮ Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems ⋮ Marco A. López, a pioneer of continuous optimization in Spain ⋮ Optimality and duality analysis for multiobjective interval-valued semi-Infinite optimization problem having vanishing constraints ⋮ Necessary conditions for nonsmooth multiobjective semi-infinite problems using Michel-penot subdifferential ⋮ Necessary and sufficient conditions for regularity of constraints in convex programming ⋮ An optimality test for semi-infinite linear programming ⋮ Locally Farkas-Minkowski systems in convex semi-infinite programming ⋮ 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 ⋮ Moreau--Rockafellar-Type Formulas for the Subdifferential of the Supremum Function ⋮ Saddle point criteria in semi-infinite minimax fractional programming under (Φ,ρ)-invexity ⋮ Necessary optimality conditions for nonsmooth semi-infinite programming problems ⋮ Subsmooth semi-infinite and infinite optimization problems ⋮ Optimality conditions for non-smooth semi-infinite programming ⋮ Invexity: an updated survey and new results for nonsmooth functions ⋮ Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming ⋮ Nonsmooth semi-infinite programming problems with mixed constraints ⋮ Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions ⋮ Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity ⋮ Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification ⋮ Convex semi-infinite games
Cites Work
- Clark's theorem for semi-infinite convex programs
- A strengthened test for optimality
- Foundations of optimization
- Higher order necessary conditions in abstract mathematical programming
- On infinite systems of linear inequalities
- Uniform duality in semi-infinite convex optimization
- Optimality conditions for convex semi-infinite programming problems
- Direct theorems in semi-infinite convex programming
- An Infinite Linear Program with a Duality Gap
- On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
- Convex Analysis
- The Critical Set of a Convex Body
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Optimality conditions for nondifferentiable convex semi-infinite programming
