Preprint
Jul 2026
Projected-Gradient Analysis for Open-Domain Convex Optimization under Boundary Blow-Up:Application to Controllability Scoring
Convex optimization over a compact convex set when the objective is smooth and convex only on an open domain is studied to demonstrate how candidate exclusion can preserve or destroy feasibility and alter the optimal allocation in a criterion- and horizon-dependent manner.
Kazuhiro Sato
· 1 citation