A new nonmonotone line search BFGS algorithm
From MaRDI portal
Publication:3571502
zbMATH Open1212.90412MaRDI QIDQ3571502FDOQ3571502
Authors: Jing Zhang
Publication date: 8 July 2010
Recommendations
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A nonmonotone modified BFGS algorithm for nonconvex unconstrained optimization problems
- Global convergece of the bfgs algorithm with nonmonotone linesearch∗∗this work is supported by national natural science foundation$ef:
- Modified limited memory BFGS method with nonmonotone line search for unconstrained optimization
- Investigation on a nonmonotone cautious BFGS algorithm
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)
Cited In (9)
- A nonmonotone PSB algorithm for solving unconstrained optimization
- A robust BFGS algorithm for unconstrained nonlinear optimization problems
- An adaptive nonmonotone line search for multiobjective optimization problems
- Global convergece of the bfgs algorithm with nonmonotone linesearch∗∗this work is supported by national natural science foundation$ef:
- A modified nonmonotone BFGS algorithm for solving smooth nonlinear equations
- Non monotone backtracking inexact BFGS method for regression analysis
- Investigation on a nonmonotone cautious BFGS algorithm
- New cautious BFGS algorithm based on modified Armijo-type line search
- New BFGS method for unconstrained optimization problem based on modified armijo line search
This page was built for publication: A new nonmonotone line search BFGS algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3571502)