A new BFGS algorithm using the decomposition matrix of the correction matrix to obtain the search directions
From MaRDI portal
Publication:892527
DOI10.1155/2015/674617zbMath1326.93047OpenAlexW1980094572WikidataQ59112444 ScholiaQ59112444MaRDI QIDQ892527
Publication date: 19 November 2015
Published in: Journal of Control Science and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/674617
Broyden-Fletcher-Goldfarb-Shanno (BFGS) algorithmapproximated Hessian matrixequal inner product decomposition method for positive-definite matrices
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- On the selection of parameters in Self Scaling Variable Metric Algorithms
- Self-Scaling Variable Metric (SSVM) Algorithms
- Self-Scaling Variable Metric (SSVM) Algorithms
- A Family of Variable-Metric Methods Derived by Variational Means
- The Convergence of a Class of Double-rank Minimization Algorithms
- A new approach to variable metric algorithms
- Conditioning of Quasi-Newton Methods for Function Minimization
- Quasi-Newton Methods for Unconstrained Optimization
This page was built for publication: A new BFGS algorithm using the decomposition matrix of the correction matrix to obtain the search directions
