Integrality gaps for sparsest cut and minimum linear arrangement problemsDEVANUR, Nikhil R; KHOT, Subhash A; SAKET, Rishi et al.Annual ACM symposium on theory of computing. 2006, pp 537-546, isbn 1-59593-134-1, 1Vol, 10 p.Conference Paper

Quantum weak coin-flipping with bias of 0.192MOCHON, Carlos.Annual Symposium on Foundations of Computer Science. 2004, pp 2-11, isbn 0-7695-2228-9, 1Vol, 10 p.Conference Paper

O(√log n) approximation to SPARSEST CUT in Õn² timeARORA, Sanjeev; HAZAN, Elad; KALE, Satyen et al.Annual Symposium on Foundations of Computer Science. 2004, pp 238-247, isbn 0-7695-2228-9, 1Vol, 10 p.Conference Paper

A note on treating a second order cone program as a special case of a semidefinite programSIM, Chee-Khian; ZHAO, Gongyun.Mathematical programming. 2005, Vol 102, Num 3, pp 609-613, issn 0025-5610, 5 p.Article

Learning SVM kernel with semi-definite programmingSHUZHONG YANG; SIWEI LUO.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28323-4, 3Vol, Part 1, 710-715Conference Paper

Multiparty quantum coin flippingAMBAINIS, Andris; BUHRMAN, Harry; DODIS, Yevgeniy et al.IEEE Conference on Computational Complexity. 2004, pp 250-259, isbn 0-7695-2120-7, 1Vol, 10 p.Conference Paper

Semidefinite programming for graph partitioning with preferences in data distributionOLIVEIRA, Suely; STEWART, David; SOMA, Takako et al.Lecture notes in computer science. 2003, pp 703-716, issn 0302-9743, isbn 3-540-00852-7, 14 p.Conference Paper

0.863-approximation algorithm for MAX DICUTMATUURA, Shiro; MATSUI, Tomomi.Lecture notes in computer science. 2001, pp 138-146, issn 0302-9743, isbn 3-540-42470-9Conference Paper

A new moment matching algorithm for sampling from partially specified symmetric distributionsDATE, P; MAMON, R; JALEN, L et al.Operations research letters. 2008, Vol 36, Num 6, pp 669-672, issn 0167-6377, 4 p.Article

Generalized separation theorems and the Farkas' lemmaJINYAN FAN.Applied mathematics letters. 2005, Vol 18, Num 7, pp 791-796, issn 0893-9659, 6 p.Article

Optimal array pattern synthesis using semidefinite programmingFAN WANG; BALAKRISHNAN, Venkataramanan; YUANPING ZHOU, Philip et al.IEEE transactions on signal processing. 2003, Vol 51, Num 5, pp 1172-1183, issn 1053-587X, 12 p.Article

Semidefinite programming and integer programmingLAURENT, Monique; RENDL, Franz.Report - Probability, networks and algorithms. 2002, Num 10, pp 1-89, issn 1386-3711Article

Semidefinite optimization in discrepancy theoryBANSAL, Nikhil.Mathematical programming (Print). 2012, Vol 134, Num 1, pp 5-22, issn 0025-5610, 18 p.Conference Paper

A facial reduction algorithm for finding sparse SOS representationsWAKI, Hayato; MURAMATSU, Masakazu.Operations research letters. 2010, Vol 38, Num 5, pp 361-365, issn 0167-6377, 5 p.Article

Reduced Vertex Set Result for Interval Semidefinite Optimization ProblemsCALAFIORE, G; DABBENE, F.Journal of optimization theory and applications. 2008, Vol 139, Num 1, pp 17-33, issn 0022-3239, 17 p.Article

Orthogonal transmit beamforming scheme based on semidefinite optimisationHONGJI XU; JU LIU; RUBIO, Francisco et al.European transactions on telecommunications. 2006, Vol 17, Num 2, pp 257-268, issn 1124-318X, 12 p.Conference Paper

Uniqueness of the solutions of some completion problemsLI, Chi-Kwong; MILLIGAN, Tom.Linear algebra and its applications. 2004, Vol 392, pp 91-102, issn 0024-3795, 12 p.Article

KYPD : A solver for semidefinite programs derived from the Kalman-Yakubovich-Popov lemmaWALLIN, Ragnar; HANSSON, Anders.IEEE International Symposium on computer aided control systems design. 2004, pp 1-6, isbn 0-7803-8636-1, 1Vol, 6 p.Conference Paper

A hybrid constraint programming and semidefinite programming approach for the stable set problemVAN HOEVE, Willem Jan.Lecture notes in computer science. 2003, pp 407-421, issn 0302-9743, isbn 3-540-20202-1, 15 p.Conference Paper

Improved approximation algorithms for the vertex cover problem in graphs and hypergraphsHALPERIN, Eran.SIAM journal on computing (Print). 2002, Vol 31, Num 5, pp 1608-1623, issn 0097-5397, 16 p.Article

Improved approximation algorithms for the partial vertex-cover problemHALPERIN, Eran; SRINIVASAN, Aravind.Lecture notes in computer science. 2002, pp 161-174, issn 0302-9743, isbn 3-540-44186-7, 14 p.Conference Paper

Unsupervised image partitioning with semidefinite programmingKEUCHEL, Jens; SCHNÖRR, Christoph; SCHELLEWALD, Christian et al.Lecture notes in computer science. 2002, pp 141-149, issn 0302-9743, isbn 3-540-44209-X, 9 p.Conference Paper

A .699-approximation algorithm for Max-BisectionYINYU YE.Mathematical programming. 2001, Vol 90, Num 1, pp 101-111, issn 0025-5610Article

The RPR² rounding technique for semidefinite programsFEIGE, Uriel; LANGBERG, Michael.Lecture notes in computer science. 2001, pp 213-224, issn 0302-9743, isbn 3-540-42287-0Conference Paper

Properties of the augmented Lagrangian in nonlinear semidefinite optimizationSUN, J; ZHANG, L. W; WU, Y et al.Journal of optimization theory and applications. 2006, Vol 129, Num 3, pp 437-456, issn 0022-3239, 20 p.Article