Sciweavers

1387 search results - page 55 / 278
» Convexity in Discrete Space
Sort
View
ICASSP
2009
IEEE
14 years 1 months ago
Design of robust superdirective beamformers as a convex optimization problem
Broadband data-independent beamforming designs aiming at constant beamwidth often lead to superdirective beamformers for low frequencies, if the sensor spacing is small relative t...
Edwin Mabande, Adrian Schad, Walter Kellermann
AUTOMATICA
2006
64views more  AUTOMATICA 2006»
13 years 10 months ago
On the facet-to-facet property of solutions to convex parametric quadratic programs
In some of the recently-developed algorithms for convex parametric quadratic programs it is implicitly assumed that the intersection of the closures of two adjacent critical regio...
Jørgen Spjøtvold, Eric C. Kerrigan, ...
CORR
2011
Springer
157views Education» more  CORR 2011»
13 years 1 months ago
Large-Scale Convex Minimization with a Low-Rank Constraint
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...
Shai Shalev-Shwartz, Alon Gonen, Ohad Shamir
CORR
2010
Springer
64views Education» more  CORR 2010»
13 years 10 months ago
Near-Optimal Evasion of Convex-Inducing Classifiers
Classifiers are often used to detect miscreant activities. We study how an adversary can efficiently query a classifier to elicit information that allows the adversary to evade de...
Blaine Nelson, Benjamin I. P. Rubinstein, Ling Hua...
CDC
2009
IEEE
14 years 2 months ago
Dynamic practical stabilization of sampled-data linear distributed parameter systems
Abstract— In this paper, dynamic practical stability properties of infinite-dimensional sampled-data systems are discussed. A family of finite-dimensional discrete-time control...
Ying Tan, Emmanuel Trélat, Yacine Chitour, ...