Showing math.OCShow all
2 papers · 1 filter
math.OC2026
A Geometric Perspective on Polynomially Solvable Convex Maximization
Shaoning Han, Liangju Li, Yongchun Li
Convex maximization encompasses a broad class of optimization problems and is generally NP-hard, even for low-rank objectives. This paper investigates structural conditions under w…
math.OC2025
Rank-one convexification for quadratic optimization problems with step function penalties
Soobin Choi, Valentina Cepeda, Andres Gomez +1
We investigate convexification for convex quadratic optimization with step function penalties. Such problems can be cast as mixed-integer quadratic optimization problems, where bin…