Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization

Authors:
Steven J. Benson;Yinyu Ye;Xiong Zhang
Affiliations:
-;-;-
Venue:
SIAM Journal on Optimization
Year:
1999

Citing 0
Cited 28

Interior-Point Algorithms for Semidefinite Programming Based on a Nonlinear Formulation

Computational Optimization and Applications
A Note on the Calculation of Step-Lengths in Interior-Point Methods for Semidefinite Programming

Computational Optimization and Applications
On Semidefinite Programming Relaxations of (2+p)-SAT

Annals of Mathematics and Artificial Intelligence
Semidefinite programming for discrete optimization and matrix completion problems

Discrete Applied Mathematics
The bundle method for hard combinatorial optimization problems

Combinatorial optimization - Eureka, you shrink!
Efficient location area planning for cellular networks with hierarchical location databases

Computer Networks: The International Journal of Computer and Telecommunications Networking
Lagrangian Smoothing Heuristics for Max-Cut

Journal of Heuristics
A semidefinite programming approach to tensegrity theory and realizability of graphs

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A parallel primal-dual interior-point method for semidefinite programs using positive definite matrix completion

Parallel Computing
Semidefinite programming based algorithms for sensor network localization

ACM Transactions on Sensor Networks (TOSN)
Letters: An improved discrete Hopfield neural network for Max-Cut problems

Neurocomputing
Algorithm 875: DSDP5—software for semidefinite programming

ACM Transactions on Mathematical Software (TOMS)
Sums of squares based approximation algorithms for MAX-SAT

Discrete Applied Mathematics
Sum of squares method for sensor network localization

Computational Optimization and Applications
Robust cognitive beamforming with partial channel state information

IEEE Transactions on Wireless Communications
A successive SDP-NSDP approach to a robust optimization problem in finance

Computational Optimization and Applications
Efficient implementation of quasi-maximum-likelihood detection based on semidefinite relaxation

IEEE Transactions on Signal Processing
A parallel interior point decomposition algorithm for block angular semidefinite programs

Computational Optimization and Applications
A memetic algorithm with genetic particle swarm optimization and neural network for maximum cut problems

LSMS'07 Proceedings of the Life system modeling and simulation 2007 international conference on Bio-Inspired computational intelligence and applications
Practical methods for convex multi-view reconstruction

ECCV'10 Proceedings of the 11th European conference on Computer vision: Part IV
Approximating Semidefinite Packing Programs

SIAM Journal on Optimization
Approximation algorithms for semidefinite packing problems with applications to maxcut and graph coloring

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Clustering for bioinformatics via matrix optimization

Proceedings of the 2nd ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Location-aided routing with uncertainty in mobile ad hoc networks: A stochastic semidefinite programming approach

Mathematical and Computer Modelling: An International Journal
A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)

Discrete Optimization
A semidefinite optimization approach for the single-row layout problem with unequal dimensions

Discrete Optimization
Algorithm 925: Parallel Solver for Semidefinite Programming Problem having Sparse Schur Complement Matrix

ACM Transactions on Mathematical Software (TOMS)
Book drawings of complete bipartite graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a dual-scaling interior-point algorithm and show how it exploits the structure and sparsity of some large-scale problems. We solve the positive semidefinite relaxation of combinatorial and quadratic optimization problems subject to boolean constraints. We report the first computational results of interior-point algorithms for approximating maximum cut semidefinite programs with dimension up to 3,000.