A Benchmark Study on Steepest Descent and Conjugate Gradient Methods-Line Search Conditions Combinations in Unconstrained Optimization
From MaRDI portal
Publication:5106116
DOI10.17535/crorr.2022.0006zbMath1500.90070OpenAlexW4285496687WikidataQ114049486 ScholiaQ114049486MaRDI QIDQ5106116
Publication date: 16 September 2022
Published in: Croatian operational research review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.17535/crorr.2022.0006
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An inexact steepest descent method for multicriteria optimization on Riemannian manifolds
- A literature survey of benchmark functions for global optimisation problems
- A gradient-descent method for curve fitting on Riemannian manifolds
- New inexact line search method for unconstrained optimization
- Two new conjugate gradient methods based on modified secant equations
- New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization
- A steepest-descent method for optimization of mechanical systems
- Conjugate gradient methods with Armijo-type line searches.
- A multiobjective steepest descent method with applications to optimal well control
- Best practices for comparing optimization algorithms
- A family of conjugate gradient methods for large-scale nonlinear equations
- Steepest descent method with a generalized Armijo search for quasiconvex functions on Riemannian manifolds
- A family of hybrid conjugate gradient methods for unconstrained optimization
- Benchmarking Derivative-Free Optimization Algorithms
- A Note on Using Performance and Data Profiles for Training Algorithms
- Function minimization by conjugate gradients
- Optimality Measures for Performance Profiles
- Methods of conjugate gradients for solving linear systems
- Benchmarking optimization software with performance profiles.
- A new efficient conjugate gradient method for unconstrained optimization
This page was built for publication: A Benchmark Study on Steepest Descent and Conjugate Gradient Methods-Line Search Conditions Combinations in Unconstrained Optimization
