A nonmonotone modified BFGS algorithm for nonconvex unconstrained optimization problems
From MaRDI portal
Recommendations
- A modified non-monotone BFGS method for non-convex unconstrained optimization
- A modified nonmonotone BFGS algorithm for unconstrained optimization
- Global convergence of a modified BFGS-type method for unconstrained non-convex minimization
- Modified limited memory BFGS method with nonmonotone line search for unconstrained optimization
- A globally convergent BFGS method with nonmonotone line search for non-convex minimization
Cited in
(15)- Optimal algorithms and the BFGS updating techniques for solving unconstrained nonlinear minimization problems
- A new modified BFGS method for unconstrained optimization problems
- A modified nonmonotone BFGS algorithm for unconstrained optimization
- Low complexity secant quasi-Newton minimization algorithms for nonconvex functions
- Investigation on a nonmonotone cautious BFGS algorithm
- A modified non-monotone BFGS method for non-convex unconstrained optimization
- A new nonmonotone line search BFGS algorithm
- Modified limited memory BFGS method with nonmonotone line search for unconstrained optimization
- scientific article; zbMATH DE number 5196186 (Why is no real title available?)
- New BFGS method for unconstrained optimization problem based on modified armijo line search
- A robust BFGS algorithm for unconstrained nonlinear optimization problems
- An adaptive projection BFGS method for nonconvex unconstrained optimization problems
- A nonmonotone PSB algorithm for solving unconstrained optimization
- A modified nonmonotone BFGS algorithm for solving smooth nonlinear equations
- A globally and quadratically convergent algorithm with efficient implementation for unconstrained optimization
This page was built for publication: A nonmonotone modified BFGS algorithm for nonconvex unconstrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5279418)