Showing math.OCShow all
3 papers · 1 filter
math.OC2026
A Certificate of Unboundedness for Polynomial Optimization Problems
Rohan Rele, Angelia Nedich
Global polynomial optimization methods typically rely on compactness of the feasible region in order to find solutions. These methods can incur considerable computational expense a…
math.OC2025
On existence of solutions to non-convex minimization problems
Rohan Rele, Angelia Nedich
We provide a unified framework for a systematic analysis of the existence of solutions to general nonconvex problems, relying on asymptotic and retractive cones for functions and s…
math.OC2024
A Stochastic Record-Value Approach to Global Simulation Optimization
Rohan Rele, Zelda Zabinsky, Giulia Pedrielli +1
Black-box optimization is ubiquitous in machine learning, operations research and engineering simulation. Black-box optimization algorithms typically do not assume structural infor…