A new efficient conjugate gradient method for unconstrained optimization
From MaRDI portal
Publication:5964605
DOI10.1016/j.cam.2015.12.035zbMath1382.65170OpenAlexW2236603166MaRDI QIDQ5964605
Publication date: 29 February 2016
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2015.12.035
Related Items
A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization ⋮ Some new three-term Hestenes–Stiefel conjugate gradient methods with affine combination ⋮ An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition ⋮ General four-step discrete-time zeroing and derivative dynamics applied to time-varying nonlinear optimization ⋮ A modified Dai-Liao conjugate gradient method for solving unconstrained optimization and image restoration problems ⋮ Two extensions of the Dai-Liao method with sufficient descent property based on a penalization scheme ⋮ Z-type neural-dynamics for time-varying nonlinear optimization under a linear equality constraint with robot application ⋮ An efficient conjugate gradient method with strong convergence properties for non-smooth optimization ⋮ A Benchmark Study on Steepest Descent and Conjugate Gradient Methods-Line Search Conditions Combinations in Unconstrained Optimization ⋮ A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization ⋮ A modified conjugate gradient method for general convex functions ⋮ Estimation of boundary condition of two-dimensional nonlinear PDE with application to continuous casting ⋮ An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction ⋮ Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search ⋮ A modified Dai-Liao conjugate gradient method with a new parameter for solving image restoration problems ⋮ A new family of conjugate gradient methods for unconstrained optimization ⋮ New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization ⋮ Two modified DY conjugate gradient methods for unconstrained optimization problems ⋮ An efficient Dai-Liao type conjugate gradient method by reformulating the CG parameter in the search direction equation ⋮ A new conjugate gradient method with an efficient memory structure ⋮ A three-term conjugate gradient method with accelerated subspace quadratic optimization ⋮ An optimal parameter choice for the Dai-Liao family of conjugate gradient methods by avoiding a direction of the maximum magnification by the search direction matrix
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An optimal parameter for Dai-Liao family of conjugate gradient methods
- Global convergence of some modified PRP nonlinear conjugate gradient methods
- The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- 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
- 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.
