An improved Perry conjugate gradient method with adaptive parameter choice
From MaRDI portal
Publication:1656676
DOI10.1007/s11075-017-0422-xzbMath1396.65099OpenAlexW2758502599MaRDI QIDQ1656676
Shengwei Yao, Lihua Shi, Donglei He
Publication date: 10 August 2018
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-017-0422-x
global convergencemathematical programmingconjugate gradient methodscontinuous optimizationPerry update matrix
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)
Related Items
An accelerated descent CG algorithm with clustering the eigenvalues for large-scale nonconvex unconstrained optimization and its application in image restoration problems ⋮ A class of accelerated conjugate-gradient-like methods based on a modified secant equation ⋮ A class of new three-term descent conjugate gradient algorithms for large-scale unconstrained optimization and applications to image restoration problems ⋮ A globally convergent gradient-like method based on the Armijo line search ⋮ Superlinear convergence of nonlinear conjugate gradient method and scaled memoryless BFGS method based on assumptions about the initial point ⋮ A Perry-type derivative-free algorithm for solving nonlinear system of equations and minimizing ℓ1regularized problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A simple three-term conjugate gradient algorithm for unconstrained optimization
- A new three-term conjugate gradient algorithm for unconstrained optimization
- Symmetric Perry conjugate gradient method
- Globally convergent modified Perry's conjugate gradient method
- An adaptive conjugate gradient algorithm for large-scale unconstrained optimization
- A limited memory descent Perry conjugate gradient method
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- A new class of spectral conjugate gradient methods based on a modified secant equation for unconstrained optimization
- The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
- Two optimal Dai–Liao conjugate gradient methods
- A new class of efficient and globally convergent conjugate gradient methods in the Dai–Liao family
- Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
- Algorithm 851
- Technical Note—A Modified Conjugate Gradient Algorithm
- CUTE
- 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
- The Limited Memory Conjugate Gradient Method
- CUTEr and SifDec
- 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.
