A nonmonotone line search method and its convergence for unconstrained optimization
From MaRDI portal
Publication:2831936
DOI10.1177/1077546311434793zbMath1348.65099OpenAlexW2108048386MaRDI QIDQ2831936
Publication date: 4 November 2016
Published in: Journal of Vibration and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1177/1077546311434793
Cites Work
- Global convergence of nonmonotone descent methods for unconstrained optimization problems
- A self-adaptive trust region method with line search based on a simple subproblem model
- Convergence of nonmonotone line search method
- Minimization of functions having Lipschitz continuous first partial derivatives
- Numerical Optimization
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- Convergence Conditions for Ascent Methods
- A new nonmonotone line search technique for unconstrained optimization
- On the nonmonotone line search
This page was built for publication: A nonmonotone line search method and its convergence for unconstrained optimization