Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization
From MaRDI portal
Recommendations
- On the worst-case evaluation complexity of non-monotone line search algorithms
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
- On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming
- On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization problems
- A generalized worst-case complexity analysis for non-monotone line searches
Cites work
- A Nonmonotone Line Search Technique for Newton’s Method
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- Cubic regularization of Newton method and its global performance
- On the complexity of finding first-order critical points in constrained nonlinear optimization
- 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
Cited in
(31)- 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
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization
- 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
- A generalized worst-case complexity analysis for non-monotone line searches
- An active set trust-region method for bound-constrained optimization
- 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
- 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
- scientific article; zbMATH DE number 3637739 (Why is no real title available?)
- Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients
- Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality
- A note on the worst-case complexity of nonlinear stepsize control methods for convex smooth unconstrained optimization
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
- On the worst-case inefficiency of CGKA
- A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression
- Worst-case evaluation complexity of a derivative-free quadratic regularization method
- Globally linearly convergent nonlinear conjugate gradients without Wolfe line search
- A line search framework with restarting for noisy optimization problems
- A globally convergent gradient method with momentum
- A novel Riemannian conjugate gradient method with iteration complexity guarantees
- Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is \(o(\epsilon^{-2})\) rather than \(\mathcal{O}(\epsilon^{-2})\)
- On the forward-backward method with nonmonotone linesearch for infinite-dimensional nonsmooth nonconvex problems
- An improvement of the Goldstein line search
- The indefinite proximal gradient method
- Convergence and complexity guarantees for a wide class of descent algorithms in nonconvex multi-objective optimization
- A subspace inertial method for derivative-free nonlinear monotone equations
- A non-monotone line-search method for minimizing functions with spurious local minima
- Convergence conditions for stochastic line search based optimization of over-parametrized models
This page was built for publication: Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5248241)
