Solving unconstrained optimization problems via hybrid CD-DY conjugate gradient methods with applications
From MaRDI portal
Publication:2068628
DOI10.1016/j.cam.2021.113823zbMath1480.65145OpenAlexW3216821690MaRDI QIDQ2068628
Ioannis K. Argyros, Auwal Bala Abubakar, Maulana Malik, Jitsupa Deepho
Publication date: 20 January 2022
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.2021.113823
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Methods of reduced gradient type (90C52)
Related Items
A convergent hybrid three-term conjugate gradient method with sufficient descent property for unconstrained optimization, A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations, New DY-HS hybrid conjugate gradient algorithm for solving optimization problem of unsteady partial differential equations with convection term, A modified Levenberg-Marquardt method for solving system of nonlinear equations, Optimal control of three-dimensional unsteady partial differential equations with convection term in continuous casting, A hybrid HS-LS conjugate gradient algorithm for unconstrained optimization with applications in motion control and image recovery, An efficient new hybrid CG-method as convex combination of DY and CD and HS algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple three-term conjugate gradient algorithm for unconstrained optimization
- New hybrid conjugate gradient method for unconstrained optimization
- A literature survey of benchmark functions for global optimisation problems
- Some three-term conjugate gradient methods with the inexact line search condition
- Efficient generalized conjugate gradient algorithms. I: Theory
- Efficient hybrid conjugate gradient techniques
- A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection
- Nonlinear conjugate gradient methods for unconstrained optimization
- Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions
- A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function
- A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method
- Optimization theory and methods. Nonlinear programming
- Iterative Methods and Their Dynamics with Applications
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Algorithm 851
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Updating Quasi-Newton Matrices with Limited Storage
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Conjugate Gradient Methods with Inexact Searches
- Convergence Properties of Nonlinear Conjugate Gradient Methods
- A modified Hestense–Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- 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
- Hybrid conjugate gradient methods for unconstrained optimization
- Methods of conjugate gradients for solving linear systems
- A modified BFGS method and its global convergence in nonconvex minimization
- Benchmarking optimization software with performance profiles.
- An efficient hybrid conjugate gradient method for unconstrained optimization
