1.3k citations · 3.8k across the 222 of their papers we have counts for
3 papers · 2 filters
An Adaptive Primal-Dual Framework for Nonsmooth Convex Minimization
Quoc Tran-Dinh, Ahmet Alacaoglu, Olivier Fercoq +1
We propose a new self-adaptive, double-loop smoothing algorithm to solve composite, nonsmooth, and constrained convex optimization problems. Our algorithm is based on Nesterov's sm…
A General Convergence Result for Mirror Descent with Armijo Line Search
Yen-Huan Li, Carlos A. Riofrio, Volkan Cevher
Existing convergence guarantees for the mirror descent algorithm require the objective function to have a bounded gradient or be smooth relative to a Legendre function. The bounded…
A Conditional Gradient Framework for Composite Convex Minimization with Applications to Semidefinite Programming
Alp Yurtsever, Olivier Fercoq, Francesco Locatello +1
We propose a conditional gradient framework for a composite convex minimization template with broad applications. Our approach combines smoothing and homotopy techniques under the…