Sciweavers

719 search results - page 9 / 144
» Solving Sparse Linear Constraints
Sort
View
PARA
2004
Springer
15 years 3 months ago
A Model-Order Reduction Technique for Low Rank Rational Perturbations of Linear Eigenproblems
Large and sparse rational eigenproblems where the rational term is of low rank k arise in vibrations of fluid–solid structures and of plates with elastically attached loads. Exp...
Frank Blömeling, Heinrich Voss
113
Voted
CORR
2010
Springer
228views Education» more  CORR 2010»
14 years 8 months ago
Sparse Inverse Covariance Selection via Alternating Linearization Methods
Gaussian graphical models are of great interest in statistical learning. Because the conditional independencies between different nodes correspond to zero entries in the inverse c...
Katya Scheinberg, Shiqian Ma, Donald Goldfarb
79
Voted
CAV
2009
Springer
218views Hardware» more  CAV 2009»
15 years 10 months ago
Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers
Abstract. We propose a novel, sound, and complete Simplex-based algorithm for solving linear inequalities over integers. Our algorithm, which can be viewed as a semantic generaliza...
Isil Dillig, Thomas Dillig, Alex Aiken
JMLR
2012
13 years 19 days ago
Primal-Dual methods for sparse constrained matrix completion
We develop scalable algorithms for regular and non-negative matrix completion. In particular, we base the methods on trace-norm regularization that induces a low rank predicted ma...
Yu Xin, Tommi Jaakkola
ICASSP
2010
IEEE
14 years 10 months ago
Algorithms for robust linear regression by exploiting the connection to sparse signal recovery
In this paper, we develop algorithms for robust linear regression by leveraging the connection between the problems of robust regression and sparse signal recovery. We explicitly ...
Yuzhe Jin, Bhaskar D. Rao