An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity

Author： Cartis C. Gould N. I. M. Toint Ph. L.

Publisher： Oxford University Press

ISSN： 1464-3642

Source： IMA Journal of Numerical Analysis, Vol.32, Iss.4, 2012-10, pp. : 1662-1695

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

Updating the regularization parameter in the adaptive cubic regularization algorithm

By Gould N.

Computational Optimization and Applications, Vol. 53, Iss. 1, 2012-09 ,pp. : 1-22

Springer Publishing Company

Access to resources Recommend Favorite

Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces

By Baker Kearfott Ralph Castille Jessie M. Tyagi Gaurav

Optimization Methods and Software, Vol. 29, Iss. 2, 2014-03 ,pp. : 430-441

Taylor & Francis Ltd

Access to resources Recommend Favorite

Semistrictly quasiconvex mappings and non-convex vector optimization

By Flores-Bazán Fabián

Mathematical Methods of Operations Research, Vol. 59, Iss. 1, 2004-02 ,pp. : 129-145

Springer Publishing Company

Access to resources Recommend Favorite

An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization

By Bagirov Adil

Mathematical Methods of Operations Research, Vol. 67, Iss. 2, 2008-04 ,pp. : 187-206

Springer Publishing Company

Access to resources Recommend Favorite

Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization

By Ozdamar L. Demirhan M.

Fuzzy Sets and Systems, Vol. 117, Iss. 1, 2001-01 ,pp. : 47-60

Elsevier

Access to resources Recommend Favorite