@conference {fang2017AIPepm,
	title = {An efficient penalty method for PDE-constrained optimization problem with source estimation and stochastic optimization},
	booktitle = {Applied Inverse Problems Annual Conference Proceedings},
	year = {2017},
	note = {(AIP, Hangzhou)},
	month = {05-06},
	pages = {40},
	abstract = {Many inverse problems in applied science and engineering can be written as PDE-constrained optimization problems. Typically, one is interested in estimating the unknown medium parameters of the PDE describing the system, given multi-source measurements of the fields in the true medium. The objective function is often very oscillatory, which gives rise to problematic local minima, and merely evaluating one or more of its derivatives requires solving multiple PDEs, which are expensive. In many applications such as seismic exploration, only the source location is available and the source signature itself is unknown, which results in erroneous estimated parameters. In this work, we propose a penalty method to solve the PDE-constrained optimization problem, whereby we replace the PDE constraints by a two-norm penalty term, which leads to a bi-linear optimization problem with a much less oscillatory objective function. By applying the variable projection method, we develop an efficient method to invert the unknown parameters and source signatures simultaneously. To reduce the computational cost, we randomly select a subset of all data to update the parameters at each iteration. Numerical examples demonstrate that this method is less prone to becoming stuck in harmful local minima and is able to successfully invert the unknown parameters and source signature with less computational cost compared to using all the data.},
	keywords = {Optimization, penalty method, source estimation, Stochastic optimization},
	url = {http://aip2017.csp.escience.cn/dct/page/1},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/AIP/2017/fang2017AIPepm/fang2017AIPepm_pres.pdf},
	author = {Zhilong Fang and Curt Da Silva and Felix J. Herrmann}
}
@conference {fang2017WAVESuqf,
	title = {Uncertainty quantification for inverse problems with a weak wave-equation constraint},
	booktitle = {WAVES 2017 {\textendash}- 13th International Conference on Mathematical and Numerical Aspects of Wave Propagation},
	year = {2017},
	note = {(WAVES, Minneapolis)},
	month = {05},
	pages = {127-128},
	abstract = {In this work, we present a new posterior distribution to quantify uncertainties in solutions of wave-equation based inverse problems. By introducing an auxiliary variable for the wavefields, we weaken the strict wave-equation constraint used by conventional Bayesian approaches. With this weak constraint, the new posterior distribution is a bi-Gaussian distribution with respect to both model parameters and wavefields, which can be directly sampled by the Gibbs sampling method.},
	keywords = {constraint, Gibbs sampling, uncertainty, wave equation},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/WAVES/2017/fang2017WAVESuqf/fang2017WAVESuqf.html},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/WAVES/2017/fang2017WAVESuqf/fang2017WAVESuqf_pres.pdf},
	author = {Zhilong Fang and Curt Da Silva and Rachel Kuske and Felix J. Herrmann}
}
@conference {chai2016SEGlbm,
	title = {A linearized Bregman method for compressive waveform inversion},
	booktitle = {SEG Technical Program Expanded Abstracts},
	year = {2016},
	note = {(SEG, Dallas)},
	month = {10},
	pages = {1449-1454},
	abstract = {We present an implementation of a recently developed and relatively simple linearized Bregman method to solve the large-scale $\ell_1$-norm sparsity-promoting Gauss-Newton (GN) full-waveform inversion (FWI) problem. Numerical experiments demonstrate that: the much simpler linearized Bregman method does a comparable and even superior job compared to a state-of-the-art $\ell_1$-norm solver SPGL1, which is previously used in the modified Gauss-Newton FWI; the linearized Bregman method is also more efficient (faster) than SPGL1; the FWI result with the linearized Bregman method solving $\ell_1$-norm sparsity-promoting problems to get the model updates is better than that obtained by solving $\ell_2$-norm least-squares problems to get the model updates.},
	keywords = {Bregman method, SEG, waveform inversion},
	doi = {10.1190/segam2016-13848105.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2016/chai2016SEGlbm/chai2016SEGlbm.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2016/chai2016SEGlbm/chai2016SEGlbm_pres.pdf},
	author = {Xintao Chai and Mengmeng Yang and Philipp A. Witte and Rongrong Wang and Zhilong Fang and Felix J. Herrmann}
}
@conference {yang2016SEGtds,
	title = {Time-domain sparsity-promoting least-squares migration with source estimation},
	booktitle = {SEG Technical Program Expanded Abstracts},
	year = {2016},
	note = {(SEG, Dallas)},
	month = {10},
	pages = {4225-4229},
	abstract = {Traditional reverse-time migration (RTM) gives images with wrong amplitudes and low resolution. Least-squares RTM (LS-RTM) on the other hand, is capable of obtaining true-amplitude images as solutions of $\ell_2$-norm norm minimization problems by fitting the synthetic and observed reflection data. The shortcoming of this approach is that solutions of these $\ell_2$ problems are typically smoothed, tend to be overfitted, and computationally too expensive because it requires compared to standard RTM too many iterations. By working with randomized subsets of data only, the computational costs of LS-RTM can be brought down to an acceptable level while producing artifact-free high-resolution images without overfitting the data. While initial results of these "compressive imaging" methods were encouraging various open issues remain including guaranteed convergence, algorithmic complexity of the solver, and lack of on-the-fly source estimation for LS-RTMs with wave-equation solvers based on time-stepping. By including on-the-fly source-time function estimation into the method of Linearized Bregman (LB), on which we reported before, we tackle all these issues resulting in a easy-to-implement algorithm that offers flexibility in the trade-off between the number of iterations and the number of wave-equation solves per iteration for a fixed total number of wave-equation solves. Application of our algorithm on a 2D synthetic shows that we are able to obtain high-resolution images, including accurate estimates of the wavelet, for a single pass through the data. The produced image, which is by virtue of the inversion deconvolved with respect to the wavelet, is roughly of the same quality as the image obtained given the correct source function.},
	keywords = {least squares, RTM, SEG, source estimation, time domain},
	doi = {10.1190/segam2016-13850609.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2016/yang2016SEGtds/yang2016SEGtds.html},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2016/yang2016SEGtds/yang2016SEGtds_pres.pdf},
	author = {Mengmeng Yang and Philipp A. Witte and Zhilong Fang and Felix J. Herrmann}
}
@conference {fang2016SEGuqw,
	title = {Uncertainty quantification for Wavefield Reconstruction Inversion using a PDE free semidefinite Hessian and randomize-then-optimize method},
	booktitle = {SEG Technical Program Expanded Abstracts},
	year = {2016},
	note = {(SEG, Dallas)},
	month = {10},
	pages = {1390-1394},
	abstract = {The data of full-waveform inversion often contains noise, which induces uncertainties in the inversion results. Ideally, one would like to run a number of independent inversions with different realizations of the noise and assess model-side uncertainties from the resulting models, however this is not feasible because we collect the data only once. To circumvent this restriction, various sampling schemes have been devised to generate an ensemble of models that fit the data to within the noise level. Such sampling schemes typically involve running multiple inversions or evaluating the Hessian of the cost function, both of which are computationally expensive. In this work, we propose a new method to quantify uncertainties based on a novel formulation of the full-waveform inversion problem {\textendash} wavefield reconstruction inversion. Based on this formulation, we formulate a semidefinite approximation of the corresponding Hessian matrix. By precomputing certain quantities, we are able to apply this Hessian to given input vectors without additional solutions of the underlying partial differential equations. To generate a sample, we solve an auxiliary stochastic optimization problem involving this Hessian. The result is a computationally feasible method that, with little overhead, can generate as many samples as required at small additional cost. We test our method on the synthetic BG Compass model and compare the results to a direct-sampling approach. The results show the feasibility of applying our method to computing statistical quantities such as the mean and standard deviation in the context of wavefield reconstruction inversion.},
	keywords = {SEG, Uncertainty quantification, WRI},
	doi = {10.1190/segam2016-13879108.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2016/fang2016SEGuqw/fang2016SEGuqw.html},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2016/fang2016SEGuqw/fang2016SEGuqw_pres.pdf},
	author = {Zhilong Fang and Chia Ying Lee and Curt Da Silva and Tristan van Leeuwen and Felix J. Herrmann}
}
@conference {fang2015EAGEsew,
	title = {Source estimation for Wavefield Reconstruction Inversion},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2015},
	note = {(EAGE, Madrid)},
	month = {06},
	abstract = {Wavefield reconstruction inversion is a new approach to waveform based inversion that helps overcome the {\textquoteleft}cycle skipping{\textquoteright} problem. However, like most waveform based inversion methods, wavefield reconstruction inversion also requires good source wavelets. Without correct source wavelets, wavefields cannot be reconstructed correctly and the velocity model cannot be updated correctly neither. In this work, we propose a source estimation method for wavefield reconstruction inversion based on the variable projection method. In this method, we reconstruct wavefields and estimate source wavelets simultaneously by solving an extended least-squares problem, which contains source wavelets. This approach does not increase the computational cost compared to conventional wavefield reconstruction inversion. Numerical results illustrates with our source estimation method we are able to recover source wavelets and obtain inversion results that are comparable to results obtained with true source wavelets.},
	keywords = {EAGE, source estimation, WRI},
	doi = {10.3997/2214-4609.201412588},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2015/fang2015EAGEsew/fang2015EAGEsew.html},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2015/fang2015EAGEsew/fang2015EAGEsew_pres.pdf},
	author = {Zhilong Fang and Felix J. Herrmann}
}
@conference {fang2015IIPFWIsoa,
	title = {Stochastic optimization and its application to seismic inversion},
	booktitle = {Inaugural Full-Waveform Inversion Workshop},
	year = {2015},
	note = {(Natal, Brazil)},
	month = {08-09},
	keywords = {FWI, inversion, Optimization, stochastic},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/IIPFWI/fang2015IIPFWIsoa/fang2015IIPFWIsoa_pres.pdf},
	author = {Zhilong Fang and Tim Burgess and Felix J. Herrmann}
}
@conference {fang2015IIPFWIuqw,
	title = {Uncertainty quantification for Wavefield Reconstruction Inversion},
	booktitle = {Inaugural Full-Waveform Inversion Workshop},
	year = {2015},
	note = {(Natal, Brazil)},
	month = {08-09},
	abstract = {In this work, we propose a method to quantify the uncertainty of wavefield reconstruction inversion under the framework of Bayesian inference. Unlike the conventional method using the wave equation as the forward mapping, we involve the wave equation misfit in the posterior distribution and propose a new posterior distribution. The negative log-likelihood of the new distribution is less oscillatory than that of the conventional posterior distribution, and its Gauss-Newton Hessian is a diagonal matrix that can be generated without any additional computational cost. We use the diagonal Gauss-Newton Hessian to derive an approximate Gaussian distribution at the maximum likelihood point to quantify the uncertainty. This method makes the uncertainty quantification for WRI computationally tractable and is able to provide reasonable uncertainty analysis based on our numerical results.},
	keywords = {FWI, uncertainty, WRI},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/IIPFWI/fang2015IIPFWIuqw/fang2015IIPFWIuqw_pres.pdf},
	author = {Zhilong Fang and Chia Ying Lee and Curt Da Silva and Felix J. Herrmann and Rachel Kuske}
}
@conference {fang2015EAGEuqw,
	title = {Uncertainty quantification for Wavefield Reconstruction Inversion},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2015},
	note = {(EAGE, Madrid)},
	month = {06},
	abstract = {In this work, we propose a method to quantify the uncertainty of wavefield reconstruction inversion under the framework of Bayesian inference. Unlike the conventional method using the wave equation as the forward mapping, we involve the wave equation misfit in the posterior distribution and propose a new posterior distribution. The negative log-likelihood of the new distribution is less oscillatory than that of the conventional posterior distribution, and its Gauss-Newton Hessian is a diagonal matrix that can be generated without any additional computational cost. We use the diagonal Gauss-Newton Hessian to derive an approximate Gaussian distribution at the maximum likelihood point to quantify the uncertainty. This method makes the uncertainty quantification for WRI computationally tractable and is able to provide reasonable uncertainty analysis based on our numerical results.},
	keywords = {EAGE, FWI, UQ, WRI},
	doi = {10.3997/2214-4609.201413198},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2015/fang2015EAGEuqw/fang2015EAGEuqw.html},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2015/fang2015EAGEuqw/fang2015EAGEuqw_pres.pdf},
	author = {Zhilong Fang and Chia Ying Lee and Curt Da Silva and Felix J. Herrmann and Rachel Kuske}
}
@conference {fang2015IIPFWIwri,
	title = {Wavefield Reconstruction Inversion with source estimation and its application to 2014 Chevron synthetic blind test dataset},
	booktitle = {Inaugural Full-Waveform Inversion Workshop},
	year = {2015},
	note = {(Natal, Brazil)},
	month = {08-09},
	abstract = {We present a robust wavefield reconstruction inversion with source estimation. The source wavelet is estimated with the reconstruction of wavefield simultaneously by solving an extended data augmentation problem. We apply this method to the 2014 Chevron synthetic blind test dataset and show the robustness of our method.},
	keywords = {FWI, source estimation, WRI},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/IIPFWI/fang2015IIPFWIwri/fang2015IIPFWIwri_pres.pdf},
	author = {Zhilong Fang and Felix J. Herrmann}
}
@conference {lago2014CMCCRMN,
	title = {CRMN method for solving time-harmonic wave equation},
	booktitle = {Copper Mountain Conference},
	year = {2014},
	note = {(Copper Mountain)},
	month = {04},
	abstract = {We address the solution of PDEs associated with the wave propagation phenomena in heterogeneous media using CGMN method. It consists of a conjugate gradients method using Kaczmarz double sweeps as preconditioner. This preconditioner has the property of {\textquoteleft}{\textquoteleft}symmetrizing" the problem allowing short recursion and Lanczos type of Krylov methods to be employed. In this talk we propose the use of CR, a minimal residual Krylov method closely related to CG. We study the proposed method which we call CRMN and discuss crucial aspects as the behaviour of the norm of the residual and the norm of the true error. We also discuss the result of an inversion of a small subsample of the 3D velocity model SEG/EAGE Overthrust using frugal full-waveform inversion method with CRMN and CGMN for solving the associated PDE, showing a strong interest in studying the behaviour of CRMN for larger realistic cases.},
	keywords = {CGMN, CRMN, Forward Modelling, Helmholtz equation},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/CMC/2014/lago2014CMCCRMN.pdf},
	author = {Rafael Lago and Art Petrenko and Zhilong Fang and Felix J. Herrmann}
}
@conference {lago2014EAGEfst,
	title = {Fast solution of time-harmonic wave-equation for full-waveform inversion},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2014},
	month = {06},
	abstract = {For many full-waveform inversion techniques, the most computationally intensive step is the computation of a numerical solution for the wave equation on every iteration. In the frequency domain approach, this requires the solution of very large, complex, sparse, ill-conditioned linear systems. In this extended abstract we bring out attention specifically to CGMN method for solving PDEs, known for being flexible (i.e. it is able to treat equally acoustic data as well as visco-elastic or more complex scenarios) efficient with respect both to memory and computation time, and controllable accuracy of the final approximation. We propose an improvement for the known CGMN method by imposing a minimal residual condition, which incurs in one extra model vector storage. The resulting algorithm called CRMN enjoys several interesting properties as monotonically nonincreasing behaviour of the norm of the residual and minimal residual, guaranteeing optimal convergence for the relative residual criterion. We discuss numerical experiments both in an isolated PDE solve and also within the inversion procedure, showing that in a realistic scenario we can expect a speedup around 25\% when using CRMN rather than CGMN.},
	keywords = {CGMN, CRMN, EAGE, FWI, Time-Harmonic Wave Equation},
	doi = {10.3997/2214-4609.20140812},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2014/lago2014EAGEfst/lago2014EAGEfst.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2014/lago2014EAGEfst/lago2014EAGEfst_pres.pdf},
	author = {Rafael Lago and Art Petrenko and Zhilong Fang and Felix J. Herrmann}
}
@conference {fang2014EAGEfuq,
	title = {Fast uncertainty quantification for 2D full-waveform inversion with randomized source subsampling},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2014},
	month = {06},
	abstract = {Uncertainties arise in every area of seismic exploration, especially in full-waveform inversion, which is highly non-linear. In the framework of Bayesian inference, uncertainties can be analyzed by sampling the posterior probability density distribution with a Markov chain Monte-Carlo (McMC) method. We reduce the cost of computing the posterior distribution by working with randomized subsets of sources. These approximations, together with the Gaussian assumption and approximation of the Hessian, leads to a computational tractable uncertainty quantification. Application of this approach to a synthetic leads to standard deviations and confidence intervals that are qualitatively consistent with our expectations.},
	keywords = {EAGE, FWI, Markov chain Monte Carlo, randomized sources subsampling, Uncertainty quantification},
	doi = {10.3997/2214-4609.20140715},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2014/fang2014EAGEfuq/fang2014EAGEfuq.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2014/fang2014EAGEfuq/fang2014EAGEfuq_pres.pdf},
	author = {Zhilong Fang and Curt Da Silva and Felix J. Herrmann}
}
@conference {aravkin2012ICASSProbustb,
	title = {Robust inversion via semistochastic dimensionality reduction},
	booktitle = {ICASSP},
	year = {2012},
	pages = {5245-5248},
	publisher = {ICASSP},
	organization = {ICASSP},
	abstract = {We consider a class of inverse problems where it is possible to aggregate the results of multiple experiments. This class includes problems where the forward model is the solution operator to linear ODEs or PDEs. The tremendous size of such problems motivates the use dimensionality reduction (DR) techniques based on randomly mixing experiments. These techniques break down, however, when robust data-fitting formulations are used, which are essential in cases of missing data, unusually large errors, and systematic features in the data unexplained by the forward model. We survey robust methods within a statistical framework, and propose a sampling optimization approach that allows DR. The efficacy of the methods are demonstrated for a large-scale seismic inverse problem using the robust Student{\textquoteright}s t-distribution, where a useful synthetic velocity model is recovered in the extreme scenario of 60\% corrupted data. The sampling approach achieves this recovery using 20\% of the effort required by a direct robust approach.},
	keywords = {ICASSP},
	doi = {10.1109/ICASSP.2012.6289103},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/ICASSP/2012/AravkinFriedlanderLeeuwen/AravkinFriedlanderLeeuwen.pdf},
	author = {Aleksandr Y. Aravkin and Michael P. Friedlander and Tristan van Leeuwen}
}
@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}
}
@conference {frijlink2010EAGEcos,
	title = {Comparison of standard adaptive subtraction and primary-multiple separation in the curvelet domain},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2010},
	month = {06},
	abstract = {In recent years, data-driven multiple prediction methods and wavefield extrapolation methods have proven to be powerful methods to attenuate multiples from data acquired in complex 3-D geologic environments. These methods make use of a two-stage approach, where first the multiples (surface-related and / or internal) multiples are predicted before they are subtracted from the original input data in an adaptively. The quality of these predicted multiples often raises high expectations for the adaptive subtraction techniques, but for various reasons these expectations are not always met in practice. Standard adaptive subtraction methods use the well-known minimum energy criterion, stating that the total energy after optimal multiple attenuation should be minimal. When primaries and multiples interfere, the minimum energy criterion is no longer appropriate. Also, when multiples of different orders interfere, adaptive energy minimization will lead to a compromise between different amplitudes corrections for the different orders of multiples. This paper investigates the performance of two multiple subtraction schemes for a real data set that exhibits both interference problems. Results from an adaptive subtraction in the real curvelet domain, separating primaries and multiples, are compared to those obtained using a more conventional adaptive subtraction method in the spatial domain.},
	keywords = {EAGE},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2010/frijlink10EAGEcos/frijlink10EAGEcos.pdf},
	url2 = {http://earthdoc.eage.org/publication/publicationdetails/?publication=39875},
	author = {M. O. Frijlink and Reza Shahidi and Felix J. Herrmann and R. G. van Borselen}
}
@conference {friedlander2009NUalssr,
	title = {Algorithms for large-scale sparse reconstruction},
	booktitle = {IEMS},
	year = {2009},
	publisher = {IEMS Colloquim Speaker},
	organization = {IEMS Colloquim Speaker},
	address = {Northwestern University},
	keywords = {minimization, SLIM},
	author = {Michael P. Friedlander}
}
@conference {friedlander2009VIETcsgpa,
	title = {Computing sparse and group-sparse approximations},
	booktitle = {VIET},
	year = {2009},
	publisher = {2009 High Performance Scientific Computing Conference},
	organization = {2009 High Performance Scientific Computing Conference},
	address = {Hanoi, Vietnam},
	keywords = {minimization, SLIM},
	author = {Michael P. Friedlander}
}
@conference {vandenberg2009SLIMocf,
	title = {Optimizing costly functions with simple constraints: a limited-memory projected Quasi-Newton algorithm},
	booktitle = {SLIM},
	series = {Twelfth International Conference on Artificial Intelligence and Statistics},
	volume = {12},
	year = {2009},
	month = {04},
	abstract = {An optimization algorithm for minimizing a smooth function over a convex set is described. Each iteration of the method computes a descent direction by minimizing, over the original constraints, a diagonal-plus low-rank quadratic approximation to the function. The quadratic approximation is constructed using a limited-memory quasi-Newton update. The method is suitable for large-scale problems where evaluation of the function is substan- tially more expensive than projection onto the constraint set. Numerical experiments on one-norm regularized test problems indicate that the proposed method is competitve with state-of-the-art methods such as bound-constrained L-BFGS and orthant-wise descent. We further show that the method generalizes to a wide class of problems, and substantially improves on state-of-the-art methods for problems such as learning the structure of Gaussian graphi- cal models (involving positive-definite matrix constraints) and Markov random fields (involving second-order cone constraints).},
	keywords = {SLIM},
	url = {http://www.cs.ubc.ca/ mpf/papers/SchmidtBergFriedMurph09.pdf},
	author = {Ewout van den Berg and Mark Schmidt and Michael P. Friedlander and K. Murphy}
}
@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 {friedlander2008SIAMasa,
	title = {Active-set approaches to basis pursuit denoising},
	booktitle = {SIAM Optimization},
	year = {2008},
	month = {05},
	publisher = {SIAM Optimization},
	organization = {SIAM Optimization},
	keywords = {SLIM},
	url = {http://www.cs.ubc.ca/ mpf/public/mpf08siopt.pdf},
	author = {Michael P. Friedlander}
}
@conference {friedlander2008WCOMasm,
	title = {Active-set methods for basis pursuit},
	booktitle = {WCOM},
	year = {2008},
	month = {07},
	publisher = {West Coast Opitmization Meeting (WCOM)},
	organization = {West Coast Opitmization Meeting (WCOM)},
	abstract = {Many imaging and compressed sensing applications seek sparse solutions to large under-determined least-squares problems. The basis pursuit (BP) approach minimizes the 1-norm of the solution, and the BP denoising (BPDN) approach balances it against the least-squares fit. The duals of these problems are conventional linear and quadratic programs. We introduce a modified parameterization of the BPDN problem and explore the effectiveness of active-set methods for solving its dual. Our basic algorithm for the BP dual unifies several existing algorithms and is applicable to large-scale examples.},
	url = {http://www.cs.ubc.ca/ mpf/public/mpf08siopt.pdf},
	author = {Michael P. Friedlander and M. A. Saunders}
}
@conference {friedlander2008SINBADafl,
	title = {Algorithms for large-scale sparse reconstruction},
	booktitle = {SINBAD 2008},
	year = {2008},
	abstract = {Many signal processing applications seek to approximate a signal as a linear combination of only a few elementary atoms drawn from a large collection. This is known as sparse reconstruction, and the theory of compressed sensing allows us to pose it as a structured convex optimization problem. I will discuss the role of duality in revealing some unexpected and useful properties of these problems, and will show how they can lead to practical, large-scale algorithms. I will also describe some applications of these algorithms.},
	keywords = {SINBAD, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2008/friedlander2008SINBADafl/friedlander2008SINBADafl.pdf},
	author = {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}
}
@conference {vandenberg07VONipo,
	title = {In pursuit of a root},
	year = {2007},
	month = {07},
	publisher = {Von Neumann Symposium},
	organization = {Von Neumann Symposium},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/vonNeuman/2007/vandenberg07VONipo/vandenberg07VONipo.pdf},
	author = {Ewout van den Berg and Michael P. Friedlander}
}
@conference {fomel2007ICASSPrepro,
	title = {Reproducible computational experiments using scons},
	booktitle = {ICASSP},
	year = {2007},
	publisher = {ICASSP},
	organization = {ICASSP},
	abstract = {SCons (from Software Construction) is a well-known open- source program designed primarily for building software. In this paper, we describe our method of extending SCons for managing data processing flows and reproducible computational experiments. We demonstrate our usage of SCons with a simple example.},
	keywords = {ICASSP},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/ICASSP/2007/fomel07ICASSPrepro/fomel07ICASSPrepro.pdf},
	author = {Sergey Fomel and Gilles Hennenfent}
}
