Efficient hybrid conjugate gradient techniques
Descent properties and global convergence proofs are given for a new hybrid conjugate gradient algorithm. Computational results for this algorithm are also given and compared with those of the Fletcher-Reeves and the Polak-Ribière methods, showing a considerable improvement over the latter two methods. We also give new criteria for restarting conjugate gradient algorithms that prove to be computationally very efficient. These criteria provide a descent property and global convergence for any conjugate gradient algorithm using a nonnegative update \(\beta\).
- scientific article; zbMATH DE number 938982
- An efficient hybrid conjugate gradient method for unconstrained optimization
- A hybrid conjugate gradient method with sufficient descent property
- New hybrid conjugate gradient method as a convex combination of fr and PRP methods
- Global convergence of an efficient hybrid conjugate gradient method for unconstrained optimization
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Efficient hybrid conjugate gradient techniques
- Function minimization by conjugate gradients
- Globally convergent conjugate gradient algorithms
- scientific article; zbMATH DE number 3843083 (Why is no real title available?)
- scientific article; zbMATH DE number 3919686 (Why is no real title available?)
- scientific article; zbMATH DE number 3687182 (Why is no real title available?)
- scientific article; zbMATH DE number 3591315 (Why is no real title available?)
- On Steepest Descent
- Restart procedures for the conjugate gradient method
- Globally convergent Polak-Ribière-Polyak conjugate gradient methods under a modified Wolfe line search
- Efficient hybrid conjugate gradient techniques
- A generalized conjugate gradient algorithm
- A class of nonmonotone conjugate gradient methods for unconstrained optimization
- Optimization by pattern search
- A descent hybrid conjugate gradient method based on the memoryless BFGS update
- An efficient hybrid conjugate gradient method with the strong Wolfe-Powell line search
- A new conjugate gradient algorithm with sufficient descent property for unconstrained optimization
- New hybrid conjugate gradient and Broyden-Fletcher-Goldfarb-Shanno conjugate gradient methods
- The global convergence of a new mixed conjugate gradient method for unconstrained optimization
- Space-decomposition minimization method for large-scale minimization problems
- Further insight into the convergence of the Fletcher-Reeves method
- A new hybrid PRPFR conjugate gradient method for solving nonlinear monotone equations and image restoration problems
- A modified nonlinear conjugate gradient method with the Armijo line search and its application
- A hybridization of the Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
- Hybrid Riemannian conjugate gradient methods with global convergence properties
- Improved conjugate gradient method for nonlinear system of equations
- 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
- A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection
- New hybrid conjugate gradient method as a convex combination of LS and FR methods
- A globally convergent hybrid conjugate gradient method with strong Wolfe conditions for unconstrained optimization
- The projection technique for two open problems of unconstrained optimization problems
- A spectral conjugate gradient method for solving large-scale unconstrained optimization
- A survey of gradient methods for solving nonlinear optimization
- A global convergence of LS-CD hybrid conjugate gradient method
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
- The convergence properties of RMIL+ conjugate gradient method under the strong Wolfe line search
- A hybrid conjugate gradient method with descent property for unconstrained optimization
- A nonmonotone hybrid conjugate gradient method for unconstrained optimization
- Two descent hybrid conjugate gradient methods for optimization
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- An efficient modification of the Hestenes-Stiefel nonlinear conjugate gradient method with restart property
- A three-parameter family of nonlinear conjugate gradient methods
- New hybrid conjugate gradient method for unconstrained optimization
- 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
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems
- A trust region algorithm with conjugate gradient technique for optimization problems
- A nonmonotone trust region method with new inexact line search for unconstrained optimization
- A new class of nonlinear conjugate gradient coefficients with global convergence properties
- scientific article; zbMATH DE number 179183 (Why is no real title available?)
- Efficient implementation of a generalized polak-ribière algorithm for nonlinear optimization
- Penalty finite element approximations of the stationary power-law Stokes problem
- A family of hybrid conjugate gradient methods for unconstrained optimization
- New hybrid conjugate gradient method as a convex combination of LS and CD methods
- The Hager-Zhang conjugate gradient algorithm for large-scale nonlinear equations
- An efficient hybrid conjugate gradient method for unconstrained optimization
- An efficient hybrid conjugate gradient method with sufficient descent property for unconstrained optimization
- Global convergence properties of the BBB conjugate gradient method
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Wolfe line search
- Nonlinear conjugate gradient method for spectral tomosynthesis
- Modified Hestenes-Steifel conjugate gradient coefficient for unconstrained optimization
- A modified three-term PRP conjugate gradient algorithm for optimization models
- Intensity modulated radiotherapy treatment planning by use of a barrier-penalty multiplier method
- Global convergence of the DY conjugate gradient method with Armijo line search for unconstrained optimization problems
- Two hybrid nonlinear conjugate gradient methods based on a modified secant equation
- Hybrid conjugate gradient methods for unconstrained optimization
- An efficient hybrid conjugate gradient method for unconstrained optimisation
- Comments on ”New hybrid conjugate gradient method as a convex combination of FR and PRP methods”
- A new hybrid conjugate gradient method of unconstrained optimization methods
- A new class of nonlinear conjugate gradient coefficients for unconstrained optimization
- Two fundamental convergence theorems for nonlinear conjugate gradient methods and their applications
- Two families of hybrid conjugate gradient methods with restart procedures and their applications
- A hybrid conjugate gradient algorithm for nonconvex functions and its applications in image restoration problems
- An overview of nonlinear optimization
- A family of accelerated hybrid conjugate gradient method for unconstrained optimization and image restoration
- Another hybrid conjugate gradient method as a convex combination of WYL and CD methods
- A new hybrid CG method as convex combination
- Two efficient spectral hybrid CG methods based on memoryless BFGS direction and Dai–Liao conjugacy condition
- A hybrid CG algorithm for nonlinear unconstrained optimization with application in image restoration
- A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches
- Two modified hybrid conjugate gradient methods for nonconvex vector optimization
- An improved spectral CG method based on Dai–Liao conjugacy condition and quasi-Newton direction
- Hybrid conjugate gradient methods based on an extended least-squares model
- A hybrid conjugate gradient method between MLS and FR in nonparametric statistics
- A hybrid conjugate gradient method with trust region for large-scale unconstrained optimization problems
- A new hybrid conjugate gradient method as a convex combination methods
- New hybrid conjugate gradient method as a convex combination of PRP and RMIL+ methods
- An improved PRP conjugate gradient algorithm with a damping factor within an automatic restarting strategy
- New hybrid conjugate gradient algorithm for vector optimization problems
- An efficient hybrid conjugate gradient method for unconstrained optimization and image restoration problems
- An accelerated spectral CG based algorithm for optimization techniques on Riemannian manifolds and its comparative evaluation
- Two hybrid conjugate gradient based algorithms on Riemannian manifolds with adaptive restart strategy for nonconvex optimization problems
- Global convergence of hybrid conjugate gradient method and its application to nonparametric estimation
- A descent hybridization of the Polak–Ribière–Polyak and Fletcher–Reeves conjugate gradient methods with applications to nonnegative matrix factorization and compressive sensing
- Mini-batch stochastic conjugate gradient algorithms with minimal variance
- An efficient matrix free optimization algorithm combining a revised PRP and FR-CG type methods with application to robotics
- A scaled nonlinear conjugate gradient method for unrestricted optimizations
- A conjugate gradient method with descent direction for unconstrained optimization
- A self-adaptive trust region method with line search based on a simple subproblem model
- Global convergence properties of the two new dependent Fletcher-Reeves conjugate gradient methods
- The convergence properties of some new conjugate gradient methods
- A descent nonlinear conjugate gradient method for large-scale unconstrained optimization
- A conjugate gradient method for unconstrained optimization problems
This page was built for publication: Efficient hybrid conjugate gradient techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1117142)