found: Work cat.: Chor, B. A geometric approach to betweenness, 1995:p. 2 (Our use of semidefinite programming is inspired by the recent success in using this methodology to find improved approximation algorithms for several optimization problems)
found: Dictionary of algorithms and data structures, via WWW, Feb. 5, 2007(semidefinite programming -- generalization of a linear program in which any subset of the variables may be constrained to form a semidefinite matrix)
found: MathWorld, via WWW, Feb. 5, 2007(The field of semidefinite programming (SDP) or semidefinite optimization (SDO), deals with optimization problems over symmetric positive semidefinite matrix variables with linear cost function and linear constraints)
found: SIAM review, Mar. 1996:p. 49 (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)
found: Wikipedia, Feb. 5, 2007(Semidefinite programming (SDP) is an area of mathematics concerned with special optimization problems: the optimization of a linear objective function over the intersection of the cone of positive semidefinite matrices with an affine space)
notfound: Glossary of mathematical terms, via WWW, Feb. 5, 2007;PlanetMath, via WWW, Feb. 5, 2007
