Sciweavers

145 search results - page 21 / 29
» On Constrained Sparse Matrix Factorization
Sort
View
PAMI
2012
13 years 7 days ago
Task-Driven Dictionary Learning
—Modeling data with linear combinations of a few elements from a learned dictionary has been the focus of much recent research in machine learning, neuroscience, and signal proce...
Julien Mairal, Francis Bach, Jean Ponce
SIAMJO
2008
114views more  SIAMJO 2008»
14 years 9 months ago
An Inexact SQP Method for Equality Constrained Optimization
We present an algorithm for large-scale equality constrained optimization. The method is based on a characterization of inexact sequential quadratic programming (SQP) steps that ca...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal
CORR
2011
Springer
209views Education» more  CORR 2011»
14 years 1 months ago
Analysis and Improvement of Low Rank Representation for Subspace segmentation
We analyze and improve low rank representation (LRR), the state-of-the-art algorithm for subspace segmentation of data. We prove that for the noiseless case, the optimization mode...
Siming Wei, Zhouchen Lin
SIAMSC
2008
123views more  SIAMSC 2008»
14 years 9 months ago
Balanced Incomplete Factorization
In this paper we present a new incomplete factorization of a square matrix into triangular factors in which we get standard LU or LDLT factors (direct factors) and their inverses (...
Rafael Bru, José Marín, José ...
IPPS
2007
IEEE
15 years 4 months ago
Memory Optimizations For Fast Power-Aware Sparse Computations
— We consider memory subsystem optimizations for improving the performance of sparse scientific computation while reducing the power consumed by the CPU and memory. We first co...
Konrad Malkowski, Padma Raghavan, Mary Jane Irwin