An Optimal High-Order Tensor Method for Convex Optimization
type: Item
instance of: scholarly article
title: An Optimal High-Order Tensor Method for Convex Optimization
zbMATH Open document ID: 1484.90078
author: Bo Jiang
author: Haoyue Wang
author: Shuzhong Zhang
published in: Mathematics of Operations Research
publication date: 2022-02-08T00:00:00Z
full work available at URL: https://arxiv.org/abs/1812.06557
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 47H05
zbMATH DE Number: 7470608
zbMATH Keywords: convex optimization
zbMATH Keywords: tensor method
zbMATH Keywords: acceleration
zbMATH Keywords: iteration complexity
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W3135366348
arXiv ID: 1812.06557
cites work: Oracle complexity of second-order methods for smooth convex optimization
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
cites work: Enlargement of monotone operators with applications to variational inequalities
cites work: Backtracking Strategies for Accelerated Descent Methods with Smooth Composite Objectives
cites work: Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy
cites work: Performance of first-order methods for smooth convex minimization: a novel approach
cites work: A Unified Adaptive Tensor Approximation Scheme to Accelerate Composite Convex Optimization
cites work: An optimal method for stochastic composite optimization
cites work: An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization
cites work: Relatively Smooth Convex Optimization by First-Order Methods, and Applications
cites work: On High-order Model Regularization for Constrained Optimization
cites work: Iteration-Complexity of a Newton Proximal Extragradient Method for Monotone Variational Inequalities and Inclusion Problems
cites work: An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
cites work: Accelerating the cubic regularization of Newton's method on convex problems
cites work: Implementable tensor methods in unconstrained convex optimization
cites work: On the maximal monotonicity of subdifferential mappings
cites work: Fast first-order methods for composite convex optimization with backtracking
cites work: Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
cites work: A differential equation for modeling Nesterov's accelerated gradient method: theory and insights
cites work: A variational perspective on accelerated methods in optimization
DOI: 10.1287/MOOR.2020.1103
description: scientific article; zbMATH DE number 7470608