Locally Farkas-Minkowski systems in convex semi-infinite programming
DOI10.1023/A:1021700702376zbMATH Open0945.90069OpenAlexW1480121753MaRDI QIDQ1962467FDOQ1962467
Authors: María D. Fajardo, Marco Antonio López Cerdá 
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
Recommendations
- Constraint qualifications for semi-infinite systems of convex inequalities
- Quasi-Slater and Farkas-Minkowski qualifications for semi-infinite programming with applications
- Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
- Constraint qualifications and Farkas lemma in convex infinite programming
- New constraint qualification and optimality for linear semi-infinite programming
constraint qualificationsmonotone operatorsconvex semi-infinite programminglocally Farkas-Minkowski systemssubdifferential mappingsValadier formula
Cites Work
- Variational Analysis
- Convex Analysis
- Convex functions, monotone operators and differentiability.
- Locally Farkas-Minkowski linear inequality systems
- Optimality conditions for nondifferentiable convex semi-infinite programming
- Stability Theory for Linear Inequality Systems
- Title not available (Why is that?)
Cited In (23)
- On implicit active constraints in linear semi-infinite programs with unbounded coefficients
- On strong and total Lagrange duality for convex optimization problems
- Linear representations and quasipolyhedrality of a finite-valued convex function
- Semi-infinite programming
- Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming
- Necessary optimality conditions for nonsmooth semi-infinite programming problems
- Isolated efficiency in nonsmooth semi-infinite multi-objective programming
- Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
- Alternative KKT conditions for (semi)infinite convex optimization
- Linear semi-infinite programming theory: an updated survey
- Locally Farkas-Minkowski linear inequality systems
- New Farkas-type constraint qualifications in convex infinite programming
- Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems
- A new tour on the subdifferential of the supremum function
- Some results about the facial geometry of convex semi-infinite systems
- Marco A. López, a pioneer of continuous optimization in Spain
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- Nonsmooth semi-infinite programming problems with mixed constraints
- Recent contributions to linear semi-infinite optimization
- Optimality conditions for non-smooth semi-infinite programming
- On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming
- Recent contributions to linear semi-infinite optimization: an update
- Asymptotic optimality conditions for linear semi-infinite programming
This page was built for publication: Locally Farkas-Minkowski systems in convex semi-infinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962467)
