Results 1  10
of
49
Solving liftandproject relaxations of binary integer programs
 SIAM Journal on Optimization
"... Abstract. We propose a method for optimizing the liftandproject relaxations of binary integer programs introduced by Lovász and Schrijver. In particular, we study both linear and semidefinite relaxations. The key idea is a restructuring of the relaxations, which isolates the complicating constrain ..."
Abstract

Cited by 23 (1 self)
 Add to MetaCart
Abstract. We propose a method for optimizing the liftandproject relaxations of binary integer programs introduced by Lovász and Schrijver. In particular, we study both linear and semidefinite relaxations. The key idea is a restructuring of the relaxations, which isolates the complicating constraints and allows for a Lagrangian approach. We detail an enhanced subgradient method and discuss its efficient implementation. Computational results illustrate that our algorithm produces tight bounds more quickly than stateoftheart linear and semidefinite solvers.
A scalable collusionresistant multiwinner cognitive spectrum auction game
 IEEE Trans. Wireless Commun
, 2009
"... Abstract—Dynamic spectrum access (DSA), enabled by cognitive radio technologies, has become a promising approach to improve efficiency in spectrum utilization, and the spectrum auction is one important DSA approach, in which secondary users lease some unused bands from primary users. However, spectr ..."
Abstract

Cited by 15 (8 self)
 Add to MetaCart
Abstract—Dynamic spectrum access (DSA), enabled by cognitive radio technologies, has become a promising approach to improve efficiency in spectrum utilization, and the spectrum auction is one important DSA approach, in which secondary users lease some unused bands from primary users. However, spectrum auctions are different from existing auctions studied by economists, because spectrum resources are interferencelimited rather than quantitylimited, and it is possible to award one band to multiple secondary users with negligible mutual interference. To accommodate this special feature in wireless communications, in this paper, we present a novel multiwinner spectrum auction game not existing in auction literature. As secondary users may be selfish in nature and tend to be dishonest in pursuit of higher profits, we develop effective mechanisms to suppress their dishonest/collusive behaviors when secondary users distort their valuations about spectrum resources and interference relationships. Moreover, in order to make the proposed game scalable when the size of problem grows, the semidefinite programming (SDP) relaxation is applied to reduce the complexity significantly. Finally, simulation results are presented to evaluate the proposed auction mechanisms, and demonstrate the complexity reduction as well. Index Terms—Cognitive radio, spectrum auction, collusionresistant mechanism, scalable algorithm. I.
Semidefinite Programming Relaxations and Algebraic Optimization in Control
 EUROPEAN JOURNAL OF CONTROL (2003)9:307321
, 2003
"... We present an overview of the essential elements of semidefinite programming as a computational tool for the analysis of systems and control problems. We make particular emphasis on general duality properties as providing suboptimality or infeasibility certificates. Our focus is on the exciting deve ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
We present an overview of the essential elements of semidefinite programming as a computational tool for the analysis of systems and control problems. We make particular emphasis on general duality properties as providing suboptimality or infeasibility certificates. Our focus is on the exciting developments which have occured in the last few years, including robust optimization, combinatorial optimization, and algebraic methods such as sumofsquares. These developments are illustrated with examples of applications to control systems.
Semidefinite programming heuristics for surface reconstruction ambiguities
 In ECCV
