Pages that link to "Item:Q4971023"
From MaRDI portal
The following pages link to Tensor Methods for Minimizing Convex Functions with Hölder Continuous Higher-Order Derivatives (Q4971023):
Displaying 18 items.
- New approach to global minimization of normal multivariate polynomial based on tensor (Q1008796) (← links)
- The polyadic structure of factorable function tensors with applications to high-order minimization techniques (Q1069447) (← links)
- An adaptive high order method for finding third-order critical points of nonconvex optimization (Q2079692) (← links)
- A control-theoretic perspective on optimal high-order optimization (Q2089793) (← links)
- On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization (Q2089862) (← links)
- Local convergence of tensor methods (Q2133417) (← links)
- Accelerated meta-algorithm for convex optimization problems (Q2656390) (← links)
- Tensor Methods for Unconstrained Optimization Using Second Derivatives (Q4012411) (← links)
- Near-Optimal Hyperfast Second-Order Method for Convex Optimization (Q4965110) (← links)
- Unified Acceleration of High-Order Algorithms under General Hölder Continuity (Q5003214) (← links)
- Tensor methods for finding approximate stationary points of convex functions (Q5038435) (← links)
- Inexact basic tensor methods for some classes of convex optimization problems (Q5043845) (← links)
- On inexact solution of auxiliary problems in tensor methods for convex optimization (Q5859013) (← links)
- High-Order Optimization Methods for Fully Composite Problems (Q5869820) (← links)
- Super-Universal Regularized Newton Method (Q6136654) (← links)
- Efficiency of higher-order algorithms for minimizing composite functions (Q6155068) (← links)
- Adaptive Third-Order Methods for Composite Convex Optimization (Q6171322) (← links)
- Perseus: a simple and optimal high-order method for variational inequalities (Q6665392) (← links)
