A note on cores and quasi relative interiors in partially finite convex programming
From MaRDI portal
Publication:3391376
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.
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
Cites work
- Applied functional analysis. Functional analysis, Sobolev spaces and elliptic differential equations
- Consistency of Moment Systems
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex analysis and nonlinear optimization. Theory and examples.
- Convex functions. Constructions, characterizations and counterexamples
- Duality Relationships for Entropy-Like Minimization Problems
- Meetings with Lambert \(\mathcal W\) and other special functions in optimization and analysis
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Partially finite convex programming. II: Explicit lattice models
- Partially-Finite Programming in $L_1 $ and the Existence of Maximum Entropy Estimates
- Proximal averages for minimization of entropy functionals
- Techniques of variational analysis
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)
