activity
20152026
most citedExact Worst-case Performance of First-order Methods for Composite Convex Optimization

109 citations · 280 across the 31 of their papers we have counts for

collaborators
Showing 2026Show all

2 papers · 1 filter

math.OC2026

Mirror descent algorithms with logarithmic barriers

Alberto De Marchi, Yura Malitsky, Adrien B. Taylor

This work derives convergence guarantees for mirror descent and proximal mirror descent algorithms when a logarithmic barrier is used as a distance-generating function. Standard ap…

math.OC2026

Mirror Polyak and a Primal-Dual Lifting

Frederik Kunstner, Ryan D'Orazio, Victor S. Portella +1

First-order methods typically require a specific step-size that depends on the regularity conditions of the objective function, such as the smoothness, Lipschitz continuity, or str…