On a conjecture of Dixon and other topics in variable metric methods

DOI10.1007/BF01609011zbMath0398.65035WikidataQ123028173 ScholiaQ123028173MaRDI QIDQ4181904

Emilio Spedicato

Publication date: 1978

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

Nonlinear OptimizationUnconstrained MinimizationOptimal ConditioningQuasinewton MethodSequence of Approximate Minimizers Xk-SpaceVariable Metric Algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (5)

An Optimal Broyden Updating Formula And Its Application To Nonliner Least Squares ⋮ Superlinear convergence of symmetric Huang's class of methods ⋮ The revised DFP algorithm without exact line search ⋮ Effect of rounding errors on the variable metric method ⋮ A CLASS OF DFP ALGORITHMS WITH REVISED SEARCH DIRECTION

Cites Work

• Optimally conditioned optimization algorithms without line searches
• Optimal conditioning of self-scaling variable Metric algorithms
• Quasi-Newton Methods and their Application to Function Minimisation

This page was built for publication: On a conjecture of Dixon and other topics in variable metric methods