On the acceleration of the double smoothing technique for unconstrained convex optimization problems

E-ISSN： 1029-4945|64|2|265-288

ISSN： 0233-1934

Source： Optimization, Vol.64, Iss.2, 2015-02, pp. : 265-288

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

Regularized Newton method for unconstrained convex optimization

By Polyak Roman

Mathematical Programming, Vol. 120, Iss. 1, 2009-08 ,pp. : 125-145

Springer Publishing Company

Access to resources Recommend Favorite

A variational method for unconstrained optimization problems

International Journal of Computer Mathematics, Vol. 84, Iss. 4, 2007-04 ,pp. : 491-503

Taylor & Francis Ltd

Access to resources Recommend Favorite

An acceleration of gradient descent algorithm with backtracking for unconstrained optimization

By Andrei Neculai

Numerical Algorithms, Vol. 42, Iss. 1, 2006-05 ,pp. : 63-73

Springer Publishing Company

Access to resources Recommend Favorite

A Nonmonotone Line Search Slackness Technique for Unconstrained Optimization

By Hu Ping Liu Xu-Qing

Journal of Optimization Theory and Applications, Vol. 158, Iss. 3, 2013-09 ,pp. : 773-786

Springer Publishing Company

Access to resources Recommend Favorite

A sequential approach for unconstrained optimization via a partitioning technique

International Journal of Computer Mathematics, Vol. 92, Iss. 4, 2015-04 ,pp. : 722-741

Taylor & Francis Ltd

Access to resources Recommend Favorite