New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction
From MaRDI portal
Publication:668710
DOI10.1016/j.amc.2015.07.067zbMath1410.90195OpenAlexW1229081129MaRDI QIDQ668710
Xiao Liang Dong, Yu Bo He, Hong-Wei Liu
Publication date: 19 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2015.07.067
global convergencethree-term conjugate gradient methodsufficient descent conditionspectral scaling conjugacy condition
Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Methods of reduced gradient type (90C52)
Related Items (9)
Comment on ``A new three-term conjugate gradient method for unconstrained problem ⋮ Global convergence of a new sufficient descent spectral three-term conjugate gradient class for large-scale optimization ⋮ An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition ⋮ Solving Unconstrained Optimization Problems with Some Three-term Conjugate Gradient Methods ⋮ A hybrid Riemannian conjugate gradient method for nonconvex optimization problems ⋮ A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations ⋮ Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization ⋮ Least-squares-based three-term conjugate gradient methods ⋮ A NEW THREE–TERM CONJUGATE GRADIENT METHOD WITH DESCENT DIRECTION FOR UNCONSTRAINED OPTIMIZATION
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On three-term conjugate gradient algorithms for unconstrained optimization
- A simple three-term conjugate gradient algorithm for unconstrained optimization
- Another conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization
- Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
- An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization
- Some nonlinear conjugate gradient methods with sufficient descent condition and global convergence
- Efficient generalized conjugate gradient algorithms. I: Theory
- Convergence properties of the Beale-Powell restart algorithm
- An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization
- A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition
- A descent extension of the Polak-Ribière-Polyak conjugate gradient method
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
- A modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition
- A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- CUTE
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Function minimization by conjugate gradients
- A Two-Term PRP-Based Descent Method
- Convergence Conditions for Ascent Methods
- A descent family of Dai–Liao conjugate gradient methods
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Benchmarking optimization software with performance profiles.
This page was built for publication: New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction
