DeepAI AI Chat
Log In Sign Up

Finding Sparse Solutions for Packing and Covering Semidefinite Programs

by   Khaled Elbassioni, et al.
Kyoto University
Masdar Institute of Science and Technology

Packing and covering semidefinite programs (SDPs) appear in natural relaxations of many combinatorial optimization problems as well as a number of other applications. Recently, several techniques were proposed, that utilize the particular structure of this class of problems, to obtain more efficient algorithms than those offered by general SDP solvers. For certain applications, as those described in this paper, it is desirable to obtain sparse dual solutions, i.e., those with support size (almost) independent of the number of primal constraints. In this paper, we give such an algorithm, which is an extension of a logarithmic-potential based algorithm of Grigoriadis, Khachiyan, Porkolab and Villavicencio (SIAM Journal of Optimization 41 (2001)) for packing/covering linear programs.


page 1

page 2

page 3

page 4


Positive Semidefinite Programming: Mixed, Parallel, and Width-Independent

We give the first approximation algorithm for mixed packing and covering...

Learning-Augmented Algorithms for Online Linear and Semidefinite Programming

Semidefinite programming (SDP) is a unifying framework that generalizes ...

Matchings, hypergraphs, association schemes, and semidefinite optimization

We utilize association schemes to analyze the quality of semidefinite pr...

Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems

Many combinatorial optimization problems such as the bin packing and mul...

Faster width-dependent algorithm for mixed packing and covering LPs

In this paper, we give a faster width-dependent algorithm for mixed pack...

Faster exact and approximation algorithms for packing and covering matroids via push-relabel

Matroids are a fundamental object of study in combinatorial optimization...

Scalable Relaxations of Sparse Packing Constraints: Optimal Biocontrol in Predator-Prey Network

Cascades represent rapid changes in networks. A cascading phenomenon of ...