Sciweavers

213 search results - page 10 / 43
» Semidefinite programming
Sort
View
STOC
2007
ACM
117views Algorithms» more  STOC 2007»
14 years 9 months ago
A combinatorial, primal-dual approach to semidefinite programs
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
Sanjeev Arora, Satyen Kale
EM
2010
134views Management» more  EM 2010»
13 years 8 months ago
High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
Abstract. The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit spheres which simultaneously can touch a central unit sphere. Bachoc and...
Hans D. Mittelmann, Frank Vallentin
BMCBI
2007
161views more  BMCBI 2007»
13 years 8 months ago
Efficient classification of complete parameter regions based on semidefinite programming
Background: Current approaches to parameter estimation are often inappropriate or inconvenient for the modelling of complex biological systems. For systems described by nonlinear ...
Lars Kuepfer, Uwe Sauer, Pablo A. Parrilo
TSP
2010
13 years 3 months ago
A dual perspective on separable semidefinite programming with applications to optimal downlink beamforming
This paper considers the downlink beamforming optimization problem that minimizes the total transmission power subject to global shaping constraints and individual shaping constrai...
Yongwei Huang, Daniel Pérez Palomar
CPAIOR
2006
Springer
14 years 9 days ago
The Power of Semidefinite Programming Relaxations for MAX-SAT
Recently, Linear Programming (LP)-based relaxations have been shown promising in boosting the performance of exact MAX-SAT solvers. We compare Semidefinite Programming (SDP) based ...
Carla P. Gomes, Willem Jan van Hoeve, Lucian Leahu