Locally Farkas-Minkowski systems in convex semi-infinite programming

DOI10.1023/A:1021700702376zbMath0945.90069OpenAlexW1480121753MaRDI QIDQ1962467

M. D. Fajardo, Marco A. López

Publication date: 31 January 2000

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021700702376

zbMATH Keywords

monotone operatorsconstraint qualificationsconvex semi-infinite programminglocally Farkas-Minkowski systemssubdifferential mappingsValadier formula

Mathematics Subject Classification ID

Convex programming (90C25) Semi-infinite programming (90C34)

Related Items

Semi-infinite programming ⋮ Recent contributions to linear semi-infinite optimization ⋮ Linear representations and quasipolyhedrality of a finite-valued convex function ⋮ Marco A. López, a pioneer of continuous optimization in Spain ⋮ Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty ⋮ New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming ⋮ Isolated efficiency in nonsmooth semi-infinite multi-objective programming ⋮ On strong and total Lagrange duality for convex optimization problems ⋮ On implicit active constraints in linear semi-infinite programs with unbounded coefficients ⋮ Necessary optimality conditions for nonsmooth semi-infinite programming problems ⋮ New Farkas-type constraint qualifications in convex infinite programming ⋮ Optimality conditions for non-smooth semi-infinite programming ⋮ Asymptotic optimality conditions for linear semi-infinite programming ⋮ Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming ⋮ Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems ⋮ Nonsmooth semi-infinite programming problems with mixed constraints ⋮ Some results about the facial geometry of convex semi-infinite systems ⋮ Linear semi-infinite programming theory: an updated survey

Cites Work

• Unnamed Item
• Convex functions, monotone operators and differentiability.
• Locally Farkas-Minkowski linear inequality systems
• Optimality conditions for nondifferentiable convex semi-infinite programming
• Variational Analysis
• Stability Theory for Linear Inequality Systems
• Convex Analysis