Solution Set Dimensions in Convex Optimization and Primal-Polar Facial Signatures
Jiaming Ma, Defeng Sun
Abstract
We study the possible dimensions of solution sets in linearly perturbed convex optimization problems and their behavior under convex duality. The dimensions of solution sets and inverse solution sets capture two complementary forms of nonuniqueness: that of optimal solutions for a given perturbation, and that of perturbations for which a given point is optimal. Although these two families are linked by Fenchel conjugacy, we show that their collections of dimensions can be prescribed independently for finite supercoercive convex functions. As a geometric consequence, we prove that the facial dimension signatures of a convex body and its polar can be prescribed independently. The connection between these two realization results is obtained by homogenizing the epigraphs of a function and its conjugate. In contrast, under simultaneous facial exposedness, we establish a dimensional obstruction relating the smallest positive proper face dimensions of the body and its polar. These results resolve two open questions posed by Roshchina and Tunçel.
Create a lesson
Related papers
Matching Randomized Bounds for Finite-Sum Nonconvex-Concave Optimization
Wendao Wu, Haihan Zhang, Qian Chen et al.
Decision-Making in Digital Twins: Optimization, Control, and Learning
Enlu Zhou
Extragradient and Past Extragradient Methods for (L0,L1)-Lipschitz Variational Inequalities
Ezra Greenberg, Nicolas Loizou
A Composite Bayesian Risk--Distributionally Robust Optimization Model for Stochastic Programming with Elliptical Distribution Ambiguity
Renjie Chen, Huifu Xu
Matching Complexity for Second-Order Stationary Point with Sample Reuse
Qian Chen, Wendao Wu, Haihan Zhang et al.
Calibrated α-Barycenters for Multiobjective f-Divergence Optimization
Dier Tang, Peijie Li, Xiaoyuan Zhang