A nonmonotone filter line search technique for the MBFGS method in unconstrained optimization
From MaRDI portal
Publication:488947
DOI10.1007/s11424-014-1081-9zbMath1308.90176OpenAlexW1965231027MaRDI QIDQ488947
Publication date: 27 January 2015
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-014-1081-9
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A nonmonotone conjugate gradient algorithm for unconstrained optimization
- A filter-line-search method for unconstrained optimization
- Gauss-Newton-based BFGS method with filter for unconstrained minimization
- The BFGS method with exact line searches fails for non-convex objective functions
- A new trust region filter algorithm
- Solving unconstrained optimization problem with a filter-based nonmonotone pattern search algorithm
- Numerical Optimization
- 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
- Global convergece of the bfgs algorithm with nonmonotone linesearch∗∗this work is supported by national natural science foundation$ef:
- A Filter-Trust-Region Method for Unconstrained Optimization
- A modified BFGS method and its global convergence in nonconvex minimization
- Nonlinear programming without a penalty function.
This page was built for publication: A nonmonotone filter line search technique for the MBFGS method in unconstrained optimization