Facial reduction in partially finite convex programming

DOI10.1007/BF01581693zbMath0828.90136OpenAlexW2133667750MaRDI QIDQ1334956

Adrian S. Lewis

Publication date: 26 September 1994

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01581693

zbMATH Keywords

regularity conditionsfacial reductionconstrained approximationinfinite-dimensional locally convex topological vector spacepartially finite convex programming

Mathematics Subject Classification ID

Convex programming (90C25) Nonsmooth analysis (49J52) Programming in abstract spaces (90C48) Convex functions and convex programs in convex geometry (52A41) Semi-infinite programming (90C34) Existence theories for problems in abstract spaces (49J27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal structure of convex sets. II
• Constrained \(L_ p\) approximation
• Partially finite convex programming. I: Quasi relative interiors and duality theory
• Partially finite convex programming. II: Explicit lattice models
• Constrained best approximation in Hilbert space. II
• Constrained best approximation in Hilbert space
• Integrals which are convex functionals
• A simple constraint qualification in infinite dimensional programming
• Duality Relationships for Entropy-Like Minimization Problems
• Dual Methods in Entropy Maximization. Application to Some Problems in Crystallography
• Strong Rotundity and Optimization
• Partially-Finite Programming in $L_1 $ and the Existence of Maximum Entropy Estimates
• Convex Analysis

This page was built for publication: Facial reduction in partially finite convex programming