Sciweavers

835 search results - page 45 / 167
» Adaptive Bound Optimization for Online Convex Optimization
Sort
View
DISOPT
2008
138views more  DISOPT 2008»
13 years 10 months ago
An algorithmic framework for convex mixed integer nonlinear programs
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software f...
Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn, ...
STACS
1999
Springer
14 years 3 months ago
An Optimal Competitive Strategy for Walking in Streets
We present an optimal strategy for searching for a goal in a street which achieves the competitive factor of √ 2, thus matching the best lower bound known before. This finally ...
Christian Icking, Rolf Klein, Elmar Langetepe
GLOBECOM
2010
IEEE
13 years 8 months ago
Design of Amplify and Forward MIMO Relay Networks with QoS Constraint
In this paper, we design the optimal precoding matrices for amplify-and-forward (AF) multiple-input multipleoutput (MIMO) relay networks. Specifically, we consider a dualhop relay ...
Jafar Mohammadi, Feifei Gao, Yue Rong
CIMAGING
2010
195views Hardware» more  CIMAGING 2010»
14 years 6 days ago
SPIRAL out of convexity: sparsity-regularized algorithms for photon-limited imaging
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...
Zachary T. Harmany, Roummel F. Marcia, Rebecca Wil...
AUTOMATICA
2004
113views more  AUTOMATICA 2004»
13 years 10 months ago
Ellipsoidal bounds for uncertain linear equations and dynamical systems
In this paper, we discuss semidefinite relaxation techniques for computing minimal size ellipsoids that bound the solution set of a system of uncertain linear equations. The propo...
Giuseppe Carlo Calafiore, Laurent El Ghaoui