Pages that link to "Item:Q2885470"
From MaRDI portal
The following pages link to Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization (Q2885470):
Displaying 20 items.
- Practical inexact proximal quasi-Newton method with global complexity analysis (Q344963) (← links)
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models (Q526842) (← links)
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results (Q535013) (← links)
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity (Q652287) (← links)
- On the worst-case evaluation complexity of non-monotone line search algorithms (Q1694392) (← links)
- Minimizing uniformly convex functions by cubic regularization of Newton method (Q2032037) (← links)
- Newton-type methods for non-convex optimization under inexact Hessian information (Q2205970) (← links)
- Implementable tensor methods in unconstrained convex optimization (Q2227532) (← links)
- Oracle complexity of second-order methods for smooth convex optimization (Q2330652) (← links)
- Algebraic rules for quadratic regularization of Newton's method (Q2340522) (← links)
- A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization (Q2696932) (← links)
- On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization (Q2815548) (← links)
- On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization (Q2866197) (← links)
- Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients (Q4594856) (← links)
- A note on the worst-case complexity of nonlinear stepsize control methods for convex smooth unconstrained optimization (Q5085238) (← links)
- A Unified Adaptive Tensor Approximation Scheme to Accelerate Composite Convex Optimization (Q5131958) (← links)
- Linear-Time Convexity Test for Low-Order Piecewise Polynomials (Q5857296) (← links)
- Adaptive Third-Order Methods for Composite Convex Optimization (Q6171322) (← links)
- An accelerated regularized Chebyshev-Halley method for unconstrained optimization (Q6542872) (← links)
- Parameter-free accelerated gradient descent for nonconvex minimization (Q6561381) (← links)
