Scaled memoryless BFGS preconditioned steepest descent method for very large-scale unconstrained optimization
From MaRDI portal
Publication:3643085
DOI10.1080/02522667.2009.10699885zbMATH Open1173.90500OpenAlexW2055294061MaRDI QIDQ3643085FDOQ3643085
Authors: W. J. Leong, M. A. Hassan 
Publication date: 10 November 2009
Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)
Full work available at URL: http://psasir.upm.edu.my/id/eprint/16624/2/Scaled%20memoryless%20BFGS%20preconditioned%20steepest%20descent%20method%20for%20very%20large.pdf
Recommendations
- Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization
- scientific article; zbMATH DE number 1159481
Cites Work
- Testing Unconstrained Optimization Software
- CUTE
- On the limited memory BFGS method for large scale optimization
- Title not available (Why is that?)
- Line search algorithms with guaranteed sufficient decrease
- Convergence Conditions for Ascent Methods
- Methods of conjugate gradients for solving linear systems
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Title not available (Why is that?)
- Self-Scaling Variable Metric (SSVM) Algorithms
- A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- Conjugate Gradient Methods with Inexact Searches
Cited In (3)
This page was built for publication: Scaled memoryless BFGS preconditioned steepest descent method for very large-scale unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3643085)
