A proximal cutting plane method using Chebychev center for nonsmooth convex optimization.

Published in: Math. Program. (2009)

Keyphrases

convex optimization
interior point methods
cutting plane method
primal dual
convex programming
variational inequalities
low rank
interior point
linear programming problems
convex relaxation
total variation
semidefinite
newton method
convex sets
quadratic programming
pairwise
np hard