, 2008
"... Abstract. We consider the problem of reconstructing a smooth surface under constraints that have discrete ambiguities. These problems arise in areas such as shape from texture, shape from shading, photometric stereo and shape from defocus. While the problem is computationally hard, heuristics based ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
Abstract. We consider the problem of reconstructing a smooth surface under constraints that have discrete ambiguities. These problems arise in areas such as shape from texture, shape from shading, photometric stereo and shape from defocus. While the problem is computationally hard, heuristics based on semidefinite programming may reveal the shape of the surface. 1
An Improved Semidefinite Programming Relaxation for the Satisfiability Problem
, 2002
"... The satisfiability (SAT) problem is a central problem in mathematical logic, computing theory, and artificial intelligence. An instance of SAT is specified by a set of boolean variables and a propositional formula in conjunctive normal form. Given such an instance, the SAT problem asks whether there ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
The satisfiability (SAT) problem is a central problem in mathematical logic, computing theory, and artificial intelligence. An instance of SAT is specified by a set of boolean variables and a propositional formula in conjunctive normal form. Given such an instance, the SAT problem asks whether there is a truth assignment to the variables such that the formula is satisfied. It is well known that SAT is in general NPcomplete, although several important special cases can be solved in polynomial time. Semidefinite programming (SDP) refers to the class of optimization problems where a linear function of a matrix variable X is maximized (or minimized) subject to linear constraints on the elements of X and the additional constraint that X be positive semidefinite. We are interested in the application of SDP to satisfiability problems, and in particular in how SDP can be used to detect unsatisfiability. In this paper we introduce a new SDP relaxation for the satisfiability problem. This SDP relaxation arises from the recently introduced paradigm of “higher liftings” for constructing semidefinite programming relaxations of discrete optimization problems.
THE OPERATOR Ψ FOR THE CHROMATIC NUMBER OF A GRAPH
, 2008
"... We investigate hierarchies of semidefinite approximations for the chromatic number χ(G) of a graph G. We introduce an operator Ψ mapping any graph parameter β(G), nested between the stability number α(G) and χ(G), to a new graph parameter Ψβ(G), nested between α(G) and χ(G); Ψβ(G) is polynomial ti ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
We investigate hierarchies of semidefinite approximations for the chromatic number χ(G) of a graph G. We introduce an operator Ψ mapping any graph parameter β(G), nested between the stability number α(G) and χ(G), to a new graph parameter Ψβ(G), nested between α(G) and χ(G); Ψβ(G) is polynomial time computable if β(G) is. As an application, there is no polynomial time computable graph parameter nested between the fractional chromatic number χ ∗ (·) and χ(·) unless P = NP. Moreover, based on the Motzkin–Straus formulation for α(G), we give (quadratically constrained) quadratic and copositive programming formulations for χ(G). Under some mild assumptions, n/β(G) ≤ Ψβ(G), but, while n/β(G) remains below χ ∗ (G), Ψβ(G) can reach χ(G) (e.g., for β(·) =α(·)). We also define new polynomial time computable lower bounds for χ(G), improving the classic Lovász theta number (and its strengthenings obtained by adding nonnegativity and triangle inequalities); experimental results on Hamming graphs, Kneser graphs, and DIMACS benchmark graphs will be given in the followup paper [N. Gvozdenović and M. Laurent, SIAM J. Optim., 19 (2008), pp. 592–615].
Cutting plane methods for semidefinite programming
, 2002
"... A semidefinite programming problem is a nonsmooth optimization problem, so it can be solved using a cutting plane approach. In this paper, we analyze properties of such an algorithm. We discuss characteristics of good polyhedral representations for the semidefinite program. We show that the complexi ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
A semidefinite programming problem is a nonsmooth optimization problem, so it can be solved using a cutting plane approach. In this paper, we analyze properties of such an algorithm. We discuss characteristics of good polyhedral representations for the semidefinite program. We show that the complexity of an interior point cutting plane approach based on a semiinfinite formulation of the semidefinite program has complexity comparable with that of a direct interior point solver. We show that cutting planes can always be found efficiently that support the feasible region. Further, we characterize the supporting hyperplanes that give high dimensional tangent planes, and show how such supporting hyperplanes can be found efficiently.
Multiparty quantum coin flipping
, 2003
"... We investigate coinflipping protocols for multiple parties in a quantum broadcast setting: (1) We propose and motivate a definition for quantum broadcast. (2) We prove that in this model, there are protocols for k parties with guaranteed bias 1/2 − Ω(1/k 1.78) for (k − 1) computationallyunbounded ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
We investigate coinflipping protocols for multiple parties in a quantum broadcast setting: (1) We propose and motivate a definition for quantum broadcast. (2) We prove that in this model, there are protocols for k parties with guaranteed bias 1/2 − Ω(1/k 1.78) for (k − 1) computationallyunbounded cheating parties. Classically, no bias < 1/2 can be achieved if a majority of the players is bad. (3) We extend our protocol to a setting where at most (1 −ǫ)k of the players are bad, for ǫ> 0. We show that in this case we can achieve a constant bias δ < 1/2 − Ω(ǫ 1.78), independent of k. (4) We show that our results are essentially optimal: for k parties with one good party, any quantum protocol can achieve bias at best 1/2 − O(1/k), while for (1 − ǫ)k cheating parties achieving constant bias δ < 1/2 − O(ǫ) is impossible, too. 1
Computing globally optimal solutions for singlerow layout problems using semidefinite programming and cutting planes
 INFORMS J. COMPUT
, 2008
"... This paper is concerned with the singlerow facility layout problem (SRFLP). A globally optimal solution to the SRFLP is a linear placement of rectangular facilities with varying lengths that achieves the minimum total cost associated with the (known or projected) interactions between them. We demon ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
This paper is concerned with the singlerow facility layout problem (SRFLP). A globally optimal solution to the SRFLP is a linear placement of rectangular facilities with varying lengths that achieves the minimum total cost associated with the (known or projected) interactions between them. We demonstrate that the combination of a semidefinite programming relaxation with cutting planes is able to compute globally optimal layouts for large SRFLPs with up to thirty departments. In particular, we report the globally optimal solutions for two sets of SRFLPs previously studied in the literature, some of which have remained unsolved since 1988.
Expressing Combinatorial Optimization Problems by Systems of Polynomial Equations and the Nullstellensatz
, 2007
"... Systems of polynomial equations over the complex or real numbers can be used to model combinatorial problems. In this way, a combinatorial problem is feasible (e.g. a graph is 3colorable, hamiltonian, etc.) if and only if a related system of polynomial equations has a solution. In the first part of ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
Systems of polynomial equations over the complex or real numbers can be used to model combinatorial problems. In this way, a combinatorial problem is feasible (e.g. a graph is 3colorable, hamiltonian, etc.) if and only if a related system of polynomial equations has a solution. In the first part of this paper, we construct new polynomial encodings for the problems of finding in a graph its longest cycle, the largest planar subgraph, the edgechromatic number, or the largest kcolorable subgraph. For an infeasible polynomial system, the (complex) Hilbert Nullstellensatz gives a certificate that the associated combinatorial problem is infeasible. Thus, unless P = NP, there must exist an infinite sequence of infeasible instances of each hard combinatorial problem for which the minimum degree of a Hilbert Nullstellensatz certificate of the associated polynomial system grows. We show that the minimumdegree of a Nullstellensatz certificate for the nonexistence of a stable set of size greater than the stability number of the graph is the stability number of the graph. Moreover, such a certificate contains at least one term per stable set of G. In contrast, for non3colorability, we found only graphs with Nullstellensatz certificates of degree four.