Sciweavers

1309 search results - page 5 / 262
» Approaching Optimality for Solving SDD Linear Systems
Sort
View
CORR
2008
Springer
149views Education» more  CORR 2008»
14 years 10 months ago
Gaussian Belief Propagation for Solving Systems of Linear Equations: Theory and Application
The canonical problem of solving a system of linear equations arises in numerous contexts in information theory, communication theory, and related fields. In this contribution, we...
Ori Shental, Danny Bickson, Paul H. Siegel, Jack K...
IPCO
2008
221views Optimization» more  IPCO 2008»
14 years 11 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
SAC
2005
ACM
15 years 3 months ago
A multi-agent approach for solving optimization problems involving expensive resources
In this paper, we propose a multi-agent approach for solving a class of optimization problems involving expensive resources, where monolithic local search schemes perform miserabl...
Hoong Chuin Lau, Hui Wang
CISS
2008
IEEE
15 years 4 months ago
Improved sum-rate optimization in the multiuser MIMO downlink
—We consider linear precoding and decoding in the downlink of a multiuser multiple-input, multiple-output (MIMO) system. In this scenario, the transmitter and the receivers may e...
Adam J. Tenenbaum, Raviraj S. Adve
SIAMREV
2010
174views more  SIAMREV 2010»
14 years 4 months ago
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
Benjamin Recht, Maryam Fazel, Pablo A. Parrilo