Talks on Optimization
From Wikimization
(Difference between revisions)
(→Toward 0-norm Reconstruction, and a Nullspace Technique for Compressive Sampling) |
(→IPM per l’Ottimizzazione Conica: SOCP e SDP) |
||
| Line 35: | Line 35: | ||
[http://www.convexoptimization.com/TOOLS/Chartrand1.pdf Presented by Rick Chartrand with Valentina Staneva, Wotao Yin, & Kevin Vixie at the SIAM Conference on Imaging Science 2008, San Diego, California, July 7, 2008] | [http://www.convexoptimization.com/TOOLS/Chartrand1.pdf Presented by Rick Chartrand with Valentina Staneva, Wotao Yin, & Kevin Vixie at the SIAM Conference on Imaging Science 2008, San Diego, California, July 7, 2008] | ||
| - | == | + | == Interior-Point Methods per l’Ottimizzazione Conica: SOCP e SDP == |
[http://www.convexoptimization.com/TOOLS/IPM_Lezione4.pdf Presented by Andrea Cassioli, Dipartimento di Sistemi e Informatica, Universitá di Firenze, May 28, 2008] | [http://www.convexoptimization.com/TOOLS/IPM_Lezione4.pdf Presented by Andrea Cassioli, Dipartimento di Sistemi e Informatica, Universitá di Firenze, May 28, 2008] | ||
== Bregman Iterative Algorithms for L1 Minimization with Applications to Compressed Sensing == | == Bregman Iterative Algorithms for L1 Minimization with Applications to Compressed Sensing == | ||
[http://www.convexoptimization.com/TOOLS/sjo-BregmanIteration10-07.ppt Presented by Stanley Osher with W. Yin, D. Goldfarb, & J. Darbon at the iCME Colloquium (CME 500), Stanford University, December 3, 2007] (400KByte PowerPoint) | [http://www.convexoptimization.com/TOOLS/sjo-BregmanIteration10-07.ppt Presented by Stanley Osher with W. Yin, D. Goldfarb, & J. Darbon at the iCME Colloquium (CME 500), Stanford University, December 3, 2007] (400KByte PowerPoint) | ||
Revision as of 23:15, 22 November 2010
Slides, Powerpoint, and PDF Presentations (More talks, in video format)
Sampling Theory and Practice: 50 Ways to Sample your Signal
Martin Vetterli, EPFL & UC Berkeley (14MByte PowerPoint)
A Feasible Method for Optimization with 
or 
Rigidity and Localization: An Optimization Perspective
Explicit Sensor Network Localization using Semidefinite Programming and Facial Reduction
Toward 0-norm Reconstruction, and a Nullspace Technique for Compressive Sampling
Presented by Christine Law with Gary Glover at the Linear Algebra Seminar, University of California, Berkeley, February 4, 2009 (5MByte PowerPoint) Also presented by Christine Law with Gary Glover at the Linear Algebra and Optimization Seminar (CME510), iCME, Stanford University, November 19, 2008
Combining Geometry and Combinatorics: A Unified Approach to Sparse Signal Recovery
Presented by Anna Gilbert at the Applied Mathematics Seminar, Stanford University, October 3, 2008
Compressed Sensing with Contiguous Fourier Measurements
Optimization Problems in Compressed Sensing
Compressed Sensing in Astronomy
Highly Undersampled 0-Norm Reconstruction
Presented by Christine Law at Lucas Center for Imaging, Stanford University, July 9, 2008 (771KByte PowerPoint)
Nonconvex Compressive Sensing
Interior-Point Methods per l’Ottimizzazione Conica: SOCP e SDP
Bregman Iterative Algorithms for L1 Minimization with Applications to Compressed Sensing
Presented by Stanley Osher with W. Yin, D. Goldfarb, & J. Darbon at the iCME Colloquium (CME 500), Stanford University, December 3, 2007 (400KByte PowerPoint)