Optimization of unconstrained problems using a developed algorithm of spectral conjugate gradient method calculation
From MaRDI portal
Publication:6089614
DOI10.1016/J.MATCOM.2023.07.026OpenAlexW4385633577MaRDI QIDQ6089614
Hatem Mrad, Seyyed Mojtaba Fakhari
Publication date: 13 November 2023
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.matcom.2023.07.026
Cites Work
- Unnamed Item
- Unnamed Item
- Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization
- A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches
- A conjugate gradient method with descent direction for unconstrained optimization
- New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems
- A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- Efficient generalized conjugate gradient algorithms. I: Theory
- A hybrid conjugate gradient based approach for solving unconstrained optimization and motion control problems
- A spectral conjugate gradient method for solving large-scale unconstrained optimization
- Accelerated diagonal gradient-type method for large-scale unconstrained optimization
- Minimization of functions having Lipschitz continuous first partial derivatives
- Numerical Optimization
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Convergence Conditions for Ascent Methods
- A spectral conjugate gradient method for unconstrained optimization
This page was built for publication: Optimization of unconstrained problems using a developed algorithm of spectral conjugate gradient method calculation