Sciweavers

835 search results - page 10 / 167
» Adaptive Bound Optimization for Online Convex Optimization
Sort
View
ICASSP
2008
IEEE
14 years 2 months ago
Robust adaptive beamforming using sequential quadratic programming
In this paper, a new algorithm for robust adaptive beamforming is developed. The basic idea of the proposed algorithm is to estimate the difference between the actual and presumed...
Aboulnasr Hassanien, Sergiy A. Vorobyov, Kon Max W...
SIAMJO
2008
212views more  SIAMJO 2008»
13 years 7 months ago
Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with the projected gradient. ...
Radek Kucera
GECCO
2009
Springer
134views Optimization» more  GECCO 2009»
14 years 8 days ago
Black-box optimization benchmarking for noiseless function testbed using PSO_bounds
This paper benchmarks the particle swarm optimizer with adaptive bounds algorithm (PSO Bounds) on the noisefree BBOB 2009 testbed. The algorithm is further augmented with a simple...
Mohammed El-Abd, Mohamed S. Kamel
ICANN
2005
Springer
14 years 1 months ago
The LCCP for Optimizing Kernel Parameters for SVM
Abstract. Tuning hyper-parameters is a necessary step to improve learning algorithm performances. For Support Vector Machine classifiers, adjusting kernel parameters increases dra...
Sabri Boughorbel, Jean-Philippe Tarel, Nozha Bouje...
ESA
2010
Springer
197views Algorithms» more  ESA 2010»
13 years 5 months ago
How to Allocate Goods in an Online Market?
Abstract. We study an online version of Fisher's linear case market. In this market there are m buyers and a set of n dividable goods to be allocated to the buyers. The utilit...
Yossi Azar, Niv Buchbinder, Kamal Jain