Solution Set Dimensions in Convex Optimization and Primal-Polar Facial Signatures
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.
Related
- Inertial Primal-Dual Dynamics Methods Featuring Implicit Hessian-Driven Damping for Convex Optimization Problems in Continuous and Discrete Time
- Primal-Dual Error Bounds and KKT Metric Subregularity in Convex Composite Optimization
- Accelerated primal-dual dynamics and algorithms for convex optimization with nonlinear inequality constraints
- Restarted Accelerated Primal-Dual Algorithms with Adaptive Stepsizes for Nonlinear Conic Constrained Convex Optimization
- A New Primal-Dual Algorithm with Two Convex Combinations and Linesearch for General Convex-Concave Saddle-Point Problems
BibTeX
@misc{ma2026solution,
title = {{Solution Set Dimensions in Convex Optimization and Primal-Polar Facial Signatures}},
author = {Jiaming Ma and Defeng Sun},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.16901},
eprint = {2610.16901},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.16901},
}
RIS
TY - UNPB
TI - Solution Set Dimensions in Convex Optimization and Primal-Polar Facial Signatures
AU - Jiaming Ma
AU - Defeng Sun
PY - 2026
DA - 2026/10/12
PB - arXiv
DO - 10.48550/arxiv.2610.16901
UR - https://arxiv.org/abs/2610.16901
AB - 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.
ER -