573 search results - page 58 / 115 » On Wiedemann's Method of Solving Sparse Linear Systems |
COLT
2004
Springer
14 years 2 months ago
2004
Springer
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...
FGCS
2008
13 years 9 months ago
2008
Many scientific and engineering applications involve inverting large matrices or solving systems of linear algebraic equations. Solving these problems with proven algorithms for d...
SIAMSC
2008
13 years 9 months ago
2008
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
CIMAGING
2009
13 years 10 months ago
2009
The Dantzig selector is a near ideal estimator for recovery of sparse signals from linear measurements in the presence of noise. It is a convex optimization problem which can be r...
ICASSP
2011
IEEE
13 years 25 days ago
2011
IEEE
Basis Pursuit (BP) finds a minimum ℓ1-norm vector z that satisfies the underdetermined linear system Mz = b, where the matrix M and vector b are given. Lately, BP has attracte...