On the global convergence of the generalized quasi-Newton method for nonconvex unconstrained optimization problems
From MaRDI portal
Publication:3372783
zbMATH Open1099.90058MaRDI QIDQ3372783FDOQ3372783
Authors: Lanping Chen, Baocong Jiao
Publication date: 10 March 2006
Recommendations
- On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
- The global convergence of the non-quasi-Newton methods with non-monotone line search
- scientific article; zbMATH DE number 1861594
- scientific article; zbMATH DE number 2195352
- Global convergence of the Broyden's class of quasi-Newton methods with nonmonotone linesearch
Numerical optimization and variational techniques (65K10) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)
Cited In (8)
- Title not available (Why is that?)
- Global convergence of the non-quasi-Newton method for unconstrained optimization problems
- The global convergence of the non-quasi-Newton methods with non-monotone line search
- Title not available (Why is that?)
- An approach for analyzing the global rate of convergence of quasi-Newton and truncated-Newton methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- Global convergence of nonsingular Broyden's method for solving unconstrained optimizations
This page was built for publication: On the global convergence of the generalized quasi-Newton method for nonconvex unconstrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3372783)