Locally Farkas-Minkowski systems in convex semi-infinite programming

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

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

Publication date: 31 January 2000

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

zbMATH Keywords

monotone operators; constraint qualifications; convex semi-infinite programming; locally Farkas-Minkowski systems; subdifferential mappings; Valadier formula

Mathematics Subject Classification ID

90C25: Convex programming

90C34: Semi-infinite programming

Related Items

New Farkas-type constraint qualifications in convex infinite programming, On implicit active constraints in linear semi-infinite programs with unbounded coefficients, Semi-infinite programming, New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces, Linear semi-infinite programming theory: an updated survey, On strong and total Lagrange duality for convex optimization problems, Nonsmooth semi-infinite programming problems with mixed constraints, Optimality conditions for non-smooth semi-infinite programming, Some results about the facial geometry of convex semi-infinite systems, Linear representations and quasipolyhedrality of a finite-valued convex function

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