Classifying convex extremum problems over linear topologies having separation properties

DOI10.1016/0022-247X(74)90270-4zbMath0283.90043MaRDI QIDQ1844591

Yanyan Li

Publication date: 1974

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

OBSERVATIONS ON INFEASIBILITY DETECTORS FOR CLASSIFYING CONIC CONVEX PROGRAMS, An infeasible interior-point algorithm for solving primal and dual geometric programs, Recent contributions to linear semi-infinite optimization, Strong duality and dual pricing properties in semi-infinite linear programming: a non-Fourier-Motzkin elimination approach, Convex analysis treated by linear programming, Recent contributions to linear semi-infinite optimization: an update, On a compound duality classification for geometric programming, On a classification scheme for geometric programming and complementarity theorems†^†, Extending the mixed algebraic-analysis Fourier–Motzkin elimination method for classifying linear semi-infinite programmes, Zero duality gaps in infinite-dimensional programming, Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming, Asymptotic kuhn-tucker conditions in abstract spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Duality and stability in extremum problems involving convex functions
• Asymptotic cones and duality of linear relations
• Asymptotic duality over closed convex sets
• Erratum: Asymptotic duality over closed convex sets
• Linear programs in topological vector spaces
• A note on duality gaps in linear programming over convex sets
• Programmes in Paired Spaces
• On a classification scheme for geometric programming and complementarity theorems†^†
• Nonconvex Linear Topologies with the Hahn Banach Extension Property
• Symmetric Duality for Generalized Unconstrained Geometric Programming
• Non-Chebyshevian Moment Problems
• Linear Programming in Reflexive Spaces
• Classification Schemes for the Strong Duality of Linear Programming Over Cones
• On Refinements of Some Duality Theorems in Linear Programming over Cones
• Solution Sets of Convex Programs Related to Chemical Equilibrium Problems
• Convex analysis treated by linear programming