Efficient generalized conjugate gradient algorithms. I: Theory
From MaRDI portal
DOI10.1007/BF00940464zbMATH Open0702.90077MaRDI QIDQ915657FDOQ915657
Authors: Elsie Sterbin Gottlieb 
Publication date: 1991
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Recommendations
global convergenceunconstrained optimizationconjugacygeneralized conjugate gradient methodinexact line search
Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- Function minimization by conjugate gradients
- Title not available (Why is that?)
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
- Efficient generalized conjugate gradient algorithms. II: Implementation
- Comparison of some conjugate direction procedures for function minimization
- Globally convergent conjugate gradient algorithms
Cited In (only showing first 100 items - show all)
- A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations
- An efficient hybrid conjugate gradient method for unconstrained optimization
- Efficient generalized conjugate gradient algorithms. II: Implementation
- Modification of nonlinear conjugate gradient method with weak Wolfe-Powell line search
- A modified HZ conjugate gradient algorithm without gradient Lipschitz continuous condition for non convex functions
- An efficient conjugate gradient-based algorithm for unconstrained optimization and its projection extension to large-scale constrained nonlinear equations with applications in signal recovery and image denoising problems
- Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing
- A new family of hybrid three-term conjugate gradient methods with applications in image restoration
- New hybrid conjugate gradient and Broyden-Fletcher-Goldfarb-Shanno conjugate gradient methods
- The convergence properties of RMIL+ conjugate gradient method under the strong Wolfe line search
- A conjugate gradient method based on a modified secant relation for unconstrained optimization
- A new hybrid PRPFR conjugate gradient method for solving nonlinear monotone equations and image restoration problems
- A descent conjugate gradient algorithm for optimization problems and its applications in image restoration and compression sensing
- A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems
- A new hybrid conjugate gradient method of unconstrained optimization methods
- Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions
- A modified three-term type CD conjugate gradient algorithm for unconstrained optimization problems
- An accelerated conjugate gradient algorithm for solving nonlinear monotone equations and image restoration problems
- A global convergence of LS-CD hybrid conjugate gradient method
- A conjugate gradient algorithm and its applications in image restoration
- Linear convergence of descent methods for the unconstrained minimization of restricted strongly convex functions
- A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function
- A descent hybrid conjugate gradient method based on the memoryless BFGS update
- A framework for generalized conjugate gradient methods -- with special emphasis on contributions by Rüdiger Weiß
- A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method
- Partially symmetrical derivative-free Liu-Storey projection method for convex constrained equations
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Wolfe line search
- A modified Wei-Yao-Liu conjugate gradient method for unconstrained optimization
- Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems
- An efficient hybrid conjugate gradient method for unconstrained optimisation
- Global convergence of conjugate gradient method in unconstrained optimization problems
- A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration
- An efficient gradient-free projection algorithm for constrained nonlinear equations and image restoration
- New hybrid conjugate gradient method as a convex combination of LS and FR methods
- A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization
- Time-delay estimation in state and output equations of nonlinear systems using optimal computational approach
- A modified Polak-Ribière-Polyak descent method for unconstrained optimization
- Global convergence of a descent PRP type conjugate gradient method for nonconvex optimization
- Some sufficient descent conjugate gradient methods and their global convergence
- A class of one parameter conjugate gradient methods
- Title not available (Why is that?)
- A hybrid three-term conjugate gradient projection method for constrained nonlinear monotone equations with applications
- A sufficient descent three-term conjugate gradient method via symmetric rank-one update for large-scale optimization
- A sufficient descent conjugate gradient method and its global convergence
- A recalling-enhanced recurrent neural network: conjugate gradient learning algorithm and its convergence analysis
- Derivative-free three-term spectral conjugate gradient method for symmetric nonlinear equations
- Solving unconstrained optimization problems via hybrid CD-DY conjugate gradient methods with applications
- A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection
- Convergence of a two-parameter family of conjugate gradient methods with a fixed formula of stepsize
- A scaled three-term conjugate gradient method for unconstrained optimization
- Global convergence of a modified LS method
- A survey of gradient methods for solving nonlinear optimization
- GLOBAL CONVERGENCE OF A SPECIAL CASE OF THE DAI–YUAN FAMILY WITHOUT LINE SEARCH
- Two modified spectral conjugate gradient methods and their global convergence for unconstrained optimization
- A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations
- A hybrid conjugate gradient based approach for solving unconstrained optimization and motion control problems
- A modified PRP-type conjugate gradient algorithm with complexity analysis and its application to image restoration problems
- Two modified three-term type 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 new hybrid algorithm for convex nonlinear unconstrained optimization
- GLOBAL CONVERGENCE OF SHORTEST-RESIDUAL FAMILY OF CONJUGATE GRADIENT METHODS WITHOUT LINE SEARCH
- A descent Dai-Liao conjugate gradient method based on a modified secant equation and its global convergence
- A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method
- Three modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization
- The convergence of conjugate gradient method with nonmonotone line search
- A modified form of conjugate gradient method for unconstrained optimization problems
- A modified nonlinear conjugate gradient method with the Armijo line search and its application
- A sufficient descent Dai-Yuan type nonlinear conjugate gradient method for unconstrained optimization problems
- A modified spectral conjugate gradient method for solving unconstrained minimization problems
- Two modified nonlinear conjugate gradient methods with disturbance factors for unconstrained optimization
- Global convergence of a two-parameter family of conjugate gradient methods without line search
- Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property
- A three-term conjugate gradient algorithm with quadratic convergence for unconstrained optimization problems
- A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence
- Some modified conjugate gradient methods for unconstrained optimization
- New hybrid conjugate gradient method for unconstrained optimization
- Two spectral conjugate gradient methods for unconstrained optimization problems
- A new version of the Liu-Storey conjugate gradient method
- New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction
- A generalized conjugate gradient algorithm
- An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation
- Two descent hybrid conjugate gradient methods for optimization
- Some three-term conjugate gradient methods with the inexact line search condition
- A globally convergent hybrid conjugate gradient method with strong Wolfe conditions for unconstrained optimization
- Two modified Polak-Ribière-Polyak-type nonlinear conjugate methods with sufficient descent property
- New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems
- A descent nonlinear conjugate gradient method for large-scale unconstrained optimization
- Global convergence of two kinds of three-term conjugate gradient methods without line search
- A conjugate gradient method for unconstrained optimization problems
- A note about WYL's conjugate gradient method and its applications
- A new modified three-term conjugate gradient method with sufficient descent property and its global convergence
- A new family of conjugate gradient methods
- Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search
- Two new conjugate gradient methods based on modified secant equations
- An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization
- Surrogate gradient algorithm for Lagrangian relaxation
- Convergence conditions, line search algorithms and trust region implementations for the Polak–Ribière conjugate gradient method
- New step lengths in conjugate gradient methods
- Riemannian conjugate gradient methods: general framework and specific algorithms with convergence analyses
This page was built for publication: Efficient generalized conjugate gradient algorithms. I: Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q915657)
