Scaled memoryless BFGS preconditioned steepest descent method for very large-scale unconstrained optimization
From MaRDI portal
Publication:3643085
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
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- CUTE
- Conjugate Gradient Methods with Inexact Searches
- Convergence Conditions for Ascent Methods
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Line search algorithms with guaranteed sufficient decrease
- Methods of conjugate gradients for solving linear systems
- On the limited memory BFGS method for large scale optimization
- Self-Scaling Variable Metric (SSVM) Algorithms
- Testing Unconstrained Optimization Software
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)