Optimization of a convex program with a polynomial perturbation

DOI10.1016/j.orl.2009.07.002zbMath1180.90313OpenAlexW1990502986MaRDI QIDQ1043242

Luis Rademacher, Ravindran Kannan

Publication date: 7 December 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2009.07.002

zbMATH Keywords

nonlinear programmingapproximation algorithmspolynomial optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

How close is the sample covariance matrix to the actual covariance matrix?

Cites Work

• Approximation algorithms for indefinite quadratic programming
• Geometric algorithms and combinatorial optimization
• A Markov inequality in several dimensions
• Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
• Random walks and anO*(n5) volume algorithm for convex bodies
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimization of a convex program with a polynomial perturbation