Sciweavers

309 search results - page 18 / 62
» Smooth Optimization with Approximate Gradient
Sort
View
MOC
2010
13 years 2 months ago
Discontinuous Galerkin approximations of the Stokes and Navier-Stokes equations
Numerical schemes to compute approximate solutions of the evolutionary Stokes and Navier-Stokes equations are studied. The schemes are discontinuous in time and conforming in space...
Konstantinos Chrysafinos, Noel Walkington
NIPS
2003
13 years 9 months ago
Distributed Optimization in Adaptive Networks
We develop a protocol for optimizing dynamic behavior of a network of simple electronic components, such as a sensor network, an ad hoc network of mobile devices, or a network of ...
Ciamac Cyrus Moallemi, Benjamin Van Roy
CDC
2008
IEEE
124views Control Systems» more  CDC 2008»
14 years 2 months ago
A proximal center-based decomposition method for multi-agent convex optimization
— In this paper we develop a new dual decomposition method for optimizing a sum of convex objective functions corresponding to multiple agents but with coupled constraints. In ou...
Ion Necoara, Johan A. K. Suykens
KDD
2012
ACM
194views Data Mining» more  KDD 2012»
11 years 10 months ago
A sparsity-inducing formulation for evolutionary co-clustering
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
Shuiwang Ji, Wenlu Zhang, Jun Liu
TWC
2010
13 years 2 months ago
A fixed-lag particle smoother for blind SISO equalization of time-varying channels
We introduce a new sequential importance sampling (SIS) algorithm which propagates in time a Monte Carlo approximation of the posterior fixed-lag smoothing distribution of the symb...
Alberto Gaspar Guimarães, Boujemaa Ait-El-F...