论文信息 - An elementary approach to tight worst case complexity analysis of gradient based methods - 字舞流文

An elementary approach to tight worst case complexity analysis of gradient based methods

M. Teboulle | Yakov Vaisbourd

[1] Jeffrey A. Fessler,et al. Optimizing the Efficiency of First-Order Methods for Decreasing the Gradient of Smooth Convex Functions , 2018, Journal of Optimization Theory and Applications.

[2] Marc Teboulle,et al. A simplified view of first order methods for optimization , 2018, Math. Program..

[3] Amir Beck,et al. First-Order Methods in Optimization , 2017 .

[4] Adrien B. Taylor,et al. Smooth strongly convex interpolation and exact worst-case performance of first-order methods , 2015, Mathematical Programming.

[5] Marc Teboulle,et al. Performance of first-order methods for smooth convex minimization: a novel approach , 2012, Mathematical Programming.

[6] Marc Teboulle,et al. A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems , 2009, SIAM J. Imaging Sci..

[7] Osman Güer. On the convergence of the proximal point algorithm for convex minimization , 1991 .

[8] P. Lions,et al. Splitting Algorithms for the Sum of Two Nonlinear Operators , 1979 .

[9] Boris Polyak,et al. Constrained minimization methods , 1966 .

[10] J. Moreau. Proximité et dualité dans un espace hilbertien , 1965 .