Optimizing first-order methods for smooth convex minimization of gradient Q-linearly convergence
Jiaqing YE1, Qianzhu CHEN2, Haiping HU2,*()
1. School of Information Engineering, Huainan Union University, Huainan 232038, Anhui, China 2. College of Sciences, Shanghai University, Shanghai 200444, China
Nesterov Y . A method for unconstrained convex minimization problemwith the rate of convergence O(1/k2)[J]. Soviet Mathematics Doklady, 1983, 27 (2): 372- 376.
2
Nesterov Y. {Introductory lectures on convex optimization: A basiccourse[M]// Applied Optimization, Dordrecht: Kluwer Academic Publishers, 2004.
3
Drori Y , Teboulle M . Performance of first-order methods for smooth convex minimization: a novel approach[J]. Mathematical Programming, 2014, 145 (1-2): 451- 482.
doi: 10.1007/s10107-013-0653-0
4
Kim D , Fessler J A . Optimized first-order methods for smooth convex minimization[J]. Mathematical Programming, 2014, 159 (1-2): 81- 107.
5
Kim D, Fessler J A. Optimizing the Efficiency of First-order Methods for Decreasing the Gradient of Smooth Convex Functions. arXiv: 1803.06600v2[math. OC]
6
Grant M , Boyd S . Graph Implementations for Nonsmooth Convex Programs[J]. Lecture Notes in Control and Information Sciences, 2008, 371, 95- 110.
7
Beck A . Quadratic Matrix Programming[J]. SIAM Journal on Optimization, 2007, 17 (4): 1224- 1238.
doi: 10.1137/05064816X