{"list":"other","total":52,"rows":[{"id":"2106.01946","title":"Convex optimization","created":"2021-06-03","cited_by_count":2515},{"id":"1909.05207","title":"Introduction to Online Convex Optimization","created":"2019-09-07","cited_by_count":803},{"id":"1405.4980","title":"Convex Optimization: Algorithms and Complexity","created":"2014-05-20","cited_by_count":575},{"id":"1912.13213","title":"Online Learning: A Modern Introduction Using Convex Optimization","created":"2019-12-31","cited_by_count":417},{"id":"1711.00141","title":"Training GANs with Optimism","created":"2017-10-31","cited_by_count":217},{"id":"1503.01243","title":"A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights","created":"2015-03-04","cited_by_count":206},{"id":"1311.1869","title":"Optimization, Learning, and Games with Predictable Sequences","created":"2013-11-08","cited_by_count":188},{"id":"1507.00407","title":"Fast Convergence of Regularized Learning in Games","created":"2015-07-02","cited_by_count":150},{"id":"1802.10551","title":"A Variational Inequality Perspective on Generative Adversarial Networks","created":"2018-02-28","cited_by_count":144},{"id":"1807.02629","title":"Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile","created":"2018-07-07","cited_by_count":136},{"id":"1603.04245","title":"A Variational Perspective on Accelerated Methods in Optimization","created":"2016-03-14","cited_by_count":110},{"id":"1610.05708","title":"Relatively-Smooth Convex Optimization by First-Order Methods, and Applications","created":"2016-10-18","cited_by_count":108},{"id":"1408.3595","title":"Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints","created":"2014-08-15","cited_by_count":105},{"id":"1908.08465","title":"On the convergence of single-call stochastic extra-gradient methods","created":"2019-08-22","cited_by_count":89},{"id":"1511.05932","title":"On the Global Linear Convergence of Frank-Wolfe Optimization Variants","created":"2015-11-18","cited_by_count":77},{"id":"1808.02901","title":"Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems","created":"2018-08-08","cited_by_count":76},{"id":"1810.08907","title":"Understanding the Acceleration Phenomenon via High-Resolution Differential Equations","created":"2018-10-21","cited_by_count":69},{"id":"1407.1537","title":"Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent","created":"2014-07-06","cited_by_count":58},{"id":"1910.13857","title":"UniXGrad: A Universal, Adaptive Algorithm with Optimal Guarantees for Constrained Optimization","created":"2019-10-30","cited_by_count":56},{"id":"2101.09545","title":"Acceleration Methods","created":"2021-01-23","cited_by_count":48},{"id":"1406.1305","title":"Faster Rates for the Frank-Wolfe Method over Strongly-Convex Sets","created":"2014-06-05","cited_by_count":44},{"id":"1705.10499","title":"Online to Offline Conversions, Universality and Adaptive Minibatch Sizes","created":"2017-05-30","cited_by_count":39},{"id":"1803.08832","title":"Golden Ratio Algorithms for Variational Inequalities","created":"2018-03-23","cited_by_count":38},{"id":"1507.02000","title":"An optimal randomized incremental gradient method","created":"2015-07-08","cited_by_count":33},{"id":"1703.00260","title":"Extragradient method with variance reduction for stochastic variational inequalities","created":"2017-03-01","cited_by_count":33},{"id":"1403.4164","title":"Accelerated Schemes For A Class of Variational Inequalities","created":"2014-03-17","cited_by_count":30},{"id":"1912.07481","title":"On Lower Iteration Complexity Bounds for the Saddle Point Problems","created":"2019-12-16","cited_by_count":28},{"id":"1712.02485","title":"The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods","created":"2017-12-07","cited_by_count":27},{"id":"1504.01577","title":"From Averaging to Acceleration, There is Only a Step-size","created":"2015-04-07","cited_by_count":24},{"id":"1506.08187","title":"A geometric alternative to Nesterov's accelerated gradient descent","created":"2015-06-26","cited_by_count":22},{"id":"1706.04381","title":"Dissipativity Theory for Nesterov's Accelerated Method","created":"2017-06-14","cited_by_count":22},{"id":"1807.10455","title":"Acceleration through Optimistic No-Regret Dynamics","created":"2018-07-27","cited_by_count":22},{"id":"2101.10040","title":"Complexity of Linear Minimization and Projection on Some Sets","created":"2021-01-25","cited_by_count":20},{"id":"1309.5548","title":"Optimal Primal-Dual Methods for a Class of Saddle Point Problems","created":"2013-09-22","cited_by_count":19},{"id":"1301.4666","title":"A Linearly Convergent Conditional Gradient Algorithm with Applications to Online and Stochastic Optimization","created":"2013-01-20","cited_by_count":18},{"id":"2011.06572","title":"Relative Lipschitzness in Extragradient Methods and a Direct Recipe for Acceleration","created":"2020-11-12","cited_by_count":18},{"id":"1307.0873","title":"New Analysis and Results for the Frank-Wolfe Method","created":"2013-07-02","cited_by_count":17},{"id":"2002.11860","title":"Stochastic Frank-Wolfe for Constrained Finite-Sum Minimization","created":"2020-02-27","cited_by_count":14},{"id":"1302.2325","title":"Conditional Gradient Algorithms for Norm-Regularized Smooth Convex Optimization","created":"2013-02-10","cited_by_count":13},{"id":"1902.08949","title":"Training GANs with Centripetal Acceleration","created":"2019-02-24","cited_by_count":13},{"id":"1702.03040","title":"Following the Leader and Fast Rates in Linear Prediction: Curved Constraint Sets and Other Regularities","created":"2017-02-10","cited_by_count":11},{"id":"1709.02490","title":"Exploiting Problem Structure in Optimization under Uncertainty via Online Convex Optimization","created":"2017-09-08","cited_by_count":11},{"id":"1605.06492","title":"Linear-memory and Decomposition-invariant Linearly Convergent Conditional Gradient Algorithm for Structured Polytopes","created":"2016-05-20","cited_by_count":9},{"id":"2002.03213","title":"Curvature of Feasible Sets in Offline and Online Optimization","created":"2020-02-08","cited_by_count":9},{"id":"1706.04680","title":"Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method","created":"2017-06-14","cited_by_count":8},{"id":"1807.07680","title":"Generalized Stochastic Frank-Wolfe Algorithm with Stochastic \"Substitute\" Gradient for Structured Convex Optimization","created":"2018-07-20","cited_by_count":8},{"id":"1310.2639","title":"Gauge optimization and duality","created":"2013-10-09","cited_by_count":6},{"id":"2103.05907","title":"Linear Bandits on Uniformly Convex Sets","created":"2021-03-10","cited_by_count":6},{"id":"1406.5439","title":"A forward-backward view of some primal-dual optimization methods in image recovery","created":"2014-06-20","cited_by_count":5},{"id":"1604.06543","title":"An optimal first order method based on optimal quadratic averaging","created":"2016-04-22","cited_by_count":5},{"id":"1812.10198","title":"Perturbed Fenchel duality and first-order methods","created":"2018-12-26","cited_by_count":3},{"id":"1801.02509","title":"Convergence rates of proximal gradient methods via the convex conjugate","created":"2018-01-08","cited_by_count":2}],"next_cursor":null}