Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients
From MaRDI portal
(Redirected from Publication:4594856)
Recommendations
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
- Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization
- Gradient methods with regularization for constrained optimization problems and their complexity estimates
- Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization
- On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
- Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization
- On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- Regularized Newton methods for minimizing functions with Hölder continuous hessians
- Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization
Cited in
(14)- On the quality of first-order approximation of functions with Hölder continuous gradient
- Regional complexity analysis of algorithms for nonconvex smooth optimization
- On the use of third-order models with fourth-order regularization for unconstrained optimization
- A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization
- Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
- The impact of noise on evaluation complexity: the deterministic trust-region case
- Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy
- Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality
- Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
- Regularized Newton methods for minimizing functions with Hölder continuous hessians
- The evaluation complexity of finding high-order minimizers of nonconvex optimization
- Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians
- On the complexity of a quadratic regularization algorithm for minimizing nonsmooth and nonconvex functions
This page was built for publication: Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4594856)
