Smooth strongly convex interpolation and exact worst-case performance of first-order methods
Top Cited Papers
- 17 May 2016
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 161 (1-2) , 307-345
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Wallonia-Brussels Federation - Concerted Research Actions (ARC 14/19-060)
- Fonds pour la Formation à la Recherche dans l’Industrie et dans l’Agriculture
- Interuniversity Attraction Poles Programme, initiated by the Belgian State, Science Policy Office
This publication has 15 references indexed in Scilit:
- Analysis and Design of Optimization Algorithms via Integral Quadratic ConstraintsSIAM Journal on Optimization, 2016
- Optimized first-order methods for smooth convex minimizationMathematical Programming, 2015
- Performance of first-order methods for smooth convex minimization: a novel approachMathematical Programming, 2013
- Double Smoothing Technique for Large-Scale Linearly Constrained Convex OptimizationSIAM Journal on Optimization, 2012
- Convex Analysis and Monotone Operator Theory in Hilbert Spaces2011
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring ProblemsIEEE Transactions on Image Processing, 2009
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse ProblemsSIAM Journal on Imaging Sciences, 2009
- Quadratic Matrix ProgrammingSIAM Journal on Optimization, 2007
- Convex Optimization2004
- Lectures on Modern Convex Optimization2001