Analogues of Dixon’s and Powell’s Theorems for Unconstrained Minimization with Inexact Line Searches

DOI10.1137/0723012zbMath0593.65045OpenAlexW1974805426MaRDI QIDQ3723614

John Lawrence Nazareth

Publication date: 1986

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: http://pure.iiasa.ac.at/id/eprint/1916/1/WP-82-100.pdf

zbMATH Keywords

variable metric methodsunconstrained minimizationquasi-Newton methodsline searchesBroyden classthree-term-recurrence method

Mathematics Subject Classification ID

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

Related Items

Perturbed steepest-descent technique in multiextremal problems ⋮ Unified approach to unconstrained minimization via basic matrix factorizations ⋮ Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables

Uses Software

• minpack

This page was built for publication: Analogues of Dixon’s and Powell’s Theorems for Unconstrained Minimization with Inexact Line Searches