Global convergece of the bfgs algorithm with nonmonotone linesearch∗∗this work is supported by national natural science foundation$ef:

DOI10.1080/02331939508844101zbMath0858.90122MaRDI 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

zbMATH Keywords

global convergence; BFGS algorithm; nonmonotone linesearches; nonmonotone quasi-Newton methods

Mathematics Subject Classification ID

90C30: Nonlinear programming

Related Items

A new nonmonotone line search technique for unconstrained optimization, A nonmonotone trust region method with new inexact line search for unconstrained optimization, A nonmonotone filter line search technique for the MBFGS method in unconstrained optimization, Modified nonmonotone Armijo line search for descent method, Nonmonotone adaptive trust region method, Nonmonotone second-order Wolfe's line search method for unconstrained optimization problems, 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, 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, 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, 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, A Modified Hestenes-Stiefel Conjugate Gradient Algorithm for Large-Scale Optimization, A Modified Non-Monotone BFGS Method for Non-Convex Unconstrained 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