A globally convergent BFGS method with nonmonotone line search for non-convex minimization
From MaRDI portal
Publication:1026434
DOI10.1016/j.cam.2008.10.065zbMath1169.65058OpenAlexW2136317623MaRDI QIDQ1026434
Huijuan Sun, Yun-hai Xiao, Zhi Guo Wang
Publication date: 25 June 2009
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2008.10.065
unconstrained optimizationglobal convergencenumerical examplesBFGS methodnon-convex minimizationnonmonotone line searchsecant equationBroyden-Fletcher-Goldfarb-Shanno method
Related Items (5)
A Modified Non-Monotone BFGS Method for Non-Convex Unconstrained Optimization ⋮ A note on ``A globally convergent BFGS method with nonmonotone line search for non-convex minimization ⋮ Total pressure losses minimization in turbomachinery cascades using the exact Hessian ⋮ An improved adaptive trust-region algorithm ⋮ A modified nonmonotone BFGS algorithm for solving smooth nonlinear equations
Cites Work
- Unnamed Item
- 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 truncated Newton method with non-monotone line search for unconstrained optimization
- Nonmonotonic trust region algorithm
- Global convergence analysis of a new nonmonotone BFGS algorithm on convex objective functions
- Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
- The BFGS method with exact line searches fails for non-convex objective functions
- A class on nonmonotone stabilization methods in unconstrained optimization
- On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
- A globally convergent BFGS method for nonconvex minimization without line searches
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Numerical Optimization
- CUTE
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- Convergence Properties of the BFGS Algoritm
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- Global convergece of the bfgs algorithm with nonmonotone linesearch∗∗this work is supported by national natural science foundation$ef:
- A modified BFGS method and its global convergence in nonconvex minimization
- Benchmarking optimization software with performance profiles.
- On the nonmonotone line search
This page was built for publication: A globally convergent BFGS method with nonmonotone line search for non-convex minimization
