@presentation {macedo2013SINBADdap,
	title = {A dual approach to PhaseLift via gauge programming and bundle methods},
	year = {2013},
	publisher = {SINBAD},
	abstract = {A feature common to many sparse optimization problems is that the number of variables may be significantly larger than the number of constraints- e.g., the matrix-lifting approach taken by PhaseLift for phase retrieval results in a problem where the number of variables is quadratic in the number of constraints. We consider a duality framework and numerical methods to leverage the relatively small number of constraints. Preliminary numerical results illustrate our approach and its flexibility.},
	keywords = {Presentation, SINBAD, SINBADFALL2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Fall/macedo2013SINBADdap/macedo2013SINBADdap.pdf},
	author = {Ives Macedo and Michael P. Friedlander and Felix J. Herrmann}
}
@presentation {pong2013SINBADppg,
	title = {The proximal-proximal gradient algorithm},
	year = {2013},
	publisher = {SINBAD},
	abstract = {In many applications, one has to minimize the sum of a smooth loss function modeling misfit and a regularization term inducing structures. In this talk, we consider the case when the regularization is a composition of a convex function, whose proximal mapping is easy to compute, and a nonzero linear map. Such instances arise in system identification and realization problems. In this talk, we present a new algorithm, the proximal-proximal gradient algorithm, which admits easy subproblems. Our algorithm reduces to the proximal gradient algorithm if the linear map is just the identity map, and can be viewed as "very inexact" inexact proximal gradient algorithm. We show that the whole sequence generated from the algorithm converges to an optimal solution, and establish an upper bound on iteration complexity.},
	keywords = {Presentation, SINBAD, SINBADFALL2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Fall/pong2013SINBADppg/pong2013SINBADppg.pdf},
	author = {Ting Kei Pong and Michael P. Friedlander and Felix J. Herrmann}
}
@presentation {nutini2013SINBADpcb,
	title = {Putting the curvature back into sparse solvers},
	year = {2013},
	publisher = {SINBAD},
	abstract = {For many problems in signal and image processing, we seek a sparse solution that solves that approximately solves the problem Ax $\approx$ b, where A is an m-by-n matrix and b is an m-vector. Many of the most used approaches to problem thissuch as iterative soft thresholding SPGL1 andare first-order methods. As a result, these methods can sometimes be slow to converge. In this talk, we present an approach that takes advantage of the easily-obtainable second-order information. By exploiting this available second-order information, we are able to put the curvature back into sparse solvers and improve upon the convergence rates of existing solvers.},
	keywords = {Presentation, SINBAD, SINBADFALL2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Fall/nutini2013SINBADpcb/nutini2013SINBADpcb.pdf},
	author = {Julie Nutini and Michael P. Friedlander and Felix J. Herrmann}
}
@presentation {goh2013SINBADttt,
	title = {Taming time through tangents},
	year = {2013},
	publisher = {SINBAD},
	abstract = {Given two vectors of (possibly) different lengths, the edit distance considers all possible alignments between the two and picks the one that minimizes the number of operations needed to turn one into the other. Though highly non-smooth and riddled with local minima, we show a way to compute the convex envelope of this function, which opens the door to using the approximate edit distance as a surrogate for the L2 distance and comparing vectors of different lengths.},
	keywords = {Presentation, SINBAD, SINBADFALL2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Fall/goh2013SINBADttt/goh2013SINBADttt.pdf},
	author = {Gabriel Goh and Michael P. Friedlander and Felix J. Herrmann}
}
@presentation {friedlander2012SINBADrsh,
	title = {Randomized sampling: How confident are you?},
	year = {2012},
	publisher = {SINBAD},
	abstract = {At last year{\textquoteright}s consortium meeting, I described an inexact gradient method and sampling scheme for data fitting. The randomization method has good convergence properties, at least as measured by the distance to the solution{\textendash}{\textendash}in expectation. But as one insightful critic rightly pointed out, we don{\textquoteright}t usually observe the expectation, at least not in a single run. In this talk I will characterize the convergence of the method in terms of bounds on the probability of being too far away from the solution.},
	keywords = {Presentation, SINBAD, SINBADFALL2012, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2012/Fall/friedlander2012SINBADrsh/friedlander2012SINBADrsh_pres.pdf},
	author = {Michael P. Friedlander}
}
@conference {vanleeuwen2011AMPhsdmwi,
	title = {A hybrid stocahstic-deterministic method for waveform inversion},
	booktitle = {AMP},
	year = {2011},
	note = {Presented at AMP Medical and Seismic Imaging, 2011, Vancouver BC},
	month = {07},
	publisher = {WAVES 2011},
	organization = {WAVES 2011},
	abstract = {A lot of seismic and medical imaging problems can be written as a least-squares data- fitting problem. In particular, we consider the case of multi-experiment data, where the data consists of a large number of "independent" measurements. Solving the inverse problem then involves repeatedly forward modeling the data for each of these experiments. In case the number of experiments is large and the modeling kernel expensive to apply, such an approach may be prohibitively expensive. We review techniques from stochastic optimization which aim at dramatically reducing the number of experiments that need to be modeled at each iteration. This reduction is typically achieved by randomly subsampling the data. Special care needs to be taken in the optimization to deal with the stochasticity that is introduced in this way.},
	keywords = {Presentation},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/ICIAM/2011/vanleeuwen2011AMPhsdmwi/vanleeuwen2011AMPhsdmwi.pdf},
	author = {Tristan van Leeuwen and Mark Schmidt and Michael P. Friedlander and Felix J. Herrmann}
}
@conference {vanleeuwen2011EAGEhsdomwi,
	title = {A hybrid stochastic-deterministic optimization method for waveform inversion},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2011},
	month = {05},
	abstract = {Present-day high quality 3D acquisition can give us lower frequencies and longer offsets with which to invert. However, the computational costs involved in handling this data explosion are tremendous. Therefore, recent developments in full-waveform inversion have been geared towards reducing the computational costs involved. A key aspect of several approaches that have been proposed is a dramatic reduction in the number of sources used in each iteration. A reduction in the number of sources directly translates to less PDE-solves and hence a lower computational cost. Recent attention has been drawn towards reducing the sources by randomly combining the sources in to a few supershots, but other strategies are also possible. In all cases, the full data misfit, which involves all the sequential sources, is replaced by a reduced misfit that is much cheaper to evaluate because it involves only a small number of sources (batchsize). The batchsize controls the accuracy with which the reduced misfit approximates the full misfit. The optimization of such an inaccurate, or noisy, misfit is the topic of stochastic optimization. In this paper, we propose an optimization strategy that borrows ideas from the field of stochastic optimization. The main idea is that in the early stage of the optimization, far from the true model, we do not need a very accurate misfit. The strategy consists of gradually increasing the batchsize as the iterations proceed. We test the proposed strategy on a synthetic dataset. We achieve a very reasonable inversion result at the cost of roughly 13 evaluations of the full misfit. We observe a speed-up of roughly a factor 20.},
	keywords = {EAGE, Full-waveform inversion, Optimization, Presentation},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2011/vanleeuwen11EAGEhsdomwi/vanleeuwen11EAGEhsdomwi.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2011/vanleeuwen11EAGEhsdomwi/vanleeuwen11EAGEhsdomwi_pres.pdf},
	url2 = {http://earthdoc.eage.org/publication/publicationdetails/?publication=50341},
	author = {Tristan van Leeuwen and Felix J. Herrmann and Mark Schmidt and Michael P. Friedlander}
}
@presentation {friedlander2011SINBADrir,
	title = {Robust inversion, data-fitting, and inexact gradient methods},
	year = {2011},
	publisher = {SINBAD},
	keywords = {Presentation, SINBAD, SINBADFALL2011, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2011/Fall/friedlander2011SINBADrir/friedlander2011SINBADrir_pres.pdf},
	author = {Michael P. Friedlander}
}
@presentation {friedlander2010SINBADaso,
	title = {Algorithms for sparse optimization},
	year = {2010},
	publisher = {SINBAD},
	keywords = {Presentation, SINBAD, SINBADFALL2010, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2010/Fall/friedlander2010SINBADaso/friedlander2010SINBADaso_pres.pdf},
	author = {Michael P. Friedlander}
}
@presentation {friedlander2010SINBADisl,
	title = {Introduction to Spot: a linear-operator toolbox},
	year = {2010},
	publisher = {SINBAD},
	keywords = {Presentation, SINBAD, SINBADFALL2010, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2010/Fall/friedlander2010SINBADisl/friedlander2010SINBADisl_pres.pdf},
	author = {Michael P. Friedlander}
}
@conference {friedlander2009SCAIMspot,
	title = {Spot: A linear-operator toolbox for Matlab},
	booktitle = {SCAIM},
	year = {2009},
	publisher = {SCAIM Seminar},
	organization = {SCAIM Seminar},
	address = {University of British Columbia},
	keywords = {minimization, Presentation, SLIM},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2009/VandenBerg-Mon-1130.pdf},
	author = {Ewout van den Berg and Michael P. Friedlander}
}
@conference {vandenberg2007SINBADipo1,
	title = {In pursuit of a root},
	booktitle = {2007 Von Neumann Symposium},
	year = {2007},
	keywords = {minimization, Presentation, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2007/vandenberg2007SINBADipo1/vandenberg2007SINBADipo1.pdf},
	author = {Ewout van den Berg and Michael P. Friedlander}
}
