Sciweavers

279 search results - page 11 / 56
» Type-II Optimal Polynomial Bases
Sort
View
INFOCOM
2011
IEEE
13 years 3 days ago
Optimal channel assignment and power allocation for dual-hop multi-channel multi-user relaying
Abstract—We consider the problem of jointly optimizing channel pairing, channel-user assignment, and power allocation in a single-relay multiple-access system. The optimization o...
Mahdi Hajiaghayi, Min Dong, Ben Liang
AUTOMATICA
2007
129views more  AUTOMATICA 2007»
13 years 8 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
JMLR
2012
11 years 11 months ago
Minimax-Optimal Rates For Sparse Additive Models Over Kernel Classes Via Convex Programming
Sparse additive models are families of d-variate functions with the additive decomposition f∗ = ∑j∈S f∗ j , where S is an unknown subset of cardinality s d. In this paper,...
Garvesh Raskutti, Martin J. Wainwright, Bin Yu
ATMOS
2007
119views Optimization» more  ATMOS 2007»
13 years 10 months ago
Models for Railway Track Allocation
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
Ralf Borndörfer, Thomas Schlechte
AUTOMATICA
2005
86views more  AUTOMATICA 2005»
13 years 8 months ago
Sensitivity shaping with degree constraint by nonlinear least-squares optimization
This paper presents a new approach to shaping of the frequency response of the sensitivity function. In this approach, a desired frequency response is assumed to be specified at a...
Ryozo Nagamune, Anders Blomqvist