177 search results - page 7 / 36 » Semidefinite Programming Relaxations for the Quadratic Assig... |
113
click to vote
IVC
2007
15 years 3 months ago
2007
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
123
click to vote
CVPR
2004
IEEE
16 years 5 months ago
2004
IEEE
Given a set of patterns and a similarity measure between them, we will present an optimization framework to approximate a small subset, known as a canonical set, whose members clo...
103
click to vote
IPCO
2001
15 years 4 months ago
2001
Abstract. We consider the general nonlinear optimization problem in 01 variables and provide an explicit equivalent convex positive semidefinite program in 2n - 1 variables. The op...
147
click to vote
SODA
2010
ACM
16 years 14 days ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
133
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
We consider the robust beamforming problem under imperfect channel state information (CSI) subject to SINR constraints in a downlink multiuser MISO system. One popular approach to...