Global convergence of the non-quasi-Newton method for unconstrained optimization problems

DOI10.1007/s11766-003-0004-7zbMath1106.65053OpenAlexW1985844997MaRDI QIDQ854562

Mingjie Wang, Jinshan Li, Hong-Wei Liu, Xiang-Sun Zhang

Publication date: 5 December 2006

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-003-0004-7

zbMATH Keywords

inexact line searchsuperlinear convergence

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Uses Software

• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• A Modified BFGS Algorithm for Unconstrained Optimization
• Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
• Quasi-Newton Algorithms with Updates from the Preconvex Part of Broyden's Family
• A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
• Testing Unconstrained Optimization Software
• On the Behavior of Broyden’s Class of Quasi-Newton Methods

This page was built for publication: Global convergence of the non-quasi-Newton method for unconstrained optimization problems