A nonmonotone filter line search technique for the MBFGS method in unconstrained optimization
From MaRDI portal
Publication:488947
DOI10.1007/S11424-014-1081-9zbMATH Open1308.90176OpenAlexW1965231027MaRDI QIDQ488947FDOQ488947
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Numerical Optimization
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- Nonlinear programming without a penalty function.
- A modified BFGS method and its global convergence in nonconvex minimization
- The BFGS method with exact line searches fails for non-convex objective functions
- Convergence Properties of the BFGS Algoritm
- A filter-line-search method for unconstrained optimization
- A nonmonotone conjugate gradient algorithm for unconstrained optimization
- 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
- Gauss-Newton-based BFGS method with filter for unconstrained minimization
- A new trust region filter algorithm
- Solving unconstrained optimization problem with a filter-based nonmonotone pattern search algorithm
Cited In (2)
This page was built for publication: A nonmonotone filter line search technique for the MBFGS method in unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q488947)
