A spectral PRP conjugate gradient methods for nonconvex optimization problem based on modified line search
From MaRDI portal
Publication:652191
DOI10.3934/DCDSB.2011.16.1157zbMath1229.90209OpenAlexW2326304272MaRDI QIDQ652191
Chaoming Hu, Zhong Wan, ZhanLu Yang
Publication date: 13 December 2011
Published in: Discrete and Continuous Dynamical Systems. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/dcdsb.2011.16.1157
unconstrained optimizationglobal convergenceconjugate gradientline searchsufficiently descent direction
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)
Related Items (14)
A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations ⋮ A new nonmonotone spectral residual method for nonsmooth nonlinear equations ⋮ An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems ⋮ An extended nonmonotone line search technique for large-scale unconstrained optimization ⋮ Fully complex conjugate gradient-based neural networks using Wirtinger calculus framework: deterministic convergence and its application ⋮ A modified PRP-type conjugate gradient algorithm with complexity analysis and its application to image restoration problems ⋮ Global convergence of a modified spectral conjugate gradient method ⋮ On the nonmonotonicity degree of nonmonotone line searches ⋮ Some modified Hestenes-Stiefel conjugate gradient algorithms with application in image restoration ⋮ A new conjugate gradient method based on quasi-Newton equation for unconstrained optimization ⋮ A new method with sufficient descent property for unconstrained optimization ⋮ A new nonmonotone line search technique for unconstrained optimization ⋮ A new smoothed L0 regularization approach for sparse signal recovery ⋮ A MODIFIED PROJECTED CONJUGATE GRADIENT ALGORITHM FOR UNCONSTRAINED OPTIMIZATION PROBLEMS
This page was built for publication: A spectral PRP conjugate gradient methods for nonconvex optimization problem based on modified line search
