A structured Fletcher-Revees spectral conjugate gradient method for unconstrained optimization with application in robotic model
DOI10.1007/S43069-023-00265-WOpenAlexW4387742728MaRDI QIDQ6063796
Thidaporn Seangwattana, Aliyu Muhammed Awwal, Nasiru Salihu, Poom Kumam, Ibrahim Arzuka
Publication date: 12 December 2023
Published in: SN Operations Research Forum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s43069-023-00265-w
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Minimax problems in mathematical programming (90C47) Nonlinear programming (90C30)
Cites Work
- A literature survey of benchmark functions for global optimisation problems
- General four-step discrete-time zeroing and derivative dynamics applied to time-varying nonlinear optimization
- Nonlinear conjugate gradient methods for unconstrained optimization
- A spectral conjugate gradient method for solving large-scale unconstrained optimization
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Algorithm 851
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Function minimization by conjugate gradients
- A spectral conjugate gradient method for unconstrained optimization
- Benchmarking optimization software with performance profiles.
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A structured Fletcher-Revees spectral conjugate gradient method for unconstrained optimization with application in robotic model
