Efficient generalized conjugate gradient algorithms. I: Theory
From MaRDI portal
The effect of inexact line search on conjugacy is studied in unconstrained optimization. A generalized conjugate gradient method based on this effect is proposed and shown to have global convergence for a twice continuously differentiable function with a bounded level set. For part II see [\textit{Y. F. Hu} and second author, J. Optim. Theory Appl. 69, No. 1, 139--152 (1991; Zbl 0724.90068)].
Recommendations
Cites work
- Comparison of some conjugate direction procedures for function minimization
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Efficient generalized conjugate gradient algorithms. II: Implementation
- Function minimization by conjugate gradients
- Globally convergent conjugate gradient algorithms
- scientific article; zbMATH DE number 3843083 (Why is no real title available?)
- The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
Cited in
(only showing first 100 items - show all)- A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems
- Penalty algorithm based on conjugate gradient method for solving portfolio management problem
- An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation
- On three-term conjugate gradient algorithms for unconstrained optimization
- A generalized conjugate gradient algorithm
- Surrogate gradient algorithm for Lagrangian relaxation
- Minimization of extended quadratic functions with inexact line searches
- A framework for generalized conjugate gradient methods -- with special emphasis on contributions by Rüdiger Weiß
- A descent hybrid conjugate gradient method based on the memoryless BFGS update
- A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method
- A modified Wei-Yao-Liu conjugate gradient method for unconstrained optimization
- A class of one parameter conjugate gradient methods
- Modification of nonlinear conjugate gradient method with weak Wolfe-Powell line search
- Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems
- Two modified three-term type conjugate gradient methods and their global convergence for unconstrained optimization
- 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
- Time-delay estimation in state and output equations of nonlinear systems using optimal computational approach
- New hybrid conjugate gradient and Broyden-Fletcher-Goldfarb-Shanno conjugate gradient methods
- Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search
- Global convergence of a modified LS method
- A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex 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 modified nonlinear conjugate gradient method with the Armijo line search and its application
- A modified three-term type CD conjugate gradient algorithm for unconstrained optimization problems
- A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems
- A modified hybrid conjugate gradient method for unconstrained optimization
- A hybrid three-term conjugate gradient projection method for constrained nonlinear monotone equations with applications
- A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration
- Solving unconstrained optimization problems via hybrid CD-DY conjugate gradient methods with applications
- Global convergence of a descent PRP type conjugate gradient method for nonconvex optimization
- A modified HZ conjugate gradient algorithm without gradient Lipschitz continuous condition for non convex functions
- Two spectral conjugate gradient methods for unconstrained optimization problems
- 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 efficient modifications of AZPRP conjugate gradient method with sufficient descent property
- 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 study of Liu-Storey conjugate gradient methods for vector optimization
- Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing
- A hybrid conjugate gradient based approach for solving unconstrained optimization and motion control problems
- New hybrid conjugate gradient method as a convex combination of LS and FR methods
- A convergent hybrid three-term conjugate gradient method with sufficient descent property for unconstrained optimization
- Adaptive three-term PRP algorithms without gradient Lipschitz continuity condition for nonconvex functions
- A new family of hybrid three-term conjugate gradient methods with applications in image restoration
- Approximation methods with inertial term for large-scale nonlinear monotone equations
- A modified Dai-Kou-type method with applications to signal reconstruction and blurred image restoration
- Nonmonotone spectral gradient method based on memoryless symmetric rank-one update for large-scale unconstrained optimization
- Two new conjugate gradient methods for unconstrained optimization
- A globally convergent hybrid conjugate gradient method with strong Wolfe conditions for unconstrained optimization
- Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions
- An accelerated conjugate gradient algorithm for solving nonlinear monotone equations and image restoration problems
- Modified three-term Liu-Storey conjugate gradient method for solving unconstrained optimization problems and image restoration problems
- A derivative-free Liu-Storey method for solving large-scale nonlinear systems of equations
- A survey of gradient methods for solving nonlinear optimization
- An adaptive three-term conjugate gradient method with sufficient descent condition and conjugacy condition
- A global convergence of LS-CD hybrid conjugate gradient method
- An efficient modified PRP-FR hybrid conjugate gradient method for solving unconstrained optimization problems
- Efficient generalized conjugate gradient algorithms. II: Implementation
- The convergence properties of RMIL+ conjugate gradient method under the strong Wolfe line search
- Spectral three-term constrained conjugate gradient algorithm for function minimizations
- An efficient Dai-Liao type conjugate gradient method by reformulating the CG parameter in the search direction equation
- New investigation for the Liu-Story scaled conjugate gradient method for nonlinear optimization
- Some three-term conjugate gradient methods with the new direction structure
- A conjugate gradient algorithm and its applications in image restoration
- A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function
- A new hybrid algorithm for convex nonlinear unconstrained optimization
- 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
- Two modified nonlinear conjugate gradient methods with disturbance factors for unconstrained optimization
- A scaled three-term conjugate gradient method for unconstrained optimization
- A conjugate gradient type method for the nonnegative constraints optimization problems
- A new version of the Liu-Storey conjugate gradient method
- The proof of the sufficient descent condition of the Wei-Yao-Liu conjugate gradient method under the strong Wolfe-Powell line search
- Global convergence of a modified conjugate gradient method
- 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
- Memory gradient method with Goldstein line search
- Two descent hybrid conjugate gradient methods for optimization
- Some sufficient descent conjugate gradient methods and their global convergence
- 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
- A new family of conjugate gradient methods
- A recalling-enhanced recurrent neural network: conjugate gradient learning algorithm and its convergence analysis
- A decent three term conjugate gradient method with global convergence properties for large scale unconstrained optimization problems
- A three-parameter family of nonlinear conjugate gradient methods
- Some modified conjugate gradient methods for unconstrained optimization
- New hybrid conjugate gradient method for unconstrained optimization
- 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
- Linear convergence of descent methods for the unconstrained minimization of restricted strongly convex functions
- A hybrid conjugate gradient method based on a quadratic relaxation of the Dai-Yuan hybrid conjugate gradient parameter
- New three-term conjugate gradient method with guaranteed global convergence
- Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition
- A modified nonmonotone hestenes-Stiefel type conjugate gradient methods for large-scale unconstrained problems
- Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems
- Two modified Polak-Ribière-Polyak-type nonlinear conjugate methods with sufficient descent property
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization
- scientific article; zbMATH DE number 3876470 (Why is no real title available?)
- Convergence properties of a class of nonlinear conjugate gradient methods
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)
