Sciweavers

9719 search results - page 287 / 1944
» Answer Set Optimization
Sort
View
JGO
2008
115views more  JGO 2008»
15 years 6 months ago
Smoothing by mollifiers. Part I: semi-infinite optimization
We show that a compact feasible set of a standard semi-infinite optimization problem can be approximated arbitrarily well by a level set of a single smooth function with certain r...
Hubertus Th. Jongen, Oliver Stein
CORR
2010
Springer
146views Education» more  CORR 2010»
15 years 6 months ago
Optimal power allocation for downstream xDSL with per-modem total power constraints : Broadcast Channel Optimal Spectrum Balanci
Abstract-Recently, the duality between Multiple Input Multiple Output (MIMO) Multiple Access Channels (MAC) and MIMO Broadcast Channels (BC) has been established under a total powe...
Vincent Le Nir, Marc Moonen, Jan Verlinden, Mamoun...
CORR
2008
Springer
98views Education» more  CORR 2008»
15 years 6 months ago
Sparse Recovery by Non-convex Optimization -- Instance Optimality
In this note, we address the theoretical properties of p, a class of compressed sensing decoders that rely on p minimization with p (0, 1) to recover estimates of sparse and compr...
Rayan Saab, Özgür Yilmaz
169
Voted
ISSS
1995
IEEE
100views Hardware» more  ISSS 1995»
15 years 10 months ago
Optimal code generation for embedded memory non-homogeneous register architectures
This paper examines the problem of code-generation for expression trees on non-homogeneous register set architectures. It proposes and proves the optimality of an O(n) algorithm f...
Guido Araujo, Sharad Malik
AUTOMATICA
2007
129views more  AUTOMATICA 2007»
15 years 6 months ago
Robust control of polytopic systems by convex optimization
— Robust control synthesis of linear time-invariant SISO polytopic systems is investigated using the polynomial approach. A convex set of all stabilizing controllers for a polyto...
Alireza Karimi, Hamid Khatibi, Roland Longchamp