A superlinearly convergent algorithm for minimization without evaluating derivatives
type: Item
instance of: scholarly article
title: A superlinearly convergent algorithm for minimization without evaluating derivatives
zbMATH Open document ID: 0327.90027
DOI: 10.1007/BF01681333
author: Robert Mifflin
published in: Mathematical Programming
publication date: 1975-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C55
zbMATH DE Number: 3513561
describes a project that uses: BRENT
MaRDI profile type: Publication
cites work: Minimization of functions having Lipschitz continuous first partial derivatives
cites work: Q4071019
cites work: An explicit procedure for discretizing continuous, optimal control problems
cites work: Q5629139
cites work: A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
cites work: Q5588268
cites work: Newton-type methods for unconstrained and linearly constrained optimization
cites work: Maximization by Quadratic Hill-Climbing
cites work: An effective algorithm for minimization
cites work: On the Relative Efficiencies of Gradient Methods
cites work: A Quasi-Newton Method with No Derivatives
cites work: A comparison of modified Newton methods for unconstrained optimisation
cites work: Methods of conjugate directions versus quasi-Newton methods
cites work: Q5672476
cites work: Q5557320
cites work: An efficient method for finding the minimum of a function of several variables without calculating derivatives
cites work: A Modification of Davidon's Minimization Method to Accept Difference Approximations of Derivatives
cites work: Function Minimization by Interpolation in a Data Table
cites work: Minimizing a function without calculating derivatives
description: scientific article; zbMATH DE number 3513561