A Subspace Semidefinite Programming for Spectral Graph Partitioning
ICCS '02 Proceedings of the International Conference on Computational Science-Part I
Semidefinite programming for discrete optimization and matrix completion problems
Discrete Applied Mathematics
Improving an Upper Bound on the Stability Number of a Graph
Journal of Global Optimization
Semidefinite programming for graph partitioning with preferences in data distribution
VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science
A new Lagrangian net algorithm for solving max-bisection problems
Journal of Computational and Applied Mathematics
| Hi-index | 0.00 |
This report describes SDPpack Version 0.9 Beta for Matlab 5.0. This version extends the previous release for semidefinite programming (SDP) to mixed semidefinite--quadratic--linear programs (SQLP), i.e.\ linear optimization problems over a product of semidefinite cones, quadratic cones and the nonnegative orthant. Together, these cones make up all possible homogeneous self-dual cones over the reals. The main routine implements a primal--dual Mehrotra predictor--corrector scheme based on the XZ+ZX search direction for SDP. More specialized routines are also available, one to solve SDP''s with diagonal constraints only, and one to compute the Lov\''asz $\theta$ function of a graph, both using the XZ search direction. Routines are also provided to determine whether an SQLP is primal or dual degenerate at its solution and whether strict complementarity holds there. Primal nondegeneracy is associated with dual uniqueness and dual nondegeneracy with primal uniqueness, though these conditions are not equivalent if strict complementarity fails to hold. A routine is also provided to compute the condition number of an SQLP. The Matlab code calls mex files for improved performance; binaries are available for several platforms. Benchmarks show that the codes