Oracle complexity of second-order methods for smooth convex optimization
type: Item
instance of: scholarly article
title: Oracle complexity of second-order methods for smooth convex optimization
zbMATH Open document ID: 1430.90460
author: Yossi Arjevani
author: Ohad Shamir
author: Ron Shiff
published in: Mathematical Programming. Series A. Series B
publication date: 2019-10-22T00:00:00Z
full work available at URL: https://arxiv.org/abs/1705.07260
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 49M37
zbMATH DE Number: 7121181
zbMATH Keywords: smooth convex optimization
zbMATH Keywords: oracle complexity
MaRDI profile type: Publication
OpenAlex ID: W2962824898
arXiv ID: 1705.07260
cites work: Q4821526
cites work: On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems
cites work: Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization
cites work: Q5791786
cites work: An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
cites work: Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors
cites work: Q3967358
cites work: Q3320132
cites work: Introductory lectures on convex optimization. A basic course.
cites work: Accelerating the cubic regularization of Newton's method on convex problems
cites work: Q4324980
cites work: Cubic regularization of Newton method and its global performance
cites work: On uniformly convex functionals
DOI: 10.1007/S10107-018-1293-1
description: scientific article