Semideenite Programming

Abstract

In semide nite programming one minimizes a linear function subject to the constraint that an a ne combination of symmetric matrices is positive semide nite. Such a constraint is nonlinear and nonsmooth, but convex, so semide nite programs are convex optimization problems. Semide nite programming uni es several standard problems (e.g., linear and quadratic… (More)

Topics

  • Presentations referencing similar topics