Showing math.OCShow all
2 papers · 1 filter
math.OC2025
Lagrangian Dual Sections: A Topological Perspective on Hidden Convexity
Venkat Chandrasekaran, Timothy Duff, Jose Israel Rodriguez +1
Hidden convexity is a powerful idea in optimization: under the right transformations, nonconvex problems that are seemingly intractable can be solved efficiently using convex optim…
math.OC2025
Any-Dimensional Polynomial Optimization via de Finetti Theorems
Eitan Levin, Venkat Chandrasekaran
Polynomial optimization problems often arise in sequences indexed by dimension, and it is of interest to compute bounds on the optimal values of all problems in the sequence. Examp…