Sciweavers

309 search results - page 32 / 62
» Smooth Optimization with Approximate Gradient
Sort
View
MP
2006
137views more  MP 2006»
13 years 7 months ago
New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...
Yu-Hong Dai, Roger Fletcher
MOC
2002
75views more  MOC 2002»
13 years 7 months ago
Quincunx fundamental refinable functions and quincunx biorthogonal wavelets
Abstract. We analyze the approximation and smoothness properties of quincunx fundamental refinable functions. In particular, we provide a general way for the construction of quincu...
Bin Han 0003, Rong-Qing Jia
SPIRE
2010
Springer
13 years 6 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
CDC
2010
IEEE
106views Control Systems» more  CDC 2010»
13 years 2 months ago
Optimal cross-layer wireless control policies using TD learning
We present an on-line crosslayer control technique to characterize and approximate optimal policies for wireless networks. Our approach combines network utility maximization and ad...
Sean P. Meyn, Wei Chen, Daniel O'Neill
TON
2010
151views more  TON 2010»
13 years 2 months ago
Throughput Optimal Distributed Power Control of Stochastic Wireless Networks
The Maximum Differential Backlog (MDB) control policy of Tassiulas and Ephremides has been shown to adaptively maximize the stable throughput of multihop wireless networks with ran...
Yufang Xi, Edmund M. Yeh