A Framework for Globally Convergent Algorithms Using Gradient Bounding Functions

ISSN： 0022-3239

Source： Journal of Optimization Theory and Applications, Vol.100, Iss.3, 1999-03, pp. : 661-697

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

Globally Convergent Optimization Algorithms on Riemannian Manifolds: Uniform Framework for Unconstrained and Constrained Optimization

By Yang Y.

Journal of Optimization Theory and Applications, Vol. 132, Iss. 2, 2007-02 ,pp. : 245-265

Springer Publishing Company

Access to resources Recommend Favorite

A new, globally convergent Riemannian conjugate gradient method

Optimization, Vol. 64, Iss. 4, 2015-04 ,pp. : 1011-1031

Taylor & Francis Ltd

Access to resources Recommend Favorite

Globally convergent algorithms for solving unconstrained optimization problems

Optimization, Vol. 64, Iss. 2, 2015-02 ,pp. : 249-263

Taylor & Francis Ltd

Access to resources Recommend Favorite

Globally Convergent Three-Term Conjugate Gradient Methods that Use Secant Conditions and Generate Descent Search Directions for Unconstrained Optimization

By Sugiki Kaori

Journal of Optimization Theory and Applications, Vol. 153, Iss. 3, 2012-06 ,pp. : 733-757

Springer Publishing Company

Access to resources Recommend Favorite

Globally Convergent Interior-Point Algorithm for Nonlinear Programming

By Akrotirianakis I. Rustem B.

Journal of Optimization Theory and Applications, Vol. 125, Iss. 3, 2005-06 ,pp. : 497-521

Springer Publishing Company

Access to resources Recommend Favorite