Grothendieck inequalities for semidefinite programs with rank constraint

Details Grothendieck inequalities for semidefinite programs with rank constraint Grothendieck inequalities for semidefinite programs with rank constraint

2010-11-08

arxiv.org/abs/1011.1754v1

Mathematics

Optimization and Control

18 pages

Scientific paper

Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the integrality gap between two optimization problems: A difficult semidefinite program with rank-1 constraint and its easy semidefinite relaxation where the rank constrained is dropped. For instance, the integrality gap of the Goemans-Williamson approximation algorithm for MAX CUT can be seen as a Grothendieck inequality. In this paper we consider Grothendieck inequalities for ranks greater than 1 and we give one application in statistical mechanics: Approximating ground states in the n-vector model.

Affiliated with

Also associated with

No associations

Rating

Grothendieck inequalities for semidefinite programs with rank constraint does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Grothendieck inequalities for semidefinite programs with rank constraint, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Grothendieck inequalities for semidefinite programs with rank constraint will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-130985