Stable Movement for Nondual Lipschitz Convex Optimization: Efficiency and Nearly Optimal Oracle RatesResearch Paper
A first-order oracle reveals an objective's value and one subgradient at a queried point. For a convex function, these observations support optimization without a formula for the function. The geometry of the feasible set matters: a Euclidean-Lipschitz objective on a small ℓ1 ball need not have the same query complexity as optimization on a Euclidean ball.…