Global convergece of the bfgs algorithm with nonmonotone linesearch∗∗this work is supported by national natural science foundation$ef:
From MaRDI portal
Publication:4888264
Recommendations
- Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization
- Global convergence analysis of a new nonmonotone BFGS algorithm on convex objective functions
- Global convergence results of BFGS methods with a new nonmonotone step size rule
- Global convergence of the Broyden's class of quasi-Newton methods with nonmonotone linesearch
- A new nonmonotone line search BFGS algorithm
Cites work
- A Nonmonotone Line Search Technique for Newton’s Method
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- An effective algorithm for minimization
- Convergence Conditions for Ascent Methods
- scientific article; zbMATH DE number 686911 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Minimization of functions having Lipschitz continuous first partial derivatives
- On a modification of a step-size algorithm
- Stopping criteria for linesearch methods without derivatives
- Variable metric methods of minimisation
- Über die globale Konvergenz von Variable-Metrik-Verfahren mit nicht- exakter Schrittweitenbestimmung
Cited in
(35)- A globally convergent BFGS method with nonmonotone line search for non-convex minimization
- A class of nonmonotone conjugate gradient methods for unconstrained optimization
- Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization
- Global convergence of the Broyden's class of quasi-Newton methods with nonmonotone linesearch
- Global convergence properties of the modified BFGS method associating with general line search model
- Nonmonotone trust region method for solving optimization problems
- A nonmonotone inexact Newton method for unconstrained optimization
- Parallel variable distribution algorithm for constrained optimization with nonmonotone technique
- A modified nonmonotone BFGS algorithm for unconstrained optimization
- A nonmonotone line search filter method with reduced Hessian updating for nonlinear optimization
- A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values
- On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
- A modified Hestenes-Stiefel conjugate gradient algorithm for large-scale optimization
- Investigation on a nonmonotone cautious BFGS algorithm
- A modified non-monotone BFGS method for non-convex unconstrained optimization
- Global convergence results of BFGS methods with a new nonmonotone step size rule
- A new nonmonotone line search BFGS algorithm
- A nonmonotone trust region method with new inexact line search for unconstrained optimization
- scientific article; zbMATH DE number 613197 (Why is no real title available?)
- A nonmonotone filter line search technique for the MBFGS method in unconstrained optimization
- scientific article; zbMATH DE number 938958 (Why is no real title available?)
- Non monotone backtracking inexact BFGS method for regression analysis
- Modified nonmonotone Armijo line search for descent method
- A new nonmonotone line search technique for unconstrained optimization
- Nonmonotone adaptive trust region method
- Nonmonotone second-order Wolfe's line search method for unconstrained optimization problems
- Nonmonotone alternative direction method based on simple conic model for unconstrained optimization
- A nonmonotone PSB algorithm for solving unconstrained optimization
- Global convergence of nonmonotone descent methods for unconstrained optimization problems
- A class of nonmonotone conjugate gradient methods for nonconvex functions
- A conic regularized Barzilai-Borwein trust region method for large scale unconstrained optimization
- Convergence analysis of a modified BFGS method on convex minimizations
- The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions
- The global and superlinear convergence of a new nonmonotone MBFGS algorithm on convex objective functions
- Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization
This page was built for publication: Global convergece of the bfgs algorithm with nonmonotone linesearch∗∗this work is supported by national natural science foundation$ef:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4888264)
