An Oblivious Stochastic Composite Optimization Algorithm for Eigenvalue Optimization Problems
share
In this work, we revisit the problem of solving large-scale semidefinite programs using randomized first-order methods and stochastic smoothing. We introduce two oblivious stochastic mirror descent algorithms based on a complementary composite setting. One algorithm is designed for non-smooth objectives, while an accelerated version is tailored for smooth objectives. Remarkably, both algorithms work without prior knowledge of the Lipschitz constant or smoothness of the objective function. For the non-smooth case with ℳ-bounded oracles, we prove a convergence rate of O( ℳ/√(T) ). For the L-smooth case with a feasible set bounded by D, we derive a convergence rate of O( L^2 D^2/(T^2√(T)) + (D_0^2+σ^2)/√(T) ), where D_0 is the starting distance to an optimal solution, and σ^2 is the stochastic oracle variance. These rates had only been obtained so far by either assuming prior knowledge of the Lipschitz constant or the starting distance to an optimal solution. We further show how to extend our framework to relative scale and demonstrate the efficiency and robustness of our methods on large scale semidefinite programs.
READ FULL TEXT
