4.6 Article

TENSOR METHODS FOR MINIMIZING CONVEX FUNCTIONS WITH HOLDER CONTINUOUS HIGHER-ORDER DERIVATIVES

Journal

SIAM JOURNAL ON OPTIMIZATION
Volume 30, Issue 4, Pages 2750-2779

Publisher

SIAM PUBLICATIONS
DOI: 10.1137/19M1259432

Keywords

unconstrained minimization; high-order methods; tensor methods; Holder condition; worst-case global complexity bounds

Funding

  1. National Council for Scientific and Technological Development -Brazil [401288/2014-5, 406269/2016-5]
  2. European Research Council [788368]

Ask authors/readers for more resources

In this paper, we study p-order methods for unconstrained minimization of convex functions that are p-times differentiable (p >= 2) with nu-Holder continuous pth derivatives. We propose tensor schemes with and without acceleration. For the schemes without acceleration, we establish iteration complexity bounds of O (epsilon(-1/(p+nu-1))) for reducing the functional residual below a given epsilon is an element of (0, 1). Assuming that nu is known, we obtain an improved complexity bound of O (epsilon(-1/(P+nu))) for the corresponding accelerated scheme. For the case in which nu is unknown, we present a universal accelerated tensor scheme with iteration complexity of O (epsilon(-P/[(P+1)(P+nu-1)])). A lower complexity bound of O (epsilon(-2/[3(P+nu)-2])) is also obtained for this problem class.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available