Updating the self-scaling symmetric rank one algorithm with limited memory for large-scale unconstrained optimization
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5630374
- scientific article; zbMATH DE number 3892953
- A limited memory method for large scale problems
- A limited memory BFGS-type method for large-scale unconstrained optimization
- Modifications of the limited memory BFGS algorithm for large-scale nonlinear optimization
Cited in
(14)- A modified scaled memoryless symmetric rank-one method
- Scaling damped limited-memory updates for unconstrained optimization
- Dynamic scaling on the limited memory BFGS method
- An optimal self-scaling strategy to the modified symmetric rank one updating
- Modifications of the limited memory BFGS algorithm for large-scale nonlinear optimization
- L-Broyden methods: a generalization of the L-BFGS method to the limited-memory Broyden family
- scientific article; zbMATH DE number 5630374 (Why is no real title available?)
- scientific article; zbMATH DE number 3892953 (Why is no real title available?)
- Stochastic proximal quasi-Newton methods for non-convex composite optimization
- A limited memory method for large scale problems
- A new self-scaling memoryless quasi-Newton update for unconstrained optimization
- A hyperspherical area integral method based on a quasi-Newton approximation for reliability analysis
- Scaled memoryless symmetric rank one method for large-scale optimization
- A new class of supermemory gradient methods
This page was built for publication: Updating the self-scaling symmetric rank one algorithm with limited memory for large-scale unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1424786)
