Dual gauge programs, with applications to quadratic programming and the minimum-norm problem
Mathematical Programming: Series A and B
Efficient solution of parabolic equations by Krylov approximation methods
SIAM Journal on Scientific and Statistical Computing
Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
Efficient approximation algorithms for semidefinite programs arising from MAX CUT and COLORING
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On Krylov Subspace Approximations to the Matrix Exponential Operator
SIAM Journal on Numerical Analysis
Approximate graph coloring by semidefinite programming
Journal of the ACM (JACM)
Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
SIAM Journal on Optimization
Non-euclidean restricted memory level method for large-scale convex optimization
Mathematical Programming: Series A and B
Smooth minimization of non-smooth functions
Mathematical Programming: Series A and B
Preconditioning Lanczos Approximations to the Matrix Exponential
SIAM Journal on Scientific Computing
Unsupervised Learning of Image Manifolds by Semidefinite Programming
International Journal of Computer Vision
A duality view of spectral methods for dimensionality reduction
ICML '06 Proceedings of the 23rd international conference on Machine learning
Smoothing Technique and its Applications in Semidefinite Optimization
Mathematical Programming: Series A and B
A combinatorial, primal-dual approach to semidefinite programs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
A note on the /spl theta/ number of Lovasz and the generalized Delsarte bound
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
The Operator $\Psi$ for the Chromatic Number of a Graph
SIAM Journal on Optimization
Max cut and the smallest eigenvalue
Proceedings of the forty-first annual ACM symposium on Theory of computing
Smooth Optimization with Approximate Gradient
SIAM Journal on Optimization
An SDP primal-dual algorithm for approximating the Lovász-theta function
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Smoothing Techniques for Computing Nash Equilibria of Sequential Games
Mathematics of Operations Research
Mathematical Programming: Series A and B
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Faster and simpler width-independent parallel algorithms for positive semidefinite programming
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
An efficiently computable support measure for frequent subgraph pattern mining
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part I
| Hi-index | 0.00 |
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications such as semidefinite programming relaxations for combinatorial optimization problems, sparse principal component analysis, and sparse variance unfolding techniques for dimension reduction. Our algorithm exploits the structural similarity between semidefinite packing programs and linear packing programs.