Global convergece of the bfgs algorithm with nonmonotone linesearch∗∗this work is supported by national natural science foundation$ef:
From MaRDI portal
Publication:4888264
DOI10.1080/02331939508844101zbMath0858.90122OpenAlexW1977240378MaRDI QIDQ4888264
No author found.
Publication date: 28 July 1996
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939508844101
Related Items (25)
Global convergence of the Broyden's class of quasi-Newton methods with nonmonotone linesearch ⋮ A nonmonotone inexact Newton method for unconstrained optimization ⋮ Nonmonotone trust region method for solving optimization problems ⋮ Parallel variable distribution algorithm for constrained optimization with nonmonotone technique ⋮ A modified nonmonotone BFGS algorithm for unconstrained optimization ⋮ A Modified Non-Monotone BFGS Method for Non-Convex Unconstrained Optimization ⋮ A nonmonotone trust region method with new inexact line search for unconstrained optimization ⋮ Nonmonotone adaptive trust region method ⋮ Nonmonotone second-order Wolfe's line search method for unconstrained optimization problems ⋮ Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization ⋮ A nonmonotone line search filter method with reduced Hessian updating for nonlinear optimization ⋮ The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions ⋮ A nonmonotone filter line search technique for the MBFGS method in unconstrained optimization ⋮ 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 ⋮ A new nonmonotone line search technique for unconstrained optimization ⋮ A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values ⋮ A nonmonotone PSB algorithm for solving unconstrained optimization ⋮ Modified nonmonotone Armijo line search for descent method ⋮ Global convergence of nonmonotone descent methods for unconstrained optimization problems ⋮ A class of nonmonotone conjugate gradient methods for nonconvex functions ⋮ Convergence analysis of a modified BFGS method on convex minimizations ⋮ A globally convergent BFGS method with nonmonotone line search for non-convex minimization ⋮ A class of nonmonotone conjugate gradient methods for unconstrained optimization ⋮ A Modified Hestenes-Stiefel Conjugate Gradient Algorithm for Large-Scale Optimization
Cites Work
- Unnamed Item
- Unnamed Item
- On a modification of a step-size algorithm
- Über die globale Konvergenz von Variable-Metrik-Verfahren mit nicht- exakter Schrittweitenbestimmung
- An effective algorithm for minimization
- Minimization of functions having Lipschitz continuous first partial derivatives
- Stopping criteria for linesearch methods without derivatives
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- A Nonmonotone Line Search Technique for Newton’s Method
- Convergence Conditions for Ascent Methods
- Variable metric methods of minimisation
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:
