## Stem semidefinit$ (all stems)

### 20 papers:

- STOC-2015-LeeRS #bound #programming
- Lower Bounds on the Size of Semidefinite Programming Relaxations (JRL, PR, DS), pp. 567–576.
- KDD-2015-HouWGD #clustering #programming #rank
- Non-exhaustive, Overlapping Clustering via Low-Rank Semidefinite Programming (YH, JJW, DFG, ISD), pp. 427–436.
- STOC-2014-Christiano #learning #online #programming
- Online local learning via semidefinite programming (PC), pp. 468–474.
- ICML-c2-2014-HuangCG #estimation #scalability
- Scalable Semidefinite Relaxation for Maximum A Posterior Estimation (QXH, YC, LJG), pp. 64–72.
- ICML-c3-2013-YoshiiTMG #infinity
- Infinite Positive Semidefinite Tensor Factorization for Source Separation of Mixture Signals (KY, RT, DM, MG), pp. 576–584.
- CAV-2013-DaiXZ #generative #programming
- Generating Non-linear Interpolants by Semidefinite Programming (LD, BX, NZ), pp. 364–380.
- STOC-2012-FioriniMPTW #bound #exponential #linear
- Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds (SF, SM, SP, HRT, RdW), pp. 95–106.
- ICML-2012-Laue #algorithm #hybrid #optimisation
- A Hybrid Algorithm for Convex Semidefinite Optimization (SL), p. 142.
- DATE-2010-MahmoodBMMD #modelling #multi #order #programming
- Passive reduced order modeling of multiport interconnects via semidefinite programming (ZM, BNB, TM, AM, LD), pp. 622–625.
- ICALP-v1-2010-BrietFV #constraints #problem #rank
- The Positive Semidefinite Grothendieck Problem with Rank Constraint (JB, FMdOF, FV), pp. 31–42.
- ICALP-A-2008-LeeM #programming #theorem
- Product Theorems Via Semidefinite Programming (TL, RM), pp. 674–685.
- ICML-2008-LiLT #classification #constraints #programming
- Pairwise constraint propagation by semidefinite programming for semi-supervised classification (ZL, JL, XT), pp. 576–583.
- STOC-2007-AroraK #approach #combinator #source code
- A combinatorial, primal-dual approach to semidefinite programs (SA, SK), pp. 227–236.
- ICML-2007-YeCJ #kernel #learning #parametricity #programming
- Discriminant kernel and regularization parameter learning via semidefinite programming (JY, JC, SJ), pp. 1095–1102.
- VMCAI-2005-Cousot #abstraction #parametricity #programming #proving #termination
- Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming (PC), pp. 1–24.
- STOC-2001-FeigeS #on the
- On the integrality ratio of semidefinite relaxations of MAX CUT (UF, GS), pp. 433–442.
- STOC-2001-GoemansW #algorithm #approximate #problem #programming
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (MXG, DPW), pp. 443–452.
- ICALP-2001-FeigeL #source code
- The RPR2 Rounding Technique for Semidefinite Programs (UF, ML), pp. 213–224.
- STOC-1999-Zwick99a #problem #programming
- Outward Rotations: A Tool for Rounding Solutions of Semidefinite Programming Relaxations, with Applications to MAX CUT and Other Problems (UZ), pp. 679–687.
- STOC-1996-KleinL #algorithm #approximate #performance #source code
- Efficient Approximation Algorithms for Semidefinite Programs Arising from MAX CUT and COLORING (PNK, HIL), pp. 338–347.