Sciweavers

3049 search results - page 85 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
CDC
2009
IEEE
137views Control Systems» more  CDC 2009»
15 years 9 months ago
Asynchronous gossip algorithms for stochastic optimization
Abstract— We consider a distributed multi-agent network system where the goal is to minimize an objective function that can be written as the sum of component functions, each of ...
Sundhar Srinivasan Ram, Angelia Nedic, Venugopal V...
SAC
2011
ACM
14 years 11 months ago
A quasi-Newton acceleration for high-dimensional optimization algorithms
Abstract In many statistical problems, maximum likelihood estimation by an EM or MM algorithm suffers from excruciatingly slow convergence. This tendency limits the application of ...
Hua Zhou, David Alexander, Kenneth Lange
GECCO
2006
Springer
130views Optimization» more  GECCO 2006»
15 years 8 months ago
An efficient multi-objective evolutionary algorithm with steady-state replacement model
The generic Multi-objective Evolutionary Algorithm (MOEA) aims to produce Pareto-front approximations with good convergence and diversity property. To achieve convergence, most mu...
Dipti Srinivasan, Lily Rachmawati
DCC
2010
IEEE
15 years 11 months ago
On Computation of Performance Bounds of Optimal Index Assignment
Channel-optimized index assignment of source codewords is arguably the simplest way of improving transmission error resilience, while keeping the source and/or channel codes intac...
Xiaolin Wu, Hans D. Mittelmann, Xiaohan Wang, Jia ...
TSP
2010
14 years 11 months ago
Optimization and analysis of distributed averaging with short node memory
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat