Two modified spectral conjugate gradient methods and their global convergence for unconstrained optimization
From MaRDI portal
Publication:5028623
DOI10.1080/00207160.2017.1366457zbMath1499.65230OpenAlexW2745335868MaRDI QIDQ5028623
Hong-yang Li, Yan-Tao Tian, Jing Wang, Zhongbo Sun
Publication date: 10 February 2022
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2017.1366457
global convergenceconjugacy conditionspectral conjugate gradient methodunconstrained optimization problemssufficient descent direction
Related Items (6)
A novel robust fixed-time convergent zeroing neural network for solving time-varying noise-polluted nonlinear equations ⋮ A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery ⋮ An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition ⋮ Spectral conjugate gradient methods for vector optimization problems ⋮ Discrete-time zeroing neural network of \(O(\tau^4)\) pattern for online solving time-varying nonlinear optimization problem: application to manipulator motion generation ⋮ Modified Newton integration algorithm with noise suppression for online dynamic nonlinear optimization
Uses Software
Cites Work
- Unnamed Item
- 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
- Two modified scaled nonlinear conjugate gradient methods
- A modified Perry's conjugate gradient method-based derivative-free method for solving large-scale nonlinear monotone equations
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
- Efficient generalized conjugate gradient algorithms. I: Theory
- A modified conjugacy condition and related nonlinear conjugate gradient method
- A hybrid of DL and WYL nonlinear conjugate gradient methods
- A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition
- Two descent hybrid conjugate gradient methods for optimization
- Optimization theory and methods. Nonlinear programming
- A modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition
- New three-term conjugate gradient method with guaranteed global convergence
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- A Modified BFGS Algorithm for Unconstrained Optimization
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Function minimization by conjugate gradients
- Some descent three-term conjugate gradient methods and their global convergence
- CUTEr and SifDec
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- A modified BFGS method and its global convergence in nonconvex minimization
- A spectral conjugate gradient method for unconstrained optimization
- Benchmarking optimization software with performance profiles.
- An efficient hybrid conjugate gradient method for unconstrained optimization
This page was built for publication: Two modified spectral conjugate gradient methods and their global convergence for unconstrained optimization
