- Stochastic and Incremental Gradient Methods Benjamin Recht
- Convex Optimization Theory Athena Scientific, 2009
- Compressed Sensing MRI M. Lustig, D. Donoho, J. Santos, J. Pauly
- Transduction with Matrix Completion: Three Birds with One Stone
- CS525 Open-Book Midterm Exam Thursday, October 22, 1998, 7:30 a.m.{9:25 a.m.
- Bregman Itera+ve method for l1-minimiza+on
- Midterm Examination CS 525 -Spring 2009
- CS525 Open-Book Midterm Exam Thursday, March 18, 1999, 7:30 a.m.{9:25 a.m.
- Midterm Examination CS 525 -Spring 2004
- http://www.jstor.org The Simplex Method for Quadratic Programming
- Distributed Control of Systems Over Discrete Benjamin Recht, Member, IEEE, Raffaello D'Andrea, Senior Member, IEEE,
- THE SMALLEST SINGULAR VALUE OF A RANDOM RECTANGULAR MATRIX
- Midterm Examination CS 525 -Spring 2008
- Midterm Examination CS 525 -Fall 2009
- The Convex Geometry of Linear Inverse Problems Venkat Chandrasekaranm
- Midterm Examination CS 525 -Spring 2003
- Spectrum Sensing an application of sparse signal recovery
- Practical Large-Scale Optimization for Max-Norm Regularization
- PROCEEDINGS OF THE IEEE. SPECIAL ISSUE ON APPLICATIONS OF SPARSE REPRESENTATION AND COMPRESSIVE SENSING, VOL. XX, NO. YY, MONTH 20091 Computational Methods
- A P P L I E D & C O M P U T A T I O N A L M A T H E M A T I C S C A L I F O R N I A I N S T I T U T E O F T E C H N O L O G Y
- BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY
- Uniform Approximation of Functions with Random Bases
- Variable Selection in High Dimension Jingjiang Peng (Jack)
- A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization and continuation
- Bug hun'ng and Compressed Suhail Shergill
- Topology Inference from Co-Occurrence Observations
- Nuclear norm minimization for the planted clique and biclique problems
- An Improved Approximation Algorithm for the Column Subset
- Fast Computation of Low Rank Matrix Approximations
- Motivation Nave Method
- Motivation Elastic Net Computation Elastic-Net and algorithms for computing the
- CS726 -Lyapunov analysis and the Heavy Ball Method Benjamin Recht
- Projected Gradient Methods Benjamin Recht
- 525 Computing Project, Spring 2011 The Disputed Federalist Papers
- CS525 Open-Book Midterm Exam Thursday, March 5, 1998, 7:30 a.m.{9:25 a.m.
- CS525 Open-Book Midterm Exam Thursday, March 9, 2000, 7:30 a.m.9:15 a.m.
- Midterm Examination II CS 525 -Spring 2005
- Compressed Wideband Spectrum Sensing for Whitespace Networking
- Midterm Examination CS 525 -Spring 2002
- High-Dimensional Matched Subspace Detection When Data are Missing
- Determining Interconnections in Chemical Reaction Networks Antonis Papachristodoulou and Ben Recht
- Noiseless Case Noisy Case The Noisy Trigonometric Moment Problem
- B-Splines Approximation Industrial and Systems Engineering
- Vandermonde Decomposition of the Prony Hankel Matrix Badri Narayan Bhaskar
- Midterm Examination CS 525 -Fall 2010
- Hogwild!: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent
- 525 Computing Project 2, Fall 2011 DMTF with Compressed Sensing
- 525 Computing Project 2, Spring 2012 The Disputed Federalist Papers
- 525 Computing Project 1, Fall 2011 It's a small world, after all
- Beneath the valley of the noncommutative arithmetic-geometric mean inequality: conjectures, case-studies, and consequences
