A variable metric algorithm for unconstrained minimization without evaluation of derivatives
type: Item
instance of: scholarly article
title: A variable metric algorithm for unconstrained minimization without evaluation of derivatives
zbMATH Open document ID: 0471.65040
DOI: 10.1007/BF01395952
author: J. Bräuninger
published in: Numerische Mathematik
publication date: 1981-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/132708
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 3738827
zbMATH Keywords: variable metric algorithm
zbMATH Keywords: unconstrained minimization
zbMATH Keywords: convergence
zbMATH Keywords: superlinear
zbMATH Keywords: Broyden-Fletcher-Goldfarb-Shanno-method
describes a project that uses: BRENT
MaRDI profile type: Publication
cites work: Q4184636
cites work: Q5657612
cites work: The Convergence of a Class of Double-rank Minimization Algorithms
cites work: Variable Metric Method for Minimization
cites work: A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
cites work: Quasi-Newton Methods, Motivation and Theory
cites work: Q3281164
cites work: Function Minimization Without Evaluating Derivatives--a Review
cites work: A new approach to variable metric algorithms
cites work: A Family of Variable-Metric Methods Derived by Variational Means
cites work: A superlinearly convergent algorithm for minimization without evaluating derivatives
cites work: An efficient method for finding the minimum of a function of several variables without calculating derivatives
cites work: On the Convergence of the Variable Metric Algorithm
cites work: Q4107408
cites work: Conditioning of Quasi-Newton Methods for Function Minimization
cites work: A Modification of Davidon's Minimization Method to Accept Difference Approximations of Derivatives
description: scientific article; zbMATH DE number 3738827