A More Lenient Stopping Rule for Line Search Algorithms
From MaRDI portal
Recommendations
- Stopping criteria for linesearch methods without derivatives
- A step size rule for unconstrained optimization
- Line search by curve fitting in minimization algorithms
- A Nonmonotone Line Search Technique for Newton’s Method
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
Cites work
- Efficient Implementation of the Truncated-Newton Algorithm for Large-Scale Chemistry Applications
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 3302906 (Why is no real title available?)
- Line search algorithms with guaranteed sufficient decrease
- Minimization Algorithms Making Use of Non-quadratic Properties of the Objective Function
- Remark on Algorithm 566
- Remark on Algorithm 702—the updated truncated Newton minimization package
- Testing Unconstrained Optimization Software
- TNPACK—a truncated Newton minimization package for large-scale problems
- TNPACK—A truncated Newton minimization package for large-scale problems
- Truncated-Newton algorithms for large-scale unconstrained optimization
This page was built for publication: A More Lenient Stopping Rule for Line Search Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4709751)