Sciweavers

177 search results - page 20 / 36
» Semidefinite Programming Relaxations for the Quadratic Assig...
Sort
View
TSP
2011
142views more  TSP 2011»
13 years 4 months ago
Fractional QCQP With Applications in ML Steering Direction Estimation for Radar Detection
—This paper deals with the problem of estimating the steering direction of a signal, embedded in Gaussian disturbance, under a general quadratic inequality constraint, representi...
Antonio De Maio, Yongwei Huang, Daniel Pére...
AUTOMATICA
2010
90views more  AUTOMATICA 2010»
13 years 9 months ago
A line search improvement of efficient MPC
A recent lifting technique led to a computationally efficient Model Predictive Control (MPC) strategy in which the online optimization is performed using a univariate Newton-Raphs...
Basil Kouvaritakis, Shuang Li, Mark Cannon
EMMCVPR
2005
Springer
14 years 2 months ago
Probabilistic Subgraph Matching Based on Convex Relaxation
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
Christian Schellewald, Christoph Schnörr
OL
2007
156views more  OL 2007»
13 years 8 months ago
A trust region SQP algorithm for mixed-integer nonlinear programming
We propose a modified sequential quadratic programming (SQP) method for solving mixed-integer nonlinear programming problems. Under the assumption that integer variables have a s...
Oliver Exler, Klaus Schittkowski
ICASSP
2009
IEEE
14 years 1 months ago
Detection of sparse signals under finite-alphabet constraints
In this paper, we solve the problem of detecting the entries of a sparse finite-alphabet signal from a limited amount of data, for instance obtained by compressive sampling. While...
Zhi Tian, Geert Leus, Vincenzo Lottici