Showing math.OCShow all
3 papers · 1 filter
math.OC2026
Optimal Gradient-Norm Minimization in Non-Euclidean Hölder-Smooth Convex Optimization
Nico Pelleriti, Maryam Shiran, David Martínez-Rubio +2
Minimizing gradients of a convex function is an important problem across optimization and learning tasks. The gradient provides a directly computable certificate of approximate sta…
math.OC2026
Lower Bounds for Frank-Wolfe on Strongly Convex Sets
Jannis Halbey, Daniel Deza, Max Zimmer +3
We present a constructive lower bound of for Frank-Wolfe (FW) when both the objective and the constraint set are smooth and strongly convex, showing that…
math.OC2025
Objective Coefficient Rounding and Almost Symmetries in Binary Programs
Dominik Kuzinowicz, Paweł Lichocki, Gioni Mexi +3
This article investigates the interplay of rounding objective coefficients in binary programs and almost symmetries. Empirically, reducing the number of significant bits through ro…