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

Author： Cartis Coralia   Gould Nicholas I.M.   Toint Philippe L.  

Publisher： Taylor & Francis Ltd

ISSN： 1055-6788

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

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

Abstract

Related content

On Nesterov's smooth Chebyshev–Rosenbrock function

By Jarre Florian  

Optimization Methods and Software, Vol. 28, Iss. 3, 2013-06 ,pp. : 478-484

Taylor & Francis Ltd

Access to resources Recommend Favorite

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

By Richtárik Peter   Takáč Martin  

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

Elsevier

Access to resources Recommend Favorite

On the Chebyshev Function \psi( x )

By Garunkštis R.  

Lithuanian Mathematical Journal, Vol. 43, Iss. 4, 2003-10 ,pp. : 401-409

Springer Publishing Company

Access to resources Recommend Favorite

Chebyshev lattices, a unifying framework for cubature with Chebyshev weight function

By Cools Ronald   Poppe Koen  

Bit Numerical Mathematics, Vol. 51, Iss. 2, 2011-06 ,pp. : 275-288

Springer Publishing Company

Access to resources Recommend Favorite

New Complexity Analysis of the Primal–Dual Method for Semidefinite Optimization Based on the Nesterov–Todd Direction

By Peng J.   Roos C.   Terlaky T.  

Journal of Optimization Theory and Applications, Vol. 109, Iss. 2, 2001-05 ,pp. : 327-343

Springer Publishing Company

Access to resources Recommend Favorite