Pages that link to "Item:Q2664892"
From MaRDI portal
The following pages link to Superfast second-order methods for unconstrained convex optimization (Q2664892):
Displaying 14 items.
- Oracle complexity of second-order methods for smooth convex optimization (Q2330652) (← links)
- Inexact accelerated high-order proximal-point methods (Q2689812) (← links)
- Fast Curvature Matrix-Vector Products for Second-Order Gradient Descent (Q3150014) (← links)
- Inexact High-Order Proximal-Point Methods with Auxiliary Search Procedure (Q5013580) (← links)
- A concise second-order complexity analysis for unconstrained optimization using high-order regularized models (Q5210739) (← links)
- Fast convex optimization via a third-order in time evolution equation (Q5864709) (← links)
- Hyperfast second-order local solvers for efficient statistically preconditioned distributed optimization (Q6114954) (← links)
- Regularized Newton Method with Global \({\boldsymbol{\mathcal{O}(1/{k}^2)}}\) Convergence (Q6116237) (← links)
- Super-Universal Regularized Newton Method (Q6136654) (← links)
- Adaptive Third-Order Methods for Composite Convex Optimization (Q6171322) (← links)
- Inexact tensor methods and their application to stochastic convex optimization (Q6585820) (← links)
- High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods (Q6634529) (← links)
- Near-optimal tensor methods for minimizing the gradient norm of convex functions and accelerated primal–dual tensor methods (Q6644994) (← links)
- Perseus: a simple and optimal high-order method for variational inequalities (Q6665392) (← links)
