Convex Iteration

From Wikimization

Revision as of 20:21, 4 February 2008 by Dattorro (Talk | contribs)
Jump to: navigation, search

Convex iteration is method for constraining rank or cardinality in an otherwise convex optimization problem. A rank or cardinality constraint is replaced by a weighted linear regularization term added to the objective, and then two convex problems are iterated until convergence where, ideally, solution to the original problem is found.

Personal tools