Year: 2026
Type: preprint
Abstract: Detecting hidden convexity is one of the tools to address nonconvex minimization problems, and find global minimizers. We introduce the notion of conditional infimum, develop the theory, and establish a tower property, relevant for minimization problems. Then, we illustrate how the conditional infimum is instrumental in revealing hidden convexity. Thus equipped, we provide a new sufficient condition for hidden convexity in nonconvex quadratic minimization problems, that encompasses and goes beyond known results (with the notion of block-signed pair matrix-vector). We also show how the conditional infimum is especially adapted to tackle the so-called S-procedure.
Source: arXiv (Cornell University)
Institution: CERMICS
Language: English
Subfield: Numerical Analysis
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7214029474
Cites:
Cited by:
Related to: