A note on cores and quasi relative interiors in partially finite convex programming

zbMATH Open1496.46077arXiv2005.03265MaRDI QIDQ3391376FDOQ3391376

Authors: Scott B. Lindstrom 

Publication date: 28 March 2022

Abstract: The problem of minimizing an entropy functional subject to linear constraints is a useful example of partially finite convex programming. In the 1990s, Borwein and Lewis provided broad and easy-to-verify conditions that guarantee strong duality for such problems. Their approach is to construct a function in the quasi-relative interior of the relevant infinite-dimensional set, which assures the existence of a point in the core of the relevant finite-dimensional set. We revisit this problem, and provide an alternative proof by directly appealing to the definition of the core, rather than by relying on any properties of the quasi-relative interior. Our approach admits a minor relaxation of the linear independence requirements in Borwein and Lewis' framework, which allows us to work with certain piecewise-defined moment functions precluded by their conditions. We provide such a computed example that illustrates how this relaxation may be used to tame observed Gibbs phenomenon when the underlying data is discontinuous. The relaxation illustrates the understanding we may gain by tackling partially-finite problems from both the finite-dimensional and infinite-dimensional sides. The comparison of these two approaches is informative, as both proofs are constructive.

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

Recommendations

• Partially finite convex programming. I: Quasi relative interiors and duality theory
• Generalizations of Slater's constraint qualification for infinite convex programs
• Facial reduction in partially finite convex programming
• Partially finite convex programming. II: Explicit lattice models
• scientific article; zbMATH DE number 18663

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

• Convex Analysis
• Techniques of variational analysis
• Partially finite convex programming. I: Quasi relative interiors and duality theory
• Convex functions. Constructions, characterizations and counterexamples
• Applied functional analysis. Functional analysis, Sobolev spaces and elliptic differential equations
• Partially finite convex programming. II: Explicit lattice models
• Duality Relationships for Entropy-Like Minimization Problems
• Convex analysis and nonlinear optimization. Theory and examples.
• Convex analysis and monotone operator theory in Hilbert spaces
• Consistency of Moment Systems
• Proximal averages for minimization of entropy functionals
• Partially-Finite Programming in $L_1 $ and the Existence of Maximum Entropy Estimates
• Meetings with Lambert \(\mathcal W\) and other special functions in optimization and analysis

Cited In (1)

• Partially finite convex programming. I: Quasi relative interiors and duality theory

This page was built for publication: A note on cores and quasi relative interiors in partially finite convex programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3391376)