Sciweavers

422 search results - page 20 / 85
» On Non-Approximability for Quadratic Programs
Sort
View
COR
2010
105views more  COR 2010»
13 years 8 months ago
Effective formulation reductions for the quadratic assignment problem
In this paper we study two formulation reductions for the quadratic assignment problem (QAP). In particular we apply these reductions to the well known Adams and Johnson [2] integ...
Huizhen Zhang, Cesar Beltran-Royo, Miguel Constant...
ICASSP
2007
IEEE
14 years 2 months ago
Kernel Resolution Synthesis for Superresolution
Abstract— This work considers a combination classificationregression based framework with the proposal of using learned kernels in modified support vector regression to provide...
Karl S. Ni, Truong Nguyen
EOR
2002
87views more  EOR 2002»
13 years 7 months ago
On the finite convergence of successive SDP relaxation methods
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...
Masakazu Kojima, Levent Tunçel
CONSTRAINTS
1999
105views more  CONSTRAINTS 1999»
13 years 7 months ago
Algorithmic Power from Declarative Use of Redundant Constraints
Interval constraints can be used to solve problems in numerical analysis. In this paper we show that one can improve the performance of such an interval constraint program by the ...
Maarten H. van Emden
SIAMREV
2010
181views more  SIAMREV 2010»
13 years 2 months ago
A Variational Approach to Copositive Matrices
This work surveys essential properties of the so-called copositive matrices, the study of which is spread over more than fifty-five years. Special emphasis is given to variational ...
Jean-Baptiste Hiriart-Urruty, Alberto Seeger