A Note on Cores and Quasi Relative Interiors in Partially Finite Convex Programming

zbMath1496.46077arXiv2005.03265MaRDI QIDQ3391376

Scott B. Lindstrom

Publication date: 28 March 2022

Full work available at URL: https://arxiv.org/abs/2005.03265

zbMATH Keywords

corestrong dualityquasi relative interiorpartially finite convex programmingentropy functional optimization

Mathematics Subject Classification ID

Convex programming (90C25) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)

Cites Work

• Unnamed Item
• Unnamed Item
• Convex analysis and nonlinear optimization. Theory and examples.
• Applied functional analysis. Functional analysis, Sobolev spaces and elliptic differential equations
• Partially finite convex programming. I: Quasi relative interiors and duality theory
• Partially finite convex programming. II: Explicit lattice models
• Techniques of variational analysis
• Duality Relationships for Entropy-Like Minimization Problems
• Consistency of Moment Systems
• Partially-Finite Programming in $L_1 $ and the Existence of Maximum Entropy Estimates
• Convex Analysis
• Proximal Averages for Minimization of Entropy Functionals
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: A Note on Cores and Quasi Relative Interiors in Partially Finite Convex Programming