44 search results - page 1 / 9 » On convex relaxations of quadrilinear terms |
JGO
2010
12 years 11 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
ICCV
2011
IEEE
12 years 4 months ago
2011
IEEE
The multi-label problem is of fundamental importance to computer vision, yet finding global minima of the associated energies is very hard and usually impossible in practice. Rec...
OL
2011
12 years 7 months ago
2011
In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
CORR
2010
Springer
13 years 1 months ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
EOR
2002
13 years 4 months ago
2002
Let F be a subset of the n-dimensional Euclidean space Rn represented in terms of a compact convex subset C0 and a set PF of nitely or in nitely many quadratic functions on Rn such...