SEMIDEFINITE PROGRAMMING 1 Introduction 11 Semidenite
Short Description
the semidenite programming problem is to move as far as possible in the direction ….. inite programming are Jarre 50 , Vandenberghe and Boyd 108 , Rendl, …
Website: www.stanford.edu | Filesize: 504kb
Content
SEMIDEFINITE PROGRAMMING
LIEVEN VANDENBERGHEy AND STEPHEN BOYDz
Abstract. In semide nite programming one minimizes a linear function subject to the constraint
that an ane 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 niteprogramming uni es several standard problems (e.g., linear and quadratic programming)
and nds many applications in engineering and combinatorial optimization.
Although semide nite programs are much more general…
Get the file Download here
Related Searches:
Comments
Leave a Reply
