scientific article; zbMATH DE number 7140481

DOI10.4086/toc.2019.v015a004zbMath1482.90145OpenAlexW2981349516MaRDI QIDQ5204822

Nikhil Bansal, Anupam Gupta

Publication date: 5 December 2019

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2019.v015a004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

convex optimizationpotential function

Mathematics Subject Classification ID

Convex programming (90C25) Methods of reduced gradient type (90C52)

Related Items

The rate of convergence of optimization algorithms obtained via discretizations of heavy ball dynamical systems for convex optimization problems, A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives, Potential Function-Based Framework for Minimizing Gradients in Convex and Min-Max Optimization, An optimal gradient method for smooth strongly convex minimization, Factor-\(\sqrt{2}\) acceleration of accelerated gradient methods, A Systematic Approach to Lyapunov Analyses of Continuous-Time Models in Convex Optimization, No-regret algorithms in on-line learning, games and convex optimization, Recent theoretical advances in decentralized distributed convex optimization, A Laplacian approach to \(\ell_1\)-norm minimization