First Page | Document Content | |
---|---|---|
![]() Date: 2008-07-28 19:13:28Mathematics Convex optimization Linear programming Real algebraic geometry Semidefinite programming Linear matrix inequality Quadratically constrained quadratic program Quadratic programming Interior point method Mathematical optimization Operations research Mathematical analysis | Source URL: stanford.eduDownload Document from Source WebsiteFile Size: 5,00 MBShare Document on Facebook |
![]() | Quantum Speed-ups for Semidefinite Programming Fernando G.S.L. Brandão MSR -> Caltech based on joint work withDocID: 1ozvj - View Document |
![]() | Scalable Semidefinite Relaxation for Maximum A Posterior EstimationDocID: 1kPMM - View Document |
![]() | (This is a sample cover image for this issue. The actual cover is not yet available at this time.) This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-DocID: ZB6y - View Document |
![]() | Computable representations for convex hulls of low-dimensional quadratic forms Kurt M. Anstreicher and Samuel Burer Dept. of Management Sciences University of Iowa February 6, 2007DocID: RD5O - View Document |
![]() | PDF DocumentDocID: Inbw - View Document |