Optimization of a convex program with a polynomial perturbation
type: Item
instance of: scholarly article
title: Optimization of a convex program with a polynomial perturbation
zbMATH Open document ID: 1180.90313
author: Luis Rademacher
author: R. Kannan
published in: Operations Research Letters
publication date: 2009-12-07T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5643624
zbMATH Keywords: nonlinear programming
zbMATH Keywords: approximation algorithms
zbMATH Keywords: polynomial optimization
MaRDI profile type: Publication
full work available at URL: j.orl.2009.07.002
OpenAlex ID: W1990502986
cites work: Geometric algorithms and combinatorial optimization
cites work: Random walks and anO*(n5) volume algorithm for convex bodies
cites work: Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
cites work: Q4861743
cites work: Q4230590
cites work: Approximation algorithms for indefinite quadratic programming
cites work: A Markov inequality in several dimensions
DOI: 10.1016/J.ORL.2009.07.002
description: scientific article; zbMATH DE number 5643624