Polynomially Bounded Minimization Problems which are Hard to Approximate.

Published in: ICALP (1993)

Keyphrases

minimization problems
polynomially bounded
total variation
low rank
interior point
mumford shah
pairwise
small number
least squares
denoising
convex optimization
cutting plane