Self-Scaling Variable Metric Algorithms without Line Search for Unconstrained Minimization
From MaRDI portal
Publication:4060281
Cites work
- scientific article; zbMATH DE number 3466802 (Why is no real title available?)
- scientific article; zbMATH DE number 3516529 (Why is no real title available?)
- scientific article; zbMATH DE number 3523337 (Why is no real title available?)
- scientific article; zbMATH DE number 3206518 (Why is no real title available?)
- A Rapidly Convergent Descent Method for Minimization
- A new approach to variable metric algorithms
- On Steepest Descent
- On a Numerical Instability of Davidon-Like Methods
- Quasi-Newton Methods and their Application to Function Minimisation
- Quasi-Newton Methods for Unconstrained Optimization
- Recent advances in unconstrained optimization
- Self-Scaling Variable Metric (SSVM) Algorithms
- Self-Scaling Variable Metric (SSVM) Algorithms
- The Convergence of a Class of Double-rank Minimization Algorithms
- Unified approach to quadratically convergent algorithms for function minimization
- Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
- Variance algorithm for minimization
- Variations on Variable-Metric Methods
Cited in
(12)- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
- Optimal conditioning of self-scaling variable Metric algorithms
- Perspectives on self-scaling variable metric algorithms
- On the selection of parameters in Self Scaling Variable Metric Algorithms
- Secant Acceleration of Sequential Residual Methods for Solving Large-Scale Nonlinear Systems of Equations
- A faster modified Newton-Raphson iteration
- A nonlinear optimization approach to the construction of general linear methods of high order
- A quasi-Newton-based floorplanner for fixed-outline floorplanning
- An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules
- Conditions for variable-metric algorithms to be conjugate-gradient algorithms
- On the final steps of Newton and higher order methods
- On quasi-Newton and pseudo-Newton algorithms
This page was built for publication: Self-Scaling Variable Metric Algorithms without Line Search for Unconstrained Minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4060281)
