Perspectives on self-scaling variable metric algorithms
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3466802 (Why is no real title available?)
- scientific article; zbMATH DE number 3617919 (Why is no real title available?)
- A new approach to variable metric algorithms
- A variable metric-method for function minimization derived from invariancy to nonlinear scaling
- An assessment of two approaches to variable metric methods
- Matrix conditioning and nonlinear optimization
- Minimization Algorithms Making Use of Non-quadratic Properties of the Objective Function
- On the selection of parameters in Self Scaling Variable Metric Algorithms
- Optimal conditioning of self-scaling variable Metric algorithms
- Self-Scaling Variable Metric (SSVM) Algorithms
- Self-Scaling Variable Metric (SSVM) Algorithms
- Self-Scaling Variable Metric Algorithms without Line Search for Unconstrained Minimization
- The Convergence of a Class of Double-rank Minimization Algorithms
Cited in
(9)- Hessian initialization strategies for \(\ell \)-BFGS solving non-linear inverse problems
- A structured L-BFGS method and its application to inverse problems
- A CLASS OF DFP ALGORITHMS WITH REVISED SEARCH DIRECTION
- A structured L-BFGS method with diagonal scaling and its application to image registration
- A globalization of L-BFGS and the Barzilai-Borwein method for nonconvex unconstrained optimization
- Analysis of a self-scaling quasi-Newton method
- Convergence analysis of the self-dual optimally conditioned ssvm method of oren-spedicato
- A new family of conjugate gradient methods for unconstrained optimization
- The revised DFP algorithm without exact line search
This page was built for publication: Perspectives on self-scaling variable metric algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1151823)
