Pages that link to "Item:Q1962467"
From MaRDI portal
The following pages link to Locally Farkas-Minkowski systems in convex semi-infinite programming (Q1962467):
Displaying 20 items.
- On implicit active constraints in linear semi-infinite programs with unbounded coefficients (Q535337) (← links)
- Necessary optimality conditions for nonsmooth semi-infinite programming problems (Q537966) (← links)
- Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming (Q724901) (← links)
- Semi-infinite programming (Q869581) (← links)
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces (Q929661) (← links)
- Recent contributions to linear semi-infinite optimization (Q1680760) (← links)
- Recent contributions to linear semi-infinite optimization: an update (Q1730534) (← links)
- Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems (Q1787821) (← links)
- Linear semi-infinite programming theory: an updated survey (Q1848390) (← links)
- Marco A. López, a pioneer of continuous optimization in Spain (Q2189625) (← links)
- On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming (Q2228389) (← links)
- On strong and total Lagrange duality for convex optimization problems (Q2473844) (← links)
- Nonsmooth semi-infinite programming problems with mixed constraints (Q2518285) (← links)
- Optimality conditions for non-smooth semi-infinite programming (Q2786319) (← links)
- Asymptotic optimality conditions for linear semi-infinite programming (Q2790886) (← links)
- Some results about the facial geometry of convex semi-infinite systems (Q3426239) (← links)
- Linear representations and quasipolyhedrality of a finite-valued convex function (Q3498589) (← links)
- Isolated efficiency in nonsmooth semi-infinite multi-objective programming (Q4646538) (← links)
- Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty (Q5121777) (← links)
- New Farkas-type constraint qualifications in convex infinite programming (Q5428420) (← links)