2 papers
math.OC2026
Attainment Boundaries and Escape Rates in Asymptotically Conic Optimization
Vinh Nguyen
We study attainment boundaries for linear optimization over unbounded convex sets. For epigraphs of finite convex functions, convex conjugacy separates recession-cone copositivity,…
math.OC2025
Non-Attainment of Minima in Non-Polyhedral Conic Optimization: A Robust SOCP Example
Vinh Nguyen
A fundamental theorem of linear programming states that a feasible linear program is solvable if and only if its objective function is copositive with respect to the recession cone…