Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function

Publisher： Elsevier

ISSN： 0025-5610

Source： Mathematical Programming, Vol.144, Iss.1-2, 2014-04, pp. : 1-38

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization

By Tseng P.

Journal of Optimization Theory and Applications, Vol. 109, Iss. 3, 2001-06 ,pp. : 475-494

Springer Publishing Company

Access to resources Recommend Favorite

A note about the complexity of minimizing Nesterov's smooth Chebyshev–Rosenbrock function

By Cartis Coralia Gould Nicholas I.M. Toint Philippe L.

Optimization Methods and Software, Vol. 28, Iss. 3, 2013-06 ,pp. : 451-457

Taylor & Francis Ltd

Access to resources Recommend Favorite

Forward-backward-based descent methods for composite variational inequalities

By He Bingsheng

Optimization Methods and Software, Vol. 28, Iss. 4, 2013-08 ,pp. : 706-724

Taylor & Francis Ltd

Access to resources Recommend Favorite

Parallel Versions of the Modified Coordinate and Gradient Descent Methods and Their Application to a Class of Global Optimization Problems

By Zavriev S.K. Perunova Y.N.

Computational Mathematics and Modeling, Vol. 14, Iss. 2, 2003-04 ,pp. : 108-122

Springer Publishing Company

Access to resources Recommend Favorite

Finite Difference Schemes and Block Rayleigh Quotient Iteration for Electronic Structure Calculations on Composite Grids

By Fattebert J-L.

Journal of Computational Physics, Vol. 149, Iss. 1, 1999-02 ,pp. : 75-94

Academic Press

Access to resources Recommend Favorite