New cautious BFGS algorithm based on modified Armijo-type line search
From MaRDI portal
(Redirected from Publication:385833)
Recommendations
- New BFGS method for unconstrained optimization problem based on modified armijo line search
- A new nonmonotone line search BFGS algorithm
- Investigation on a nonmonotone cautious BFGS algorithm
- Modified line search strategy and its applications in the Newton method
- New inexact line search method for unconstrained optimization
Cites work
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- A globally convergent BFGS method for nonlinear monotone equations without any merit functions
- An two phase ABS method for solving over-determined systems of linear inequalities
- Convergence Conditions for Ascent Methods
- Global convergence of nonmonotone descent methods for unconstrained optimization problems
- Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization
- Limited-Memory Reduced-Hessian Methods for Large-Scale Unconstrained Optimization
- New inexact line search method for unconstrained optimization
- On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
- Stepsize analysis for descent methods
- Testing Unconstrained Optimization Software
- The BFGS method with exact line searches fails for non-convex objective functions
Cited in
(15)- New BFGS method for unconstrained optimization problem based on modified armijo line search
- A modified Broyden family algorithm with global convergence under a weak Wolfe-Powell line search for unconstrained nonconvex problems
- Global convergence of a nonmonotone Broyden family method for nonconvex unconstrained minimization
- A modified nonmonotone trust region line search method
- The global convergence of the BFGS method with a modified WWP line search for nonconvex functions
- Global convergence of a family of modified BFGS methods under a modified weak-Wolfe-Powell line search for nonconvex functions
- An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems
- Correction of nonmonotone trust region algorithm based on a modified diagonal regularized quasi-Newton method
- Two accelerated nonmonotone adaptive trust region line search methods
- A double-parameter scaling Broyden-Fletcher-Goldfarb-Shanno method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization
- Modified line search strategy and its applications in the Newton method
- A new nonmonotone line search technique for unconstrained optimization
- An extended nonmonotone line search technique for large-scale unconstrained optimization
- Investigation on a nonmonotone cautious BFGS algorithm
- A novel hybrid algorithm for solving multiobjective optimization problems with engineering applications
This page was built for publication: New cautious BFGS algorithm based on modified Armijo-type line search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385833)
