A hybrid conjugate gradient method with descent property for unconstrained optimization
From MaRDI portal
Publication:2337555
DOI10.1016/j.apm.2014.08.008zbMath1432.90145OpenAlexW2053129565MaRDI QIDQ2337555
Lin Han, Jin-Bao Jian, Xian-Zhen Jiang
Publication date: 20 November 2019
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2014.08.008
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)
Related Items
A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection ⋮ A hybrid conjugate gradient based approach for solving unconstrained optimization and motion control problems ⋮ New hybrid conjugate gradient projection method for the convex constrained equations ⋮ A generalized hybrid CGPM-based algorithm for solving large-scale convex constrained equations with applications to image restoration ⋮ A new conjugate gradient algorithm with sufficient descent property for unconstrained optimization ⋮ A globally convergent hybrid conjugate gradient method with strong Wolfe conditions for unconstrained optimization ⋮ Two families of self-adjusting spectral hybrid DL conjugate gradient methods and applications in image denoising ⋮ An Accelerated Three-Term Extension of a Descent Nonlinear Conjugate Gradient Method ⋮ A new sufficiently descent algorithm for pseudomonotone nonlinear operator equations and signal reconstruction ⋮ Two families of hybrid conjugate gradient methods with restart procedures and their applications ⋮ New spectral LS conjugate gradient method for nonlinear unconstrained optimization ⋮ Estimation of the boundary condition of a 3D heat transfer equation using a modified hybrid conjugate gradient algorithm ⋮ A hybrid conjugate gradient algorithm for nonconvex functions and its applications in image restoration problems ⋮ A new conjugate gradient projection method for convex constrained nonlinear equations ⋮ A hybrid Riemannian conjugate gradient method for nonconvex optimization problems ⋮ Estimation of boundary condition of two-dimensional nonlinear PDE with application to continuous casting ⋮ A new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential function ⋮ A survey of gradient methods for solving nonlinear optimization ⋮ An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction ⋮ A modified hybrid conjugate gradient method for unconstrained optimization ⋮ A modified quasisecant method for global optimization ⋮ A hybrid three-term conjugate gradient projection method for constrained nonlinear monotone equations with applications ⋮ An efficient conjugate gradient-based algorithm for unconstrained optimization and its projection extension to large-scale constrained nonlinear equations with applications in signal recovery and image denoising problems ⋮ Dai-Liao extensions of a descent hybrid nonlinear conjugate gradient method with application in signal processing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A sufficient descent Dai-Yuan type nonlinear conjugate gradient method for unconstrained optimization problems
- A nonmonotone conjugate gradient algorithm for unconstrained optimization
- The convergence properties of some new conjugate gradient methods
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
- A note about WYL's conjugate gradient method and its applications
- Global convergence of modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property
- A modified PRP conjugate gradient method
- Hybrid conjugate gradient algorithm for unconstrained optimization
- Efficient hybrid conjugate gradient techniques
- Global convergence result for conjugate gradient methods
- The proof of the sufficient descent condition of the Wei-Yao-Liu conjugate gradient method under the strong Wolfe-Powell line search
- Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Testing Unconstrained Optimization Software
- 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
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Benchmarking optimization software with performance profiles.
- An efficient hybrid conjugate gradient method for unconstrained optimization
