Computational experience with bank-one positive definite quasi-newton algorithms

DOI10.1080/02331938508843066zbMath0614.90090OpenAlexW2095391846MaRDI QIDQ4723579

Emilio Spedicato

Publication date: 1985

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938508843066

zbMATH Keywords

unconstrained minimizationrank-one positive definite quasi-Newton algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items (1)

A symmetric rank-one method based on extra updating techniques for unconstrained optimization

Uses Software

• minpack

Cites Work

• Quasi-Newton-Verfahren vom Rang-Eins-Typ zur Lösung unrestringierter Minimierungsprobleme. I: Verfahren und grundlegende Eigenschaften
• Quasi-Newton-Verfahren vom Rang-Eins-Typ zur Lösung unrestringierter Minimierungsprobleme. II: n-Schritt-quadratische Konvergenz für Restart-Varianten
• Optimal conditioning of self-scaling variable Metric algorithms
• Unnamed Item

This page was built for publication: Computational experience with bank-one positive definite quasi-newton algorithms