Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
type: Item
instance of: scholarly article
title: Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
zbMATH Open document ID: 1262.90170
author: Kaori Sugiki
author: Yasushi Narushima
author: Hiroshi Yabe
published in: Journal of Optimization Theory and Applications
publication date: 2012-07-31T00:00:00Z
review text: Making use of the three-term conjugate gradient methods by \textit{Y. Narushima, H. Yabe} and \textit{J. A. Ford} [SIAM J. Optim. 21, No. 1, 212--230 (2011; Zbl 1250.90087)], the authors propose three-term conjugate gradient methods based on secant conditions for unconstrained optimization problems and prove the global convergence of the methods. Special-purpose three-term conjugate gradient methods based on structured secant conditions are also given together with applying them to nonlinear least squares problems and some numerical experiments.
reviewed by: Do Van Luu
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C53
zbMATH DE Number: 6062505
zbMATH Keywords: three-term conjugate gradient methods
zbMATH Keywords: secant conditions
zbMATH Keywords: global convergence
zbMATH Keywords: unconstrained optimization problems
zbMATH Keywords: descent search directions
describes a project that uses: CUTEr
describes a project that uses: CG_DESCENT
describes a project that uses: minpack
describes a project that uses: CUTE
MaRDI profile type: Publication
full work available at URL: s10957-011-9960-x
OpenAlex ID: W2039084584
cites work: Function minimization by conjugate gradients
cites work: Q5491447
cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization
cites work: Methods of conjugate gradients for solving linear systems
cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
cites work: Q5479892
cites work: Technical Note—A Modified Conjugate Gradient Algorithm
cites work: New conjugacy conditions and related nonlinear conjugate gradient methods
cites work: Global convergence properties of nonlinear conjugate gradient methods with modified secant condition
cites work: A nonlinear conjugate gradient method based on the MBFGS secant condition
cites work: Multi-step nonlinear conjugate gradient methods for unconstrained minimization
cites work: Nonlinear conjugate gradient methods with structured secant condition for nonlinear least squares problems
cites work: A NEW NONLINEAR CONJUGATE GRADIENT METHOD FOR UNCONSTRAINED OPTIMIZATION
cites work: A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
cites work: Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
cites work: A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
cites work: Some descent three-term conjugate gradient methods and their global convergence
cites work: A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization
cites work: New quasi-Newton equation and related methods for unconstrained optimization
cites work: Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations
cites work: A modified BFGS method and its global convergence in nonconvex minimization
cites work: Multi-step quasi-Newton methods for optimization
cites work: A Two-Term PRP-Based Descent Method
cites work: Sufficient descent nonlinear conjugate gradient methods with conjugacy condition
cites work: Convergence theory for the structured BFGS secant method with an application to nonlinear least squares
cites work: Local and Superlinear Convergence for Partially Known Quasi-Newton Methods
cites work: On the Use of Product Structure in Secant Methods for Nonlinear Least Squares Problems
cites work: CUTE
cites work: Algorithm 851
cites work: Benchmarking optimization software with performance profiles.
cites work: Testing Unconstrained Optimization Software
cites work: Line search algorithms with guaranteed sufficient decrease
DOI: 10.1007/S10957-011-9960-X
description: scientific article; zbMATH DE number 6062505