# Convex Iteration

### From Wikimization

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