A new three-term conjugate gradient algorithm for unconstrained optimization
From MaRDI portal
The authors present a new three-term conjugate gradient algorithm for unconstrained optimization by minimization of the one-parametric quadratic model of the objective function. Under certain assumptions, the global convergence analysis of the proposed algorithm for uniformly convex functions is established. Some preliminary numerical results on a collection of 800 large-scale unconstrained optimization test problems are provided to compare the proposed algorithm with other existing ones and show that the considered algorithm is indeed more efficient and more robust.
Recommendations
- A three-term conjugate gradient algorithm for large-scale unconstrained optimization problems
- An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems
- A New Adaptive Subspace Minimization Three-Term Conjugate Gradient Algorithm for Unconstrained Optimization
- An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization
- A new three-term conjugate gradient method with descent direction for unconstrained optimization
Cites work
- A conjugate direction algorithm without line searches
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A Numerical Study of the Limited Memory BFGS Method and the Truncated-Newton Method for Large Scale Optimization
- A simple three-term conjugate gradient algorithm for unconstrained optimization
- A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
- A Two-Term PRP-Based Descent Method
- Acceleration of conjugate gradient algorithms for unconstrained optimization
- Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]
- Benchmarking optimization software with performance profiles.
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
- scientific article; zbMATH DE number 992790 (Why is no real title available?)
- scientific article; zbMATH DE number 3843083 (Why is no real title available?)
- scientific article; zbMATH DE number 3526471 (Why is no real title available?)
- scientific article; zbMATH DE number 3439906 (Why is no real title available?)
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
- On the limited memory BFGS method for large scale optimization
- On three-term conjugate gradient algorithms for unconstrained optimization
- Scaled conjugate gradient algorithms for unconstrained optimization
- Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- Some descent three-term conjugate gradient methods and their global convergence
- Some numerical experiments with variable-storage quasi-Newton algorithms
- Symmetric Perry conjugate gradient method
- Technical Note—A Modified Conjugate Gradient Algorithm
- Updating Quasi-Newton Matrices with Limited Storage
Cited in
(33)- On three-term conjugate gradient algorithms for unconstrained optimization
- A simple three-term conjugate gradient algorithm for unconstrained optimization
- ttcg
- A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems
- An improved Perry conjugate gradient method with adaptive parameter choice
- A double-parameter scaling Broyden-Fletcher-Goldfarb-Shanno method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization
- An adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix
- A three-term conjugate gradient algorithm with quadratic convergence for unconstrained optimization problems
- A new accelerated conjugate gradient method for large-scale unconstrained optimization
- New conjugate gradient algorithms based on self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method
- A class of accelerated subspace minimization conjugate gradient methods
- Spectral three-term constrained conjugate gradient algorithm for function minimizations
- Some three-term conjugate gradient methods with the new direction structure
- A class of globally convergent three-term Dai-Liao conjugate gradient methods
- A hybrid Riemannian conjugate gradient method for nonconvex optimization problems
- A three-term conjugate gradient method with nonmonotone line search for unconstrained optimization
- Comment on ``A new three-term conjugate gradient method for unconstrained problem
- Investigation on a nonmonotone conjugate gradient algorithm with three parameters
- An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems
- A diagonal quasi-Newton updating method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization
- An efficient adaptive three-term extension of the Hestenes-Stiefel conjugate gradient method
- A new conjugate gradient algorithm with cubic Barzilai-Borwein stepsize for unconstrained optimization
- A three-term conjugate gradient algorithm for large-scale unconstrained optimization problems
- A new Dai-Liao type of conjugate gradient algorithm for unconstrained optimization problems
- A New Adaptive Subspace Minimization Three-Term Conjugate Gradient Algorithm for Unconstrained Optimization
- Eigenvalues versus singular values study in conjugate gradient algorithms for large-scale unconstrained optimization
- A one-parameter class of three-term conjugate gradient methods with an adaptive parameter choice
- A three-term conjugate gradient method with a random parameter for large-scale unconstrained optimization and its application in regression model
- Solving Unconstrained Optimization Problems with Some Three-term Conjugate Gradient Methods
- A three-term derivative-free projection algorithm for nonlinear equations with convex constraints: application to image denoising
- An accelerated spectral CG based algorithm for optimization techniques on Riemannian manifolds and its comparative evaluation
- A new three-term conjugate gradient method
- A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations
This page was built for publication: A new three-term conjugate gradient algorithm for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q120735)
