A hybrid conjugate gradient based approach for solving unconstrained optimization and motion control problems
From MaRDI portal
Publication:2146720
DOI10.1016/j.matcom.2021.05.038OpenAlexW3168065008MaRDI QIDQ2146720
Abdulkarim Hassan Ibrahim, Maulana Malik, Poom Kumam, Auwal Bala Abubakar
Publication date: 21 June 2022
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.matcom.2021.05.038
Related Items (12)
A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations ⋮ Unnamed Item ⋮ A Dai-Liao-type projection method for monotone nonlinear equations and signal processing ⋮ Optimization of unconstrained problems using a developed algorithm of spectral conjugate gradient method calculation ⋮ Time-delay Hammerstein system identification using modified cross-correlation method and variable stacking length multi-error algorithm ⋮ A derivative‐free projection method for nonlinear equations with non‐Lipschitz operator: Application to LASSO problem ⋮ 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 ⋮ Unnamed Item ⋮ Projection method with inertial step for nonlinear equations: application to signal recovery ⋮ 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
Uses Software
Cites Work
- 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
- A globally convergent version of the Polak-Ribière conjugate gradient method
- General four-step discrete-time zeroing and derivative dynamics applied to time-varying nonlinear optimization
- Two optimal Hager-Zhang conjugate gradient methods for solving monotone nonlinear equations
- Nonlinear conjugate gradient methods for unconstrained optimization
- An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization
- A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function
- A hybrid conjugate gradient method with descent property for unconstrained optimization
- A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method
- Optimization theory and methods. Nonlinear programming
- Modified Hager–Zhang conjugate gradient methods via singular value analysis for solving monotone nonlinear equations with convex constraint
- 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 derivative‐free scaling memoryless Broyden–Fletcher–Goldfarb–Shanno method for solving a system of monotone nonlinear equations
- A modified Hager-Zhang conjugate gradient method with optimal choices for solving monotone nonlinear equations
- Some new three-term Hestenes–Stiefel conjugate gradient methods with affine combination
- 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
- A modified BFGS method and its global convergence in nonconvex minimization
- Benchmarking optimization software with performance profiles.
This page was built for publication: A hybrid conjugate gradient based approach for solving unconstrained optimization and motion control problems
