Name
Abstract | ||
|---|---|---|
In this paper, we study local convergence of high-order Tensor Methods for solving convex optimization problems with composite objective. We justify local superlinear convergence under the assumption of uniform convexity of the smooth component, having Lipschitz-continuous high-order derivative. The convergence both in function value and in the norm of minimal subgradient is established. Global complexity bounds for the Composite Tensor Method in convex and uniformly convex cases are also discussed. Lastly, we show how local convergence of the methods can be globalized using the inexact proximal iterations. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1007/s10107-020-01606-x | Mathematical Programming |
Keywords | DocType | Volume |
Convex optimization, High-order methods, Tensor methods, Local convergence, Uniform convexity, Proximal methods, 90C25, 90C06, 65K05 | Journal | 193 |
Issue | ISSN | Citations |
1 | 0025-5610 | 0 |
PageRank | References | Authors |
0.34 | 8 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nikita Doikov | 1 | 2 | 2.42 |
| Yurii Nesterov | 2 | 1800 | 168.77 |