Sciweavers

213 search results - page 5 / 43
» Semidefinite programming
Sort
View
EOR
2010
103views more  EOR 2010»
13 years 8 months ago
Exploiting special structure in semidefinite programming: A survey of theory and applications
Semidefinite Programming (SDP) may be seen as a generalization of Linear Programming (LP). In particular, one may extend interior point algorithms for LP to SDP, but it has proven...
Etienne de Klerk
MOR
2006
80views more  MOR 2006»
13 years 8 months ago
The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implic
For a locally optimal solution to the nonlinear semidefinite programming problem, under Robinson's constraint qualification, the following conditions are proved to be equival...
Defeng Sun

Book
518views
15 years 7 months ago
Convex Optimization
Book web site includes links to a full course, software, and other material.
Stephen Boyd, Lieven Vandenberghe
MP
2006
113views more  MP 2006»
13 years 8 months ago
On the gap between the quadratic integer programming problem and its semidefinite relaxation
Consider the semidefinite relaxation (SDR) of the quadratic integer program (QIP): := maxx{-1,1}n xT Qx minD-Q 0 trace(D) =:
U. Malik, Imad M. Jaimoukha, G. D. Halikias, S. K....
MP
2010
150views more  MP 2010»
13 years 3 months ago
The algebraic degree of semidefinite programming
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minima...
Jiawang Nie, Kristian Ranestad, Bernd Sturmfels