An improved ellipsoid method for solving convex differentiable optimization problems
type: Item
instance of: scholarly article
title: An improved ellipsoid method for solving convex differentiable optimization problems
zbMATH Open document ID: 1258.90056
author: Amir Beck
author: Shoham Sabach
published in: Operations Research Letters
publication date: 2013-03-05T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 6141239
zbMATH Keywords: ellipsoid method
zbMATH Keywords: convex optimization
zbMATH Keywords: Lipschitz gradient
MaRDI profile type: Publication
full work available at URL: j.orl.2012.09.005
OpenAlex ID: W2114348069
cites work: Q4209222
cites work: Feature Article—The Ellipsoid Method: A Survey
cites work: An ellipsoid algorithm for nonlinear programming
cites work: A deep cut ellipsoid algorithm for convex programming: Theory and applications
cites work: Q3050157
cites work: Introductory lectures on convex optimization. A basic course.
DOI: 10.1016/J.ORL.2012.09.005
description: scientific article; zbMATH DE number 6141239