Semidefinite Programming
Published in SIAM Review • Mar 1, 1996
NobleIDNI8P41W55R65S72
Authors:,
Lieven Vandenberghe
Stephen Boyd
Abstract
In semidefinite programming, one minimizes a linear function subject to the constraint that an affine combination of symmetric matrices is positive semidefinite. Such a constraint is nonlinear and nonsmooth, but convex, so semidefinite programs are convex optimization problems. semidefinite programm...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!