Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization

E-ISSN： 1029-4945|64|5|1349-1361

ISSN： 0233-1934

Source： Optimization, Vol.64, Iss.5, 2015-05, pp. : 1349-1361

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

Monotone and nonmonotone trust-region-based algorithms for large scale unconstrained optimization problems

By Maciel María

Computational Optimization and Applications, Vol. 54, Iss. 1, 2013-01 ,pp. : 27-43

Springer Publishing Company

Access to resources Recommend Favorite

A Class of Nonmonotone Conjugate Gradient Methods for Unconstrained Optimization

By Liu G.H. Jing L.L. Han L.X. Han D.

Journal of Optimization Theory and Applications, Vol. 101, Iss. 1, 1999-04 ,pp. : 127-140

Springer Publishing Company

Access to resources Recommend Favorite

On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization

By García-Palomares Ubaldo M. García-Urrea Ildemaro J. Rodríguez-Hernández Pedro S.

Optimization Methods and Software, Vol. 28, Iss. 6, 2013-12 ,pp. : 1233-1261

Taylor & Francis Ltd

Access to resources Recommend Favorite

Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization

By Garmanjani R. Vicente L. N.

IMA Journal of Numerical Analysis, Vol. 33, Iss. 3, 2013-07 ,pp. : 1008-1028

Oxford University Press

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