13 search results - page 1 / 3 » Grothendieck inequalities for semidefinite programs with ran... |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
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 ...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...
STOC
2004
ACM
14 years 5 months ago
2004
ACM
The cut-norm ||A||C of a real matrix A = (aij)iR,jS is the maximum, over all I R, J S of the quantity | iI,jJ aij|. This concept plays a major role in the design of efficient app...
TSP
2010
12 years 11 months ago
2010
This paper considers the downlink beamforming optimization problem that minimizes the total transmission power subject to global shaping constraints and individual shaping constrai...
CDC
2010
IEEE
12 years 12 months ago
2010
IEEE
Abstract-- We consider optimal experiment design for parametric prediction error system identification of linear timeinvariant systems in closed loop. The optimisation is performed...