A variable metric algorithm for unconstrained minimization without evaluation of derivatives
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3163006 (Why is no real title available?)
- scientific article; zbMATH DE number 3529352 (Why is no real title available?)
- scientific article; zbMATH DE number 3621487 (Why is no real title available?)
- scientific article; zbMATH DE number 3388498 (Why is no real title available?)
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A Family of Variable-Metric Methods Derived by Variational Means
- A Modification of Davidon's Minimization Method to Accept Difference Approximations of Derivatives
- A new approach to variable metric algorithms
- A superlinearly convergent algorithm for minimization without evaluating derivatives
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- Conditioning of Quasi-Newton Methods for Function Minimization
- Function Minimization Without Evaluating Derivatives--a Review
- On the Convergence of the Variable Metric Algorithm
- Quasi-Newton Methods, Motivation and Theory
- The Convergence of a Class of Double-rank Minimization Algorithms
- Variable Metric Method for Minimization
This page was built for publication: A variable metric algorithm for unconstrained minimization without evaluation of derivatives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1157671)