Pages that link to "Item:Q1844591"
From MaRDI portal
The following pages link to Classifying convex extremum problems over linear topologies having separation properties (Q1844591):
Displayed 12 items.
- Zero duality gaps in infinite-dimensional programming (Q1263531) (← links)
- An infeasible interior-point algorithm for solving primal and dual geometric programs (Q1361109) (← links)
- Recent contributions to linear semi-infinite optimization (Q1680760) (← links)
- Strong duality and dual pricing properties in semi-infinite linear programming: a non-Fourier-Motzkin elimination approach (Q1695816) (← links)
- Recent contributions to linear semi-infinite optimization: an update (Q1730534) (← links)
- On a compound duality classification for geometric programming (Q1730762) (← links)
- Extending the mixed algebraic-analysis Fourier–Motzkin elimination method for classifying linear semi-infinite programmes (Q2810088) (← links)
- Asymptotic kuhn-tucker conditions in abstract spaces (Q3958295) (← links)
- On a classification scheme for geometric programming and complementarity theorems†<sup>†</sup> (Q4143032) (← links)
- OBSERVATIONS ON INFEASIBILITY DETECTORS FOR CLASSIFYING CONIC CONVEX PROGRAMS (Q4548047) (← links)
- Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming (Q5245019) (← links)
- Convex analysis treated by linear programming (Q5675150) (← links)