Global convergence of nonsingular Broyden's method for solving unconstrained optimizations

MaRDI QIDQ3364560zbMATH OpenFDO

Authors Dong-Hui Li

Publication date 1995

zbMATH Keywords

global convergenceline searchnonsingular Broyden methodquasi-Newton methodsunconstrained optimization

Mathematics Subject Classification ID

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

Recommendations

• Global convergence of the Broyden's class of quasi-Newton methods with nonmonotone linesearch
• The global convergence of the non-quasi-Newton methods with non-monotone line search
• On the global convergence of the generalized quasi-Newton method for nonconvex unconstrained optimization problems
• Global convergence of a modified BFGS-type method for unconstrained non-convex minimization
• Global convergence properties of two modified BFGS-type methods

Cited in

(6)

• Note on global convergence of ODE methods for unconstrained optimization
• Global convergence of the Broyden's class of quasi-Newton methods with nonmonotone linesearch
• A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization
• Lower-dimensional linear complementarity problem approaches to the solution of a bi-obstacle problem
• On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
• Globally convergent block-coordinate techniques for unconstrained optimization

This page was built for publication: Global convergence of nonsingular Broyden's method for solving unconstrained optimizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3364560)