Mathematical Programming

, Volume 134, Issue 1, pp 5–22

Semidefinite optimization in discrepancy theory

Authors

    • Eindhoven University of Technology
Open AccessFull Length Paper Series B

DOI: 10.1007/s10107-012-0546-7

Cite this article as:
Bansal, N. Math. Program. (2012) 134: 5. doi:10.1007/s10107-012-0546-7

Abstract

Recently, there have been several new developments in discrepancy theory based on connections to semidefinite programming. This connection has been useful in several ways. It gives efficient polynomial time algorithms for several problems for which only non-constructive results were previously known. It also leads to several new structural results in discrepancy itself, such as tightness of the so-called determinant lower bound, improved bounds on the discrepancy of the union of set systems and so on. We will give a brief survey of these results, focussing on the main ideas and the techniques involved.

Keywords

Semidefinite optimization Discrepancy theory Rounding error Algorithms

Mathematics Subject Classification

90 05

Copyright information

© The Author(s) 2012