Efficient generalized conjugate gradient algorithms. I: Theory

DOI10.1007/BF00940464zbMath0702.90077MaRDI QIDQ915657

Elsie Sterbin Gottlieb

Publication date: 1991

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

unconstrained optimizationglobal convergenceconjugacyinexact line searchgeneralized conjugate gradient method

Mathematics Subject Classification ID

Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (only showing first 100 items - show all)

Partially symmetrical derivative-free Liu–Storey projection method for convex constrained equations ⋮ Riemannian Conjugate Gradient Methods: General Framework and Specific Algorithms with Convergence Analyses ⋮ A family of hybrid conjugate gradient methods for unconstrained optimization ⋮ An efficient hybrid conjugate gradient method with sufficient descent property for unconstrained optimization ⋮ The proof of the sufficient descent condition of the Wei-Yao-Liu conjugate gradient method under the strong Wolfe-Powell line search ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Convergence conditions, line search algorithms and trust region implementations for the Polak–Ribière conjugate gradient method ⋮ A recalling-enhanced recurrent neural network: conjugate gradient learning algorithm and its convergence analysis ⋮ New three-term conjugate gradient method with guaranteed global convergence ⋮ Global convergence of a modified conjugate gradient method ⋮ A decent three term conjugate gradient method with global convergence properties for large scale unconstrained optimization problems ⋮ Unnamed Item ⋮ A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations ⋮ Two diagonal conjugate gradient like methods for unconstrained optimization ⋮ An efficient conjugate gradient method with strong convergence properties for non-smooth optimization ⋮ Two families of hybrid conjugate gradient methods with restart procedures and their applications ⋮ Gradient method with multiple damping for large-scale unconstrained optimization ⋮ A new modified three-term conjugate gradient method with sufficient descent property and its global convergence ⋮ Optimization of unconstrained problems using a developed algorithm of spectral conjugate gradient method calculation ⋮ A three-term conjugate gradient algorithm with restart procedure to solve image restoration problems ⋮ A fast inertial self-adaptive projection based algorithm for solving large-scale nonlinear monotone equations ⋮ A modified PRP-type conjugate gradient algorithm with complexity analysis and its application to image restoration problems ⋮ New spectral LS conjugate gradient method for nonlinear unconstrained optimization ⋮ Modified globally convergent Polak-Ribière-Polyak conjugate gradient methods with self-correcting property for large-scale unconstrained optimization ⋮ Efficient implementation of a generalized polak-ribière algorithm for nonlinear optimization ⋮ Modified Dai-Zuan iterative scheme for nonlinear systems and its application ⋮ A new hybrid conjugate gradient algorithm based on the Newton direction to solve unconstrained optimization problems ⋮ A family of gradient methods using Householder transformation with application to hypergraph partitioning ⋮ On a scaled symmetric Dai-Liao-type scheme for constrained system of nonlinear equations with applications ⋮ A hybrid conjugate gradient algorithm for nonconvex functions and its applications in image restoration problems ⋮ A hybrid HS-LS conjugate gradient algorithm for unconstrained optimization with applications in motion control and image recovery ⋮ Globally convergent conjugate gradient algorithms without the Lipschitz condition for nonconvex optimization ⋮ Global convergence of a modified Fletcher–Reeves conjugate gradient method with Wolfe line search ⋮ Global convergence via modified self-adaptive approach for solving constrained monotone nonlinear equations with application to signal recovery problems ⋮ An efficient new hybrid CG-method as convex combination of DY and CD and HS algorithms ⋮ Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition ⋮ GLOBAL CONVERGENCE OF A SPECIAL CASE OF THE DAI–YUAN FAMILY WITHOUT LINE SEARCH ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Modified Nonmonotone Hestenes–Stiefel Type Conjugate Gradient Methods for Large-Scale Unconstrained Problems ⋮ Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization ⋮ A three-parameter family of nonlinear conjugate gradient methods ⋮ A modified conjugate gradient algorithm with backtracking line search technique for large-scale nonlinear equations ⋮ Memory gradient method with Goldstein line search ⋮ GLOBAL CONVERGENCE OF SHORTEST-RESIDUAL FAMILY OF CONJUGATE GRADIENT METHODS WITHOUT LINE SEARCH ⋮ A globally convergent gradient-like method based on the Armijo line search ⋮ An efficient hybrid conjugate gradient method for unconstrained optimization ⋮ GLOBAL CONVERGENCE OF TWO KINDS OF THREE-TERM CONJUGATE GRADIENT METHODS WITHOUT LINE SEARCH ⋮ Two descent hybrid conjugate gradient methods for optimization ⋮ A modified Polak–Ribi‘ere–Polyak descent method for unconstrained optimization ⋮ A Two-Term PRP-Based Descent Method ⋮ Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems ⋮ A new conjugate gradient method for acceleration of gradient descent algorithms ⋮ On two symmetric Dai-Kou type schemes for constrained monotone equations with image recovery application ⋮ Global convergence of three-term conjugate gradient methods on general functions under a new inexact line search strategy ⋮ A sufficient descent three-term conjugate gradient method via symmetric rank-one update for large-scale optimization ⋮ Two Modified Polak–Ribière–Polyak-Type Nonlinear Conjugate Methods with Sufficient Descent Property ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Some sufficient descent conjugate gradient methods and their global convergence ⋮ New hybrid conjugate gradient method as a convex combination of LS and CD methods ⋮ A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization ⋮ A modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition ⋮ Convergence of the descent Dai–Yuan conjugate gradient method for unconstrained optimization ⋮ A Conjugate Gradient Method Based on a Modified Secant Relation for Unconstrained Optimization ⋮ A new family of conjugate gradient methods ⋮ A sufficient descent conjugate gradient method and its global convergence ⋮ Modified Hager–Zhang conjugate gradient methods via singular value analysis for solving monotone nonlinear equations with convex constraint ⋮ Linear Convergence of Descent Methods for the Unconstrained Minimization of Restricted Strongly Convex Functions ⋮ A modified form of conjugate gradient method for unconstrained optimization problems ⋮ A new type of descent conjugate gradient method with exact line search ⋮ A modified Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization ⋮ Two hybrid nonlinear conjugate gradient methods based on a modified secant equation ⋮ A new two-parameter family of nonlinear conjugate gradient methods ⋮ Descent Property and Global Convergence of a New Search Direction Method for Unconstrained Optimization ⋮ New hyrid conjugate gradient method as a convex combination of HZ and CD methods ⋮ An Efficient Hybrid Conjugate Gradient Method for Unconstrained Optimisation ⋮ A new hybrid conjugate gradient method of unconstrained optimization methods ⋮ A hybrid conjugate gradient method based on a quadratic relaxation of the Dai–Yuan hybrid conjugate gradient parameter ⋮ A new spectral conjugate gradient method for large-scale unconstrained optimization ⋮ Two modified spectral conjugate gradient methods and their global convergence for unconstrained optimization ⋮ Another three-term conjugate gradient method close to the memoryless BFGS for large-scale unconstrained optimization problems ⋮ A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations ⋮ Some modified conjugate gradient methods for unconstrained optimization ⋮ New hybrid conjugate gradient method for unconstrained optimization ⋮ Two efficient modifications of AZPRP conjugate gradient method with sufficient descent property ⋮ A descent hybrid conjugate gradient method based on the memoryless BFGS update ⋮ An efficient gradient-free projection algorithm for constrained nonlinear equations and image restoration ⋮ A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection ⋮ A scaled three-term conjugate gradient method for unconstrained optimization ⋮ A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method ⋮ A study of Liu-Storey conjugate gradient methods for vector optimization ⋮ A conjugate gradient type method for the nonnegative constraints optimization problems ⋮ Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing ⋮ A new version of the Liu-Storey conjugate gradient method ⋮ A hybrid conjugate gradient based approach for solving unconstrained optimization and motion control problems ⋮ New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems ⋮ A modified Wei-Yao-Liu conjugate gradient method for unconstrained optimization ⋮ New hybrid conjugate gradient method as a convex combination of LS and FR methods

Cites Work

• Unnamed Item
• Efficient generalized conjugate gradient algorithms. II: Implementation
• Comparison of some conjugate direction procedures for function minimization
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• Globally convergent conjugate gradient algorithms
• Function minimization by conjugate gradients
• The Conjugate Gradient Method for Linear and Nonlinear Operator Equations

This page was built for publication: Efficient generalized conjugate gradient algorithms. I: Theory