Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization
From MaRDI portal
Publication:5248241
DOI10.1080/02331934.2013.869809zbMath1342.90180OpenAlexW2023523104MaRDI QIDQ5248241
Phillipe R. Sampaio, Coralia Cartis, Phillipe L. Toint
Publication date: 28 April 2015
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2013.869809
nonlinear optimizationworst-case analysisevaluation complexitynon-monotone methodslinesearch algorithms
Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30)
Related Items
An active set trust-region method for bound-constrained optimization, A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression, On the worst-case evaluation complexity of non-monotone line search algorithms, A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis, Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality, Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization, Worst-case complexity bounds of directional direct-search methods for multiobjective optimization, Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization, A generalized worst-case complexity analysis for non-monotone line searches, Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models, On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization
Cites Work
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- A truncated Newton method with non-monotone line search for unconstrained optimization
- On the complexity of finding first-order critical points in constrained nonlinear optimization
- Cubic regularization of Newton method and its global performance
- On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems
- On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming
- Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
- An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
- A Nonmonotone Line Search Technique for Newton’s Method
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
