Sciweavers

3049 search results - page 22 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Proportionate-type normalized least mean square algorithm with gain allocation motivated by minimization of mean-square-weight d
In previous work, a water-filling algorithm was proposed which sought to minimize the mean square error (MSE) at any given time by optimally choosing the gains (i.e. step-sizes) ...
Kevin T. Wagner, Milos Doroslovacki
CEC
2007
IEEE
14 years 1 months ago
On the analysis of average time complexity of estimation of distribution algorithms
— Estimation of Distribution Algorithm (EDA) is a well-known stochastic optimization technique. The average time complexity is a crucial criterion that measures the performance o...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
CCE
2004
13 years 7 months ago
Improving convergence of the stochastic decomposition algorithm by using an efficient sampling technique
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...
José María Ponce-Ortega, Vicente Ric...
IPPS
2002
IEEE
14 years 14 days ago
A High Performance Algorithm for Incompressible Flows Using Local Solenoidal Functions
The convergence of iterative methods used to solve the linear systems arising in incompressible flow problems is sensitive to flow parameters such as the Reynolds number, time s...
Sreekanth R. Sambavaram, Vivek Sarin
ICDM
2005
IEEE
109views Data Mining» more  ICDM 2005»
14 years 1 months ago
Triple Jump Acceleration for the EM Algorithm
This paper presents the triple jump framework for accelerating the EM algorithm and other bound optimization methods. The idea is to extrapolate the third search point based on th...
Han-Shen Huang, Bou-Ho Yang, Chun-Nan Hsu