A limited memory subspace minimization conjugate gradient algorithm for unconstrained optimization
- 2 July 2024
- journal article
- research article
- Published by Springer Nature in Optimization Letters
- Vol. 19 (4) , 717-745
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (12261019, 12161053)
This publication has 29 references indexed in Scilit:
- A New Subspace Minimization Conjugate Gradient Method for Unconstrained MinimizationJournal of Optimization Theory and Applications, 2023
- An Efficient Gradient Method with Approximately Optimal Stepsize Based on Tensor Model for Unconstrained OptimizationJournal of Optimization Theory and Applications, 2019
- An Efficient Barzilai–Borwein Conjugate Gradient Method for Unconstrained OptimizationJournal of Optimization Theory and Applications, 2018
- An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimizationNumerical Algorithms, 2017
- A subspace conjugate gradient algorithm for large-scale unconstrained optimizationNumerical Algorithms, 2017
- An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimizationNumerical Algorithms, 2013
- Gradient Methods with Adaptive Step-SizesComputational Optimization and Applications, 2006
- Benchmarking optimization software with performance profilesMathematical Programming, 2002
- A Subspace Study on Conjugate Gradient AlgorithmsZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1995
- On the limited memory BFGS method for large scale optimizationMathematical Programming, 1989