Modified BFGS algorithm with particular descent condition for nonconvex functions
From MaRDI portal
Cites work
- A Modified BFGS Algorithm for Unconstrained Optimization
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- An adaptive projection BFGS method for nonconvex unconstrained optimization problems
- An unconstrained optimization test functions collection
- Benchmarking optimization software with performance profiles.
- Convergence Properties of the BFGS Algoritm
- scientific article; zbMATH DE number 3529352 (Why is no real title available?)
- New quasi-Newton equation and related methods for unconstrained optimization
- New quasi-Newton methods for unconstrained optimization problems
- Numerical Optimization
- The BFGS method with exact line searches fails for non-convex objective functions
- The projection technique for two open problems of unconstrained optimization problems
This page was built for publication: Modified BFGS algorithm with particular descent condition for nonconvex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7348971)