@presentation {li2023ML4SEISMICmci,
	title = {Maximizing CO2 injectivity within fracture pressure},
	year = {2023},
	month = {11},
	abstract = {In geological carbon storage projects, optimizing CO2 injection strategies is paramount to enhance storage efficiency and prevent leakage. The objective is to maximize the CO2 injection volume without surpassing the fracture pressure. Traditional adjoint-based approaches necessitate extensive numerical simulations, leading to significant computational overhead. To circumvent this challenge, we introduce an optimization framework based on physics-informed deep convolutional neural networks. Trained on different permeability slices, our model can rapidly predict the maximal CO2 injection volume for new permeability fields in real-time.},
	keywords = {CCS, ML4SEISMIC, Optimization, reservoir simulation, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/ML4SEISMIC/2023/li2023ML4SEISMICmci},
	author = {Haoyun Li and Ziyi Yin and Olav M{\o}yner and Felix J. Herrmann}
}
@mastersthesis {peters2019THiso,
	title = {Intersections and sums of sets for the regularization of inverse problems},
	year = {2019},
	note = {(PhD)},
	month = {05},
	school = {The University of British Columbia},
	type = {phd},
	address = {Vancouver},
	abstract = {Inverse problems in the imaging sciences encompass a variety of applications. The primary problem of interest is the identification of physical parameters from observed data that come from experiments governed by partial-differential-equations. The secondary type of imaging problems attempts to reconstruct images and video that are corrupted by, for example, noise, subsampling, blur, or saturation. The quality of the solution of an inverse problem is sensitive to issues such as noise and missing entries in the data. The non-convex seismic full-waveform inversion problem suffers from parasitic local minima that lead to wrong solutions that may look realistic even for noiseless data. To meet some of these challenges, I propose solution strategies that constrain the model parameters at every iteration to help guide the inversion. To arrive at this goal, I present new practical workflows, algorithms, and software, that avoid manual tuning-parameters and that allow us to incorporate multiple pieces of prior knowledge. Opposed to penalty methods, I avoid balancing the influence of multiple pieces of prior knowledge by working with intersections of constraint sets. I explore and present advantages of constraints for imaging. Because the resulting problems are often non-trivial to solve, especially on large 3D grids, I introduce faster algorithms, dedicated to computing projections onto intersections of multiple sets. To connect prior knowledge more directly to problem formulations, I also combine ideas from additive models, such as cartoon-texture decomposition and robust principal component analysis, with intersections of multiple constraint sets for the regularization of inverse problems. The result is an extension of the concept of a Minkowski set. Examples from non-unique physical parameter estimation problems show that constraints in combination with projection methods provide control over the model properties at every iteration. This can lead to improved results when the constraints are carefully relaxed.},
	keywords = {FWI, Optimization, PhD, regularization, Sets},
	url = {https://slim.gatech.edu/Publications/Public/Thesis/2019/peters2019THiso/peters2019THiso.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Thesis/2019/peters2019THiso/peters2019THiso_pres.pdf},
	author = {Bas Peters}
}
@article {dasilva2017uls,
	title = {A unified 2D/3D large scale software environment for nonlinear inverse problems},
	journal = {ACM Transactions on Mathematical Software},
	year = {2019},
	note = {Accepted on January 27, 2019.},
	abstract = {Large scale parameter estimation problems are some of the most computationally demanding problems. An academic researcher{\textquoteright}s domain-specific knowledge often precludes that of software design, which results in software frameworks for inversion that are technically correct, but not scalable to realistically-sized problems. On the other hand, the computational demands of the problem for realistic problems result in industrial codebases that are geared solely for performance, rather than comprehensibility or flexibility. We propose a new software design that bridges the gap between these two seemingly disparate worlds. A hierarchical and modular design allows a user to delve into as much detail as she desires, while using high performance primitives at the lower levels. Our code has the added benefit of actually reflecting the underlying mathematics of the problem, which lowers the cognitive load on user using it and reduces the initial startup period before a researcher can be fully productive. We also introduce a new preconditioner for the Helmholtz equation that is suitable for fault-tolerant distributed systems. Numerical experiments on a variety of 2D and 3D test problems demonstrate the effectiveness of this approach on scaling algorithms from small to large scale problems with minimal code changes.},
	keywords = {large scale, Matlab, Optimization, PDE-constrained inversion},
	url = {https://slim.gatech.edu/Publications/Public/Journals/ACMTOMS/2019/dasilva2017uls/dasilva2017uls.html},
	author = {Curt Da Silva and Felix J. Herrmann}
}
@article {peters2018pmf,
	title = {Projection methods and applications for seismic nonlinear inverse problems with multiple constraints},
	journal = {Geophysics},
	volume = {84},
	number = {2},
	year = {2018},
	note = {(Geophysics)},
	month = {02},
	pages = {R251-R269},
	abstract = {Nonlinear inverse problems are often hampered by non-uniqueness and local minima because of missing low frequencies and far offsets in the data, lack of access to good starting models, noise, and modeling errors. A well-known approach to counter these deficiencies is to include prior information on the unknown model, which regularizes the inverse problem. While conventional regularization methods have resulted in enormous progress in ill-posed (geophysical) inverse problems, challenges remain when the prior information consists of multiple pieces. To handle this situation, we propose an optimization framework that allows us to add multiple pieces of prior information in the form of constraints. Compared to additive regularization penalties, constraints have a number of advantages making them more suitable for inverse problems such as full-waveform inversion. The proposed framework is rigorous because it offers assurances that multiple constraints are imposed uniquely at each iteration, irrespective of the order in which they are invoked. To project onto the intersection of multiple sets uniquely, we employ Dykstra{\textquoteright}s algorithm that scales to large problems and does not rely on trade-off parameters. In that sense, our approach differs substantially from approaches such as Tikhonov regularization, penalty methods, and gradient filtering. None of these offer assurances, which makes them less suitable to full-waveform inversion where unrealistic intermediate results effectively derail the iterative inversion process. By working with intersections of sets, we keep expensive objective and gradient calculations unaltered, separate from projections, and we also avoid trade-off parameters. These features allow for easy integration into existing code bases. In addition to more predictable behavior, working with constraints also allows for heuristics where we built up the complexity of the model gradually by relaxing the constraints. This strategy helps to avoid convergence to local minima that represent unrealistic models. We illustrate this unique feature with examples of varying complexity.},
	keywords = {constraints, Full-waveform inversion, intersection, Optimization, projection, regularization},
	doi = {10.1190/geo2018-0192.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2018/peters2018pmf/peters2018pmf.html},
	author = {Bas Peters and Brendan R. Smithyman and Felix J. Herrmann}
}
@article {liu2018ssi,
	title = {Simultaneous-shot inversion for PDE-constrained optimization problems with missing data},
	journal = {Inverse Problems},
	volume = {35},
	number = {2},
	year = {2018},
	note = {(Inverse Problems)},
	pages = {025003},
	abstract = {Stochastic optimization is key to efficient inversion in PDE-constrained optimization. Using {\textquoteleft}simultaneous shots{\textquoteright}, or random superposition of source terms, works very well in simple acquisition geometries where all sources see all receivers, but this rarely occurs in practice. We develop an approach that interpolates data to an ideal acquisition geometry while solving the inverse problem using simultaneous shots. The approach is formulated as a joint inverse problem, combining ideas from low-rank interpolation with full-waveform inversion. Results using synthetic experiments illustrate the flexibility and efficiency of the approach.},
	keywords = {Full-waveform inversion, low-rank interpolation, Optimization},
	doi = {10.1088/1361-6420/aaf317},
	url = {https://slim.gatech.edu/Publications/Public/Journals/InverseProblems/2018/liu2018ssi/liu2018ssi.pdf},
	author = {Michelle Liu and Rajiv Kumar and Eldad Haber and Aleksandr Y. Aravkin}
}
@article {peters2016cvp,
	title = {Constraints versus penalties for edge-preserving full-waveform inversion},
	journal = {The Leading Edge},
	volume = {36},
	number = {1},
	year = {2017},
	note = {(The Leading Edge)},
	month = {01},
	pages = {94-100},
	abstract = {Full-waveform inversion is challenging in complex geologic areas. Even when provided with an accurate starting model, the inversion algorithms often struggle to update the velocity model. Compared with other areas in applied geophysics, including prior information in full-waveform inversion is still in its relative infancy. In part, this is due to the fact that it is difficult to incorporate prior information that relates to geologic settings where strong discontinuities in the velocity model dominate, because these settings call for nonsmooth regularizations. We tackle this problem by including constraints on the spatial variations and value ranges of the inverted velocities, as opposed to adding penalties to the objective, which is more customary in mainstream geophysical inversion. By demonstrating the lack of predictability of edge-preserving inversion when the regularization is in the form of an added penalty term, we advocate the inclusion of constraints instead. Our examples show that the latter leads to more predictable results and to significant improvements in the delineation of salt bodies when these constraints are relaxed gradually in combination with extending the search space to approximately fit the observed data but not the noise.},
	keywords = {algorithm, full waveform inversion, noise, Optimization, penalty methods, salt dome, total variation},
	doi = {10.1190/tle36010094.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/TheLeadingEdge/2016/peters2016cvp/peters2016cvp.html},
	author = {Bas Peters and Felix J. Herrmann}
}
@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}
}
@mastersthesis {dasilva2017THlso,
	title = {Large-scale optimization algorithms for missing data completion and inverse problems},
	year = {2017},
	note = {(PhD)},
	month = {09},
	school = {The University of British Columbia},
	type = {phd},
	address = {Vancouver},
	abstract = {Inverse problems are an important class of problems found in many areas of science and engineering. In these problems, one aims to estimate unknown parameters of a physical system through indirect multi-experiment measurements. Inverse problems arise in a number of fields including seismology, medical imaging, and astronomy, among others. An important aspect of inverse problems is the quality of the acquired data itself. Real-world data acquisition restrictions, such as time and budget constraints, often results in measured data with missing entries. Many inversion algorithms assume that the input data is fully sampled and relatively noise free and produce poor results when these assumptions are violated. Given the multidimensional nature of real-world data, we propose a new low-rank optimization method on the smooth manifold of Hierarchical Tucker tensors. Tensors that exhibit this low-rank structure can be recovered from solving this non-convex program in an efficient manner. We successfully interpolate realistically sized seismic data volumes using this approach. If our low-rank tensor is corrupted with non-Gaussian noise, the resulting optimization program can be formulated as a convex-composite problem. This class of problems involves minimizing a non-smooth but convex objective composed with a nonlinear smooth mapping. In this thesis, we develop a level set method for solving composite-convex problems and prove that the resulting subproblems converge linearly. We demonstrate that this method is competitive when applied to examples in noisy tensor completion, analysis-based compressed sensing, audio declipping, total-variation deblurring and denoising, and one-bit compressed sensing. With respect to solving the inverse problem itself, we introduce a new software design framework that manages the cognitive complexity of the various components involved. Our framework is modular by design, which enables us to easily integrate and replace components such as linear solvers, finite difference stencils, preconditioners, and parallelization schemes. As a result, a researcher using this framework can formulate her algorithms with respect to high-level components such as objective functions and hessian operators. We showcase the ease with which one can prototype such algorithms in a 2D test problem and, with little code modification, apply the same method to large-scale 3D problems.},
	keywords = {convex composite, interpolation, low-rank, Optimization, PhD, software design, tensor, tensor completion},
	url = {https://slim.gatech.edu/Publications/Public/Thesis/2017/dasilva2017THlso/dasilva2017THlso.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Thesis/2017/dasilva2017THlso/dasilva2017THlso_pres.pdf},
	author = {Curt Da Silva}
}
@article {wason2016GEOPctl,
	title = {Low-cost time-lapse seismic with distributed compressive sensing{\textendash}-Part 2: impact on repeatability},
	journal = {Geophysics},
	volume = {82},
	number = {3},
	year = {2017},
	note = {(Geophysics)},
	month = {05},
	pages = {P15-P30},
	abstract = {Irregular or off-the-grid spatial sampling of sources and receivers is inevitable in field seismic acquisitions. Consequently, time-lapse surveys become particularly expensive since current practices aim to replicate densely sampled surveys for monitoring changes occurring in the reservoir due to hydrocarbon production. We demonstrate that under certain circumstances, high-quality prestack data can be obtained from cheap randomized subsampled measurements that are observed from nonreplicated surveys. We extend our time-jittered marine acquisition to time-lapse surveys by designing acquisition on irregular spatial grids that render simultaneous, subsampled and irregular measurements. Using the fact that different time-lapse data share information and that nonreplicated surveys add information when prestack data are recovered jointly, we recover periodic densely sampled and colocated prestack data by adapting the recovery method to incorporate a regularization operator that maps traces from an irregular spatial grid to a regular periodic grid. The recovery method is, therefore, a combined operation of regularization, interpolation (estimating missing fine-grid traces from subsampled coarse-grid data), and source separation (unraveling overlapping shot records). By relaxing the insistence on replicability between surveys, we find that recovery of the time-lapse difference shows little variability for realistic field scenarios of slightly nonreplicated surveys that suffer from unavoidable natural deviations in spatial sampling of shots (or receivers) and pragmatic compressed-sensing based nonreplicated surveys when compared to the "ideal" scenario of exact replicability between surveys. Moreover, the recovered densely sampled prestack baseline and monitor data improve significantly when the acquisitions are not replicated, and hence can serve as input to extract poststack attributes used to compute time-lapse differences. Our observations are based on experiments conducted for an ocean-bottom cable survey acquired with time-jittered continuous recording assuming source equalization (or same source signature) for the time-lapse surveys and no changes in wave heights, water column velocities or temperature and salinity profiles, etc.},
	keywords = {joint recovery method, Marine acquisition, off-the-grid recovery, Optimization, random sampling, time-lapse seismic},
	doi = {10.1190/geo2016-0252.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2017/wason2016GEOPctl/wason2016GEOPctl.html},
	author = {Haneet Wason and Felix Oghenekohwo and Felix J. Herrmann}
}
@mastersthesis {wason2017THsss,
	title = {Simultaneous-source seismic data acquisition and processing with compressive sensing},
	year = {2017},
	note = {(PhD)},
	month = {08},
	school = {The University of British Columbia},
	type = {phd},
	address = {Vancouver},
	abstract = {The work in this thesis adapts ideas from the field of compressive sensing (CS) that lead to new insights into acquiring and processing seismic data, where we can fundamentally rethink how we design seismic acquisition surveys and process acquired data to minimize acquisition- and processing-related costs. Current efforts towards dense source/receiver sampling and full azimuthal coverage to produce high-resolution images of the subsurface have led to the deployment of multiple sources across survey areas. A step ahead from multisource acquisition is simultaneous-source acquisition, where multiple sources fire shots at near-simultaneous/random times resulting in overlapping shot records, in comparison to no overlaps during conventional sequential-source acquisition. Adoption of simultaneous-source techniques has helped to improve survey efficiency and data density. The engine that drives simultaneous-source technology is simultaneous-source separation {\textendash}- a methodology that aims to recover conventional sequential-source data from simultaneous-source data. This is essential because many seismic processing techniques rely on dense and periodic (or regular) source/receiver sampling. We address the challenge of source separation through a combination of tailored simultaneous-source acquisition design and sparsity-promoting recovery via convex optimization using l1 objectives. We use CS metrics to investigate the relationship between marine simultaneous-source acquisition design and data reconstruction fidelity, and consequently assert the importance of randomness in the acquisition system in combination with an appropriate choice for a sparsifying transform (i.e., curvelet transform) in the reconstruction algorithm. We also address the challenge of minimizing the cost of expensive, dense, periodically-sampled and replicated time-lapse surveying and data processing by adapting ideas from distributed compressive sensing. We show that compressive randomized time-lapse surveys need not be replicated to attain acceptable levels of data repeatability, as long as we know the shot positions (post acquisition) to a sufficient degree of accuracy. We conclude by comparing sparsity-promoting and rank-minimization recovery techniques for marine simultaneous-source separation, and demonstrate that recoveries are comparable; however, the latter approach readily scales to large-scale seismic data and is computationally faster.},
	keywords = {Acquisition, Compressive Sensing, marine, Optimization, PhD, simultaneous source, source separation},
	url = {https://slim.gatech.edu/Publications/Public/Thesis/2017/wason2017THsss/wason2017THsss.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Thesis/2017/wason2017THsss/wason2017THsss_pres.pdf},
	author = {Haneet Wason}
}
@article {lin2015scatterEPSI,
	title = {Estimation of primaries by sparse inversion with scattering-based multiple predictions for data with large gaps},
	journal = {Geophysics},
	volume = {81},
	number = {3},
	year = {2016},
	note = {(Geophysics)},
	month = {05},
	pages = {V183-V197},
	abstract = {We propose to solve the Estimation of Primaries by Sparse Inversion problem without any explicit data reconstruction, from a seismic record with missing near-offsets and large holes in the acquisition grid which does not produce aliasing but otherwise causes large errors in the multiple prediction. Exclusion of the unknown data as an inversion variable from the process is desirable, since it sidesteps possible issues arising from fitting observations that are also unknowns in the same inversion problem. Instead, we simulate their multiple contributions by augmenting the forward prediction model for the total wavefield with a scattering series that mimics the action of the free surface reflector within the confines of the unobserved trace locations. Each term in this scattering series simply involves convolution of the predicted wavefield once more with the current estimated surface-free Green{\textquoteright}s function at these unobserved locations. We investigate the necessary modifications to the primary estimation algorithm to account for the resulting nonlinearity in the modeling operator, and also demonstrate that just a few scattering terms are enough to satisfactorily mitigate the effects of near-offset data gaps during the inversion process. Numerical experiments on synthetic data show that the final derived method can significantly outperform explicit data reconstruction for large near-offset gaps. This is achieved with a similar computational cost and better memory efficiency compared to explicit data reconstruction. We also show on real data that our scheme outperforms pre-interpolation of the near-offset gap.},
	keywords = {EPSI, multiples, Optimization, REPSI, scattering, sparsity},
	doi = {10.1190/geo2015-0263.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2016/lin2015scatterEPSI/lin2015scatterEPSI.html},
	author = {Tim T.Y. Lin and Felix J. Herrmann}
}
@article {vanleeuwen2015IPpmp,
	title = {A penalty method for PDE-constrained optimization in inverse problems},
	journal = {Inverse Problems},
	volume = {32},
	number = {1},
	year = {2015},
	note = {(Inverse Problems)},
	month = {12},
	pages = {015007},
	abstract = {Many inverse and parameter estimation problems can be written as PDE-constrained optimization problems. The goal is to infer the parameters, typically coefficients of the PDE, from partial measurements of the solutions of the PDE for several right-hand sides. Such PDE-constrained problems can be solved by finding a stationary point of the Lagrangian, which entails simultaneously updating the parameters and the (adjoint) state variables. For large-scale problems, such an all-at-once approach is not feasible as it requires storing all the state variables. In this case one usually resorts to a reduced approach where the constraints are explicitly eliminated (at each iteration) by solving the PDEs. These two approaches, and variations thereof, are the main workhorses for solving PDE-constrained optimization problems arising from inverse problems. In this paper, we present an alternative method that aims to combine the advantages of both approaches. Our method is based on a quadratic penalty formulation of the constrained optimization problem. By eliminating the state variable, we develop an efficient algorithm that has roughly the same computational complexity as the conventional reduced approach while exploiting a larger search space. Numerical results show that this method indeed reduces some of the nonlinearity of the problem and is less sensitive to the initial iterate.},
	keywords = {Inverse problems, Optimization, PDE, penalty method},
	url = {https://slim.gatech.edu/Publications/Public/Journals/InverseProblems/2015/vanleeuwen2015IPpmp/vanleeuwen2015IPpmp.pdf},
	url2 = {http://stacks.iop.org/0266-5611/32/i=1/a=015007},
	author = {Tristan van Leeuwen and Felix J. Herrmann}
}
@mastersthesis {lin2015THpes,
	title = {Primary estimation with sparsity-promoting bi-convex optimization},
	year = {2015},
	note = {(PhD)},
	month = {10},
	school = {The University of British Columbia},
	type = {phd},
	address = {Vancouver},
	abstract = {This thesis establishes a novel inversion methodology for the surface-related primaries from a given recorded seismic wavefield, called the Robust Estimation of Primaries by Sparse Inversion (Robust EPSI, or REPSI). Surface-related multiples are a major source of coherent noise in seismic data, and inferring fine geological structures from active-source seismic recordings typically first necessitates its removal or mitigation. For this task, current practice calls for data-driven approaches which produce only approximate multiple models that must be non-linearly subtracted from the data, often distorting weak primary events in the process. A recently proposed method called Estimation of Primaries by Sparse Inversion (EPSI) avoids this adaptive subtraction by directly inverting for a discrete representation of the underlying multiple-free subsurface impulse response as a set of band-limited spikes. However, in its original form, the EPSI algorithm exhibits a few notable shortcomings that impede adoption. Although it was shown that the correct impulse response can be obtained through a sparsest solution criteria, the current EPSI algorithm is not designed to take advantage of this finding, but instead approximates a sparse solution in an ad-hoc manner that requires practitioners to decide on a multitude of inversion parameters. The Robust EPSI method introduced in this thesis reformulates the original EPSI problem as a formal bi-convex optimization problem that makes obtaining the sparsest solution an explicit goal, while also reliably admit satisfactory solutions using contemporary self-tuning gradient methods commonly seen in large-scale machine learning communities. I show that the Robust EPSI algorithm is able to operate successfully on a variety of datasets with minimal user input, while also producing a more accurate model of the subsurface impulse response when compared to the original algorithm. Furthermore, this thesis makes several contributions that improves the capability and practicality of EPSI: a novel scattering-based multiple prediction model that allows Robust EPSI to deal with wider near-offset receiver gaps than previously demonstrated for EPSI, as well as a multigrid-inspired continuation strategy that significantly reduces the computation time needed to solve EPSI-type problems. These additions are enabled by and built upon the formalism of the Robust EPSI as developed in this thesis.},
	keywords = {biconvex, EPSI, inversion, multiples, Optimization, PhD, sparsity},
	url = {https://slim.gatech.edu/Publications/Public/Thesis/2015/lin2015THpes/lin2015THpes.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Thesis/2015/lin2015THpes/lin2015THpes_pres.pdf},
	author = {Tim T.Y. Lin}
}
@article {kumar2015sss,
	title = {Source separation for simultaneous towed-streamer marine acquisition {\textendash}- a compressed sensing approach},
	journal = {Geophysics},
	volume = {80},
	number = {6},
	year = {2015},
	note = {(Geophysics)},
	month = {11},
	pages = {WD73-WD88},
	abstract = {Simultaneous marine acquisition is an economic way to sample seismic data and speed up acquisition, wherein single or multiple source vessels fire sources at near-simultaneous or slightly random times, resulting in overlapping shot records. The current paradigm for simultaneous towed-streamer marine acquisition incorporates {\textquotedblleft}low variability{\textquotedblright} in source firing times, i.e., 0 <= 1 or 2 s because the sources and receivers are moving. This results in a low degree of randomness in simultaneous data, which is challenging to separate (into its constituent sources) using compressed-sensing-based separation techniques because randomization is key to successful recovery via compressed sensing. We have addressed the challenge of source separation for simultaneous towed-streamer acquisitions via two compressed-sensing-based approaches, i.e., sparsity promotion and rank minimization. We have evaluated the performance of the sparsity-promotion- and rank-minimization-based techniques by simulating two simultaneous towed-streamer acquisition scenarios, i.e., over/under and simultaneous long offset. A field data example from the Gulf of Suez for the over/under acquisition scenario was also developed. We observed that the proposed approaches gave good and comparable recovery qualities of the separated sources, but the rank-minimization technique outperformed the sparsity-promoting technique in terms of the computational time and memory. We also compared these two techniques with the normal-moveout-based median-filtering-type approach, which had comparable results.},
	keywords = {2D, Acquisition, inversion, marine, Optimization, Rank, source separation, sparsity},
	doi = {10.1190/geo2015-0108.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2015/kumar2015sss/kumar2015sss_revised.pdf},
	url2 = {http://library.seg.org/doi/abs/10.1190/geo2015-0108.1},
	author = {Rajiv Kumar and Haneet Wason 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 {peters2015AIPwri,
	title = {Wavefield-reconstruction inversion},
	booktitle = {Conference on Applied Inverse Problems},
	year = {2015},
	note = {(AIP, Helsinki)},
	month = {05},
	abstract = {Wavefield Reconstruction Inversion is a method for PDE-constrained optimization, which revolves around the estimation of fields using the PDE as well as the observed data in a least-squares sense. The method is quadratic penalty based, which offers some interesting possibilities for the construction of algorithms, compared to the Lagrangian form. One of the main benefits of the method is when the initial guess is far from the global minimizer. Reduced-space and full-space algorithms are discussed, including illustrative examples. The method was developed with seismic applications in mind, but applies to other PDE-constrained optimization problems as well.},
	keywords = {AIP, Full-waveform inversion, Optimization, penalty method, Waveform reconstruction inversion},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/AIP/2015/peters2015AIPwri/peters2015AIPwri.pdf},
	author = {Bas Peters and Felix J. Herrmann}
}
@conference {leeuwen2014EAGEntf,
	title = {A new take on FWI: wavefield reconstruction inversion},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2014},
	month = {06},
	abstract = {We discuss a recently proposed novel method for waveform inversion: Wavefield Reconstruction Inversion (WRI). As opposed to conventional FWI {\textendash} which attempts to minimize the error between observed and predicted data obtained by solving a wave equation {\textendash} WRI reconstructs a wave-field from the data and extracts a model-update from this wavefield by minimizing the wave-equation residual. The method does not require explicit computation of an adjoint wavefield as all the necessary information is contained in the reconstructed wavefield. We show how the corresponding model updates can be interpreted physically analogously to the conventional imaging-condition-based approach.},
	keywords = {EAGE, Full-waveform inversion, Optimization, penalty method, Wavefield Reconstruction Inversion},
	doi = {10.3997/2214-4609.20140703},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2014/leeuwen2014EAGEntf/leeuwen2014EAGEntf.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2014/leeuwen2014EAGEntf/leeuwen2014EAGEntf_pres.pdf},
	author = {Tristan van Leeuwen and Felix J. Herrmann and Bas Peters}
}
@techreport {herrmann2014pmpde,
	title = {A penalty method for PDE-constrained optimization},
	number = {WO 2014/172787},
	year = {2014},
	note = {(International publication date 30 October 2014. International publication number WO 2014/172787.)},
	month = {10},
	institution = {UBC},
	type = {Patent},
	abstract = {The invention is directed to a computer-implemented method for obtaining a physical model having physical model parameters wherein solutions to one or more partial-differential-equations (PDE{\textquoteright}s) are calculated ans wherein (i) an appropriate initial model is selected, (ii) setup a system of equations referred to as the data-augmented PDE for the field, comprising of the discretized PDE, the sampling operator, the source function and the observed data, and solve the data-augmented PDE in a suitable manner to obtain a field that both satisfies the PDE and fits the data to some degree, (iii) setup a system of equations by using the PDE, the source function and the field obtained in step (ii) and solve this system of equations in a suitable manner to obtain an update of the physical model parameters and repeat steps (ii)-(iii) until a predetermined stopping criterion is met.},
	keywords = {Optimization, patent, penalty method},
	url = {https://slim.gatech.edu/Publications/Public/Patents/2014/herrmann2014pmpde/herrmann2014pmpde_WO2014172787.pdf},
	url2 = {http://patentscope.wipo.int/search/en/WO2014172787},
	author = {Felix J. Herrmann and Tristan van Leeuwen}
}
@conference {peters2014SEGsrh,
	title = {A sparse reduced Hessian approximation for multi-parameter wavefield reconstruction inversion},
	booktitle = {SEG Technical Program Expanded Abstracts},
	year = {2014},
	note = {(SEG)},
	month = {10},
	pages = {1206-1210},
	abstract = {Multi-Parameter full-waveform inversion is a challenging problem, because the unknown parameters appear in the same wave equation and the magnitude of the parameters can vary many orders of magnitude. This makes accurate estimation of multiple-parameters very difficult. To mitigate the problems, sequential strategies, regularization methods and scalings of gradients and quasi-Newton Hessians have been proposed. All of these require design, fine-tuning and adaptation to different waveform inversion problems. We propose to use a sparse approximation to the Hessian derived from a penalty-formulation of the objective function. Sparseness allows to have the Hessian in memory and compute update directions at very low cost. This results in decent reconstruction of the multiple parameters at very low additional memory and computational expense.},
	keywords = {Full-waveform inversion, Hessian, Optimization, penalty method, SEG},
	doi = {http://dx.doi.org/10.1190/segam2014-1667.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2014/peters2014SEGsrh/peters2014SEGsrh.html},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2014/peters2014SEGsrh/peters2014SEGsrh_pres.pdf},
	author = {Bas Peters and Felix J. Herrmann}
}
@conference {peters2014EAGEweb,
	title = {Wave-equation based inversion with the penalty method: adjoint-state versus wavefield-reconstruction inversion},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2014},
	month = {06},
	abstract = {In this paper we make a comparison between wave-equation based inversions based on the adjoint-state and penalty methods. While the adjoint-state method involves the minimization of a data-misfit and exact solutions of the wave-equation for the current velocity model, the penalty-method aims to first find a wavefield that jointly fits the data and honours the physics, in a least-squares sense. Given this reconstructed wavefield, which is a proxy for the true wavefield in the true model, we calculate updates for the velocity model. Aside from being less nonlinear{\textendash}the acoustic wave equation is linear in the wavefield and model parameters but not in both{\textendash}the inversion is carried out over a solution space that includes both the model and the wavefield. This larger search space allows the algortihm to circumnavigate local minima, very much in the same way as recently proposed model extentions try to acomplish. We include examples for low frequencies, where we compare full-waveform inversion results for both methods, for good and bad starting models, and for high frequencies where we compare reverse-time migration with linearized imaging based on wavefield-reconstruction inversion. The examples confirm the expected benefits of the proposed method.},
	keywords = {EAGE, Full-waveform inversion, Imaging, Optimization, penalty method},
	doi = {10.3997/2214-4609.20140704},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2014/peters2014EAGEweb/peters2014EAGEweb.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2014/peters2014EAGEweb/peters2014EAGEweb_pres.pdf},
	author = {Bas Peters and Felix J. Herrmann and Tristan van Leeuwen}
}
@conference {lin2013EAGEcsd,
	title = {Cosparse seismic data interpolation},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2013},
	month = {06},
	abstract = {Many modern seismic data interpolation and redatuming algorithms rely on the promotion of transform-domain sparsity for high-quality results. Amongst the large diversity of methods and different ways of realizing sparse reconstruction lies a central question that often goes unaddressed: is it better for the transform-domain sparsity to be achieved through explicit construction of sparse representations (e.g., by thresholding of small transform-domain coefficients), or by demanding that the algorithm return physical signals which produces sparse coefficients when hit with the forward transform? Recent results show that the two approaches give rise to different solutions when the transform is redundant, and that the latter approach imposes a whole new class of constraints related to where the forward transform produces zero coefficients. From this framework, a new reconstruction algorithm is proposed which may allow better reconstruction from subsampled signaled than what the sparsity assumption alone would predict. In this work we apply the new framework and algorithm to the case of seismic data interpolation under the curvelet domain, and show that it admits better reconstruction than some existing L1 sparsity-based methods derived from compressive sensing for a range of subsampling factors.},
	keywords = {algorithm, cosparsity, curvelet, EAGE, interpolation, Optimization},
	doi = {10.3997/2214-4609.20130387},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2013/lin2013EAGEcsd/lin2013EAGEcsd.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2013/lin2013EAGEcsd/lin2013EAGEcsd_pres.pdf},
	author = {Tim T.Y. Lin and Felix J. Herrmann}
}
@article {VanLeeuwen11TRfwiwse,
	title = {Fast waveform inversion without source encoding},
	journal = {Geophysical Prospecting},
	volume = {61},
	year = {2013},
	note = {Article first published online: 10 JULY 2012},
	month = {06},
	pages = {10-19},
	abstract = {Randomized source encoding has recently been proposed as a way to dramatically reduce the costs of full waveform inversion. The main idea is to replace all sequential sources by a small number of simultaneous sources. This introduces random crosstalk in the model updates and special stochastic optimization strategies are required to deal with this. Two problems arise with this approach: i) source encoding can only be applied to fixed-spread acquisition setups, and ii) stochastic optimization methods tend to converge very slowly, relying on averaging to get rid of the cross-talk. Although the slow convergence is partly offset by the low iteration cost, we show that conventional optimization strategies are bound to outperform stochastic methods in the long run. In this paper we argue that we don{\textlnot}{\o}t need randomized source encoding to reap the benefits of stochastic optimization and we review an optimization strategy that combines the benefits of both conventional and stochastic optimization. The method uses a gradually increasing batch of sources. Thus, iterations are very cheap initially and this allows the method to make fast progress in the beginning. As the batch size grows, the method behaves like conventional optimization, allowing for fast convergence. Numerical examples suggest that the stochastic and hybrid method perform equally well with and without source encoding and that the hybrid method outperforms both conventional and stochastic optimization. The method does not rely on source encoding techniques and can thus be applied to non fixed-spread data.},
	keywords = {FWI, Optimization, SLIM},
	doi = {10.1111/j.1365-2478.2012.01096.x},
	url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1365-2478.2012.01096.x/abstract},
	url2 = {https://slim.gatech.edu/Publications/Public/Journals/GeophysicalProspecting/2013/VanLeeuwen11TRfwiwse/VanLeeuwen11TRfwiwse.pdf},
	author = {Tristan van Leeuwen and Felix J. Herrmann}
}
@article {herrmann2013TLEffwi,
	title = {Frugal full-waveform inversion: from theory to a practical algorithm},
	journal = {The Leading Edge},
	volume = {32},
	number = {9},
	year = {2013},
	month = {09},
	pages = {1082-1092},
	abstract = {As conventional oil and gas fields are maturing, our profession is challenged to come up with the next-generation of more and more sophisticated exploration tools. In exploration seismology this trend has led to the emergence of wave-equation based inversion technologies such as reverse-time migration and full-waveform inversion. While significant progress has been made in wave-equation based inversion, major challenges remain in the development of robust and computationally feasible workflows that give reliable results in geophysically challenging areas that may include ultra-low shear velocity zones or high-velocity salt. Moreover, sub-salt production carries risks that needs mitigation, which raises the bar from creating sub-salt images to inverting for sub-salt overpressure.},
	keywords = {Optimization, waveform inversion},
	doi = {10.1190/tle32091082.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/TheLeadingEdge/2013/herrmann2013ffwi/herrmann2013ffwi.html},
	author = {Felix J. Herrmann and Andrew J. Calvert and Ian Hanlon and Mostafa Javanmehri and Rajiv Kumar and Tristan van Leeuwen and Xiang Li and Brendan R. Smithyman and Eric Takam Takougang and Haneet Wason}
}
@article {moghaddam2013GEOPnoa,
	title = {A new optimization approach for source-encoding full-waveform inversion},
	journal = {Geophysics},
	volume = {78},
	number = {3},
	year = {2013},
	month = {05},
	pages = {R125-R132},
	abstract = {Waveform inversion is the method of choice for determining highly heterogeneous subsurface structure. However, conventional waveform inversion requires that the wavefield for each source is computed separately. This makes it very expensive for realistic 3D seismic surveys. Source-encoding waveform inversion, in which the sources are modelled simultaneously, is considerably faster than conventional waveform inversion but suffers from artifacts. These artifacts can partly be removed by assigning random weights to the source wavefields. We found that the misfit function, and therefore also its gradient, for source-encoding waveform inversion is an unbiased random estimation of the misfit function used in conventional waveform inversion. We found a new method of source-encoding waveform inversion which takes into account the random nature of the gradients used in the optimization. In this new method, the gradient at each iteration is a weighted average of past gradients such that the most recent gradients have the largest weights with exponential decay. This way we damped the random fluctuations of the gradient by incorporating information from the previous iterations. We compare this new method with existing source-encoding waveform inversion methods as well as conventional waveform inversion and found that the model misfit reduction is faster and smoother than those of existing source-encoding waveform inversion methods, and it approaches the model misfit reduction obtained in conventional waveform inversion.},
	keywords = {FWI, Geophysics, Optimization, source encoding},
	doi = {10.1190/GEO2012-0090.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2013/moghaddam2013GEOPnoa/moghaddam2013GEOPnoa.pdf},
	author = {Peyman P. Moghaddam and Henk Keers and Felix J. Herrmann and Wim A. Mulder}
}
@techreport {vanLeeuwen2013Penalty2,
	title = {A penalty method for PDE-constrained optimization},
	number = {TR-EOAS-2013-6},
	year = {2013},
	month = {04},
	institution = {UBC},
	abstract = {We present a method for solving PDE constrained optimization problems based on a penalty formulation. This method aims to combine advantages of both full-space and reduced methods by exploiting a large search-space (consisting of both control and state variables) while allowing for an efficient implementation that avoids storing and updating the state-variables. This leads to a method that has roughly the same per-iteration complexity as conventional reduced approaches while dening an objective that is less non-linear in the control variable by implicitly relaxing the constraint. We apply the method to a seismic inverse problem where it leads to a particularly ecient implementation when compared to a conventional reduced approach as it avoids the use of adjoint state-variables. Numerical examples illustrate the approach and suggest that the proposed formulation can indeed mitigate some of the well-known problems with local minima in the seismic inverse problem.},
	keywords = {Optimization, waveform inversion},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2013/vanLeeuwen2013Penalty2/vanLeeuwen2013Penalty2.pdf},
	author = {Tristan van Leeuwen and Felix J. Herrmann}
}
@conference {herrmann2013SEGpmc,
	title = {A penalty method for PDE-constrained optimization with applications to wave-equation based seismic inversion},
	booktitle = {SEG Workshop on Computational Mathematics for Geophysics; Houston},
	year = {2013},
	month = {09},
	keywords = {Optimization, penalty method, SEG, workshop},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2013/herrmann2013SEGpmc/herrmann2013SEGpmc_pres.pdf},
	author = {Tristan van Leeuwen and Felix J. Herrmann}
}
@article {lin2013GEOPrepsi,
	title = {Robust estimation of primaries by sparse inversion via one-norm minimization},
	journal = {Geophysics},
	volume = {78},
	number = {3},
	year = {2013},
	month = {05},
	pages = {R133-R150},
	abstract = {A recently proposed method called estimation of primaries by sparse inversion (EPSI) avoids the need for adaptive subtraction of approximate multiple predictions by directly inverting for the multiple-free subsurface impulse response as a collection of band-limited spikes. Although it can be shown that the correct primary impulse response is obtained through the sparsest possible solution, the original EPSI algorithm was not designed to take advantage of this result, and instead it relies on a multitude of inversion parameters, such as the level of sparsity per gradient update. We proposed and tested a new algorithm, named robust EPSI, in which we make obtaining the sparsest solution an explicit goal. Our approach remains a gradient-based approach like the original algorithm, but it is derived from a new biconvex optimization framework based on an extended basis-pursuit denoising formulation. Furthermore, because it is based on a general framework, robust EPSI can recover the impulse response in transform domains, such as sparsifying curvelet-based representations, without changing the underlying algorithm. We discovered that the sparsity-minimizing objective of our formulation enabled it to operate successfully on a variety of synthetic and field marine data sets without excessive tweaking of inversion parameters. We also found that recovering the solution in alternate sparsity domains can significantly improve the quality of the directly estimated primaries, especially for weaker late-arrival events. In addition, we found that robust EPSI produces a more artifact-free impulse response compared to the original algorithm.},
	keywords = {algorithm, biconvex, EPSI, multiples, Optimization, Pareto, sparsity, waveform inversion},
	doi = {10.1190/geo2012-0097.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2013/lin2013GEOPrepsi/lin2013GEOPrepsi.pdf},
	author = {Tim T.Y. Lin and Felix J. Herrmann}
}
@conference {aravkin2013ICASSPssi,
	title = {Sparse seismic imaging using variable projection},
	booktitle = {ICASSP},
	year = {2013},
	month = {05},
	abstract = {We consider an important class of signal processing problems where the signal of interest is known to be sparse, and can be recovered from data given auxiliary information about how this data was generated. For example, a sparse green{\textquoteright}s function may be recovered from seismic experimental data using sparsity optimization when the source signature is known. Unfortunately, in practice this information is often missing, and must be recovered from data along with the signal using deconvolution techniques. In this paper, we present a novel methodology to simulta- neously solve for the sparse signal and auxiliary parameters using a recently proposed variable projection technique. Our main contribution is to combine variable projection with spar- sity promoting optimization, obtaining an efficient algorithm for large-scale sparse deconvolution problems. We demon- strate the algorithm on a seismic imaging example.},
	keywords = {Imaging, Optimization, sparsity, variable projection},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/ICASSP/2013/aravkin2013ICASSPssi/aravkin2013ICASSPssi.pdf},
	author = {Aleksandr Y. Aravkin and Tristan van Leeuwen and Ning Tu}
}
@conference {herrmann2012SEGals,
	title = {Accelerated large-scale inversion with message passing},
	booktitle = {SEG Technical Program Expanded Abstracts},
	volume = {31},
	year = {2012},
	month = {11},
	pages = {1-6},
	publisher = {SEG},
	organization = {SEG},
	abstract = {To meet current-day challenges, exploration seismology increasingly relies on more and more sophisticated algorithms that require multiple paths through all data. This requirement leads to problems because the size of seismic data volumes is increasing exponentially, exposing bottlenecks in IO and computational capability. To overcome these bottlenecks, we follow recent trends in machine learning and compressive sensing by proposing a sparsity-promoting inversion technique that works on small randomized subsets of data only. We boost the performance of this algorithm significantly by modifying a state-of-the-art l1-norm solver to benefit from message passing, which breaks the build up of correlations between model iterates and the randomized linear forward model. We demonstrate the performance of this algorithm on a toy sparse-recovery problem and on a realistic reverse-time-migration example with random source encoding. The improvements in speed, memory use, and output quality are truly remarkable.},
	keywords = {Compressive Sensing, Imaging, Optimization, SEG},
	doi = {10.1190/segam2012-0847.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2012/herrmann2012SEGals/herrmann2012SEGals.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2012/herrmann2012SEGals/herrmann2012SEGals_pres.pdf},
	author = {Felix J. Herrmann}
}
@article {haber10TRemp,
	title = {An effective method for parameter estimation with PDE constraints with multiple right hand sides},
	journal = {SIAM Journal on Optimization},
	volume = {22},
	number = {3},
	year = {2012},
	month = {07},
	abstract = {Often, parameter estimation problems of parameter-dependent PDEs involve multiple right-hand sides. The computational cost and memory requirements of such problems increase linearly with the number of right-hand sides. For many applications this is the main bottleneck of the computation. In this paper we show that problems with multiple right-hand sides can be reformulated as stochastic programming problems by combining the right-hand sides into a few {\quotedblbase}simultaneous{\textquotedblright} sources. This effectively reduces the cost of the forward problem and results in problems that are much cheaper to solve. We discuss two solution methodologies: namely sample average approximation and stochastic approximation. To illustrate the effectiveness of our approach we present two model problems, direct current resistivity and seismic tomography.},
	keywords = {FWI, Optimization, SLIM},
	url = {http://dx.doi.org/10.1137/11081126X},
	author = {Eldad Haber and Matthias Chung and Felix J. Herrmann}
}
@article {herrmann11GPelsqIm,
	title = {Efficient least-squares imaging with sparsity promotion and compressive sensing},
	journal = {Geophysical Prospecting},
	volume = {60},
	number = {4},
	year = {2012},
	month = {07},
	pages = {696-712},
	address = {University of British Columbia, Vancouver},
	abstract = {Seismic imaging is a linearized inversion problem relying on the minimization of a least-squares misfit functional as a function of the medium perturbation. The success of this procedure hinges on our ability to handle large systems of equations{\textendash}-whose size grows exponentially with the demand for higher resolution images in more and more complicated areas{\textendash}-and our ability to invert these systems given a limited amount of computational resources. To overcome this "curse of dimensionality" in problem size and computational complexity, we propose a combination of randomized dimensionality-reduction and divide-and-conquer techniques. This approach allows us to take advantage of sophisticated sparsity-promoting solvers that work on a series of smaller subproblems each involving a small randomized subset of data. These subsets correspond to artificial simultaneous-source experiments made of random superpositions of sequential-source experiments. By changing these subsets after each subproblem is solved, we are able to attain an inversion quality that is competitive while requiring fewer computational, and possibly, fewer acquisition resources. Application of this concept to a controlled series of experiments showed the validity of our approach and the relationship between its efficiency{\textendash}-by reducing the number of sources and hence the number of wave-equation solves{\textendash}-and the image quality. Application of our dimensionality-reduction methodology with sparsity promotion to a complicated synthetic with well-log constrained structure also yields excellent results underlining the importance of sparsity promotion.},
	keywords = {Compressive Sensing, Imaging, Optimization, SLIM},
	doi = {10.1111/j.1365-2478.2011.01041.x},
	url = {https://slim.gatech.edu/Publications/Public/Journals/GeophysicalProspecting/2012/herrmann11GPelsqIm/herrmann11GPelsqIm.pdf},
	url2 = {http://onlinelibrary.wiley.com/doi/10.1111/j.1365-2478.2011.01041.x/full},
	author = {Felix J. Herrmann and Xiang Li}
}
@techreport {rajiv2012SEGFRM,
	title = {Fast methods for rank minimization with applications to seismic-data interpolation},
	number = {TR-EOAS-2012-3},
	year = {2012},
	month = {04},
	institution = {Department of Earth and Ocean Sciences},
	address = {University of British Columbia, Vancouver},
	abstract = {Rank penalizing techniques are an important direction in seismic inverse problems, since they allow improved recovery by exploiting low-rank structure. A major downside of current state of the art techniques is their reliance on the SVD of seismic data structures, which can be prohibitively expensive. Fortunately, recent work allows us to circumvent this problem by working with matrix factorizations. We review a novel approach to rank penalization, and successfully apply it to the seismic interpolation problem by exploiting the low-rank structure of seismic data in the midpoint-offset domain. Experiments for the recovery of 2D monochromatic data matrices and seismic lines represented as 3D volumes support the feasibility and potential of the new approach.},
	keywords = {Optimization, Rank, Seismic data Interpolation},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2012/rajiv2012SEGFRM/rajiv2012SEGFRM.pdf},
	author = {Rajiv Kumar and Aleksandr Y. Aravkin and Felix J. Herrmann}
}
@article {Li11TRfrfwi,
	title = {Fast randomized full-waveform inversion with compressive sensing},
	journal = {Geophysics},
	volume = {77},
	number = {3},
	year = {2012},
	month = {05},
	pages = {A13-A17},
	abstract = {Wave-equation based seismic inversion can be formulated as a nonlinear inverse problem where the medium properties are obtained via minimization of a least- squares misfit functional. The demand for higher resolution models in more geologically complex areas drives the need to develop techniques that explore the special structure of full-waveform inversion to reduce the computational burden and to regularize the inverse problem. We meet these goals by using ideas from compressive sensing and stochastic optimization to design a novel Gauss-Newton method, where the updates are computed from random subsets of the data via curvelet-domain sparsity promotion. Application of this idea to a realistic synthetic shows improved results compared to quasi-Newton methods, which require passes through all data. Two different subset sampling strategies are considered: randomized source encoding, and drawing sequential shots firing at random source locations from marine data with missing near and far offsets. In both cases, we obtain excellent inversion results compared to conventional methods at reduced computational costs.},
	keywords = {Compressive Sensing, FWI, Optimization, SLIM},
	doi = {10.1190/geo2011-0410.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2012/Li11TRfrfwi/Li11TRfrfwi.pdf},
	author = {Xiang Li and Aleksandr Y. Aravkin and Tristan van Leeuwen and Felix J. Herrmann}
}
@article {Friedlander11TRhdm,
	title = {Hybrid deterministic-stochastic methods for data fitting},
	journal = {SIAM Journal on Scientific Computing},
	volume = {34},
	number = {3},
	year = {2012},
	month = {01},
	pages = {A1380-A1405},
	abstract = {Many structured data-fitting applications require the solution of an optimization problem involving a sum over a potentially large number of measurements. Incremental gradient algorithms (both deterministic and randomized) offer inexpensive iterations by sampling only subsets of the terms in the sum. These methods can make great progress initially, but often slow as they approach a solution. In contrast, full gradient methods achieve steady convergence at the expense of evaluating the full objective and gradient on each iteration. We explore hybrid methods that exhibit the benefits of both approaches. Rate of convergence analysis and numerical experiments illustrate the potential for the approach.},
	keywords = {Optimization},
	doi = {10.1137/110830629},
	author = {Michael P. Friedlander and Mark Schmidt}
}
@conference {vanderneut2012SEGirs,
	title = {Interferometric redatuming with simultaneous and missing sources using sparsity promotion in the curvelet domain},
	booktitle = {SEG Technical Program Expanded Abstracts},
	volume = {31},
	year = {2012},
	month = {11},
	pages = {1-7},
	publisher = {SEG},
	organization = {SEG},
	abstract = {Interferometric redatuming is a velocity-independent method to turn downhole receivers into virtual sources. Accurate redatuming involves solving an inverse problem, which can be highly ill-posed, especially in the presence of noise, incomplete data and limited aperture. We address these issues by combining interferometric redatuming with transform-domain sparsity promotion, leading to a formulation that deals with data imperfections. We show that sparsity promotion improves the retrieval of virtual shot records under a salt flank. To reduce acquisition costs, it can be beneficial to reduce the number of sources or shoot them simultaneously. It is shown that sparse inversion can still provide a stable solution in such cases.},
	keywords = {Imaging, Interferometry, Optimization, Processing, SEG},
	doi = {10.1190/segam2012-0566.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2012/vanderneut2012SEGirs/vanderneut2012SEGirs.pdf},
	author = {Joost van der Neut and Felix J. Herrmann and Kees Wapenaar}
}
@techreport {vanleeuwen2012smii,
	title = {A parallel matrix-free framework for frequency-domain seismic modelling, imaging and inversion in Matlab},
	number = {TR-EOAS-2012-5},
	year = {2012},
	month = {07},
	abstract = {I present a parallel matrix-free framework for frequency-domain seismic modeling, imaging and inversion. The framework provides basic building blocks for designing and testing optimization-based formulations of both linear and non-linear seismic in- verse problems. By overloading standard linear-algebra operations, such as matrix-vector multiplications, standard optimization packages can be used to work with the code without any modification. This leads to a scalable testbed on which new methods can be rapidly prototyped and tested on medium-sized 2D problems. I present some numerical examples on both linear and non-linear seismic inverse problems.},
	keywords = {Matlab, object-oriented programming, Optimization, seismic imaging},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2012/vanleeuwen2012smii/vanleeuwen2012smii.pdf},
	author = {Tristan van Leeuwen}
}
@article {Aravkin11TRridr,
	title = {Robust inversion, dimensionality reduction, and randomized sampling},
	journal = {Mathematical Programming},
	volume = {134},
	number = {1},
	year = {2012},
	month = {08},
	pages = {101-125},
	abstract = {We consider a class of inverse problems in which the forward model is the solution operator to linear ODEs or PDEs. This class admits several dimensionality-reduction techniques based on data averaging or sampling, which are especially useful for large-scale problems. We survey these approaches and their connection to stochastic optimization. The data-averaging approach is only viable, however, for a least-squares misfit, which is sensitive to outliers in the data and artifacts unexplained by the forward model. This motivates us to propose a robust formulation based on the Student{\textquoteright}s t-distribution of the error. We demonstrate how the corresponding penalty function, together with the sampling approach, can obtain good results for a large-scale seismic inverse problem with 50 \% corrupted data.},
	keywords = {FWI, Inverse problems, Optimization, Robust estimation, Seismic inversion, Stochastic optimization},
	doi = {10.1007/s10107-012-0571-6},
	url = {http://www.springerlink.com/content/35rwr101h5736340/},
	url2 = {https://slim.gatech.edu/Publications/Public/Journals/MathematicalProgramming/aravkin2012MPrid/aravkin2012MPrid.pdf},
	author = {Aleksandr Y. Aravkin and Michael P. Friedlander and Felix J. Herrmann and Tristan van Leeuwen}
}
@conference {herrmann2011ICIAMconvexcompfwi,
	title = {FWI with sparse recovery: a convex-composite approach},
	booktitle = {ICIAM},
	year = {2011},
	month = {07},
	publisher = {ICIAM 2011},
	organization = {ICIAM 2011},
	abstract = {Iterative inversion algorithms require repeated simulation of 3D time-dependent acoustic, elastic, or electromagnetic wave fields, extending hundreds of wavelengths and hundreds of periods. Also, seismic data is rich in information at every representable scale. Thus simulation-driven optimization approaches to inversion impose great demands on simulator efficiency and accuracy. While computer hardware advances have been of critical importance in bringing inversion closer to practical application, algorithmic advances in simulator methodology have been equally important. Speakers in this two-part session will address a variety of numerical issues arising in the wave simulation, and in its application to inversion.},
	keywords = {Full-waveform inversion, ICIAM, Optimization},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/ICIAM/2011/herrmann2011ICIAMconvexcompfwi/herrmann2011ICIAMconvexcompfwi.pdf},
	author = {Felix J. Herrmann and Aleksandr Y. Aravkin and Tristan van Leeuwen and Xiang Li}
}
@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 {herrmann2011SPIEmsp,
	title = {A modified, sparsity promoting, Gauss-Newton algorithm for seismic waveform inversion},
	booktitle = {Proc. SPIE},
	number = {81380V},
	year = {2011},
	month = {08},
	abstract = {Images obtained from seismic data are used by the oil and gas industry for geophysical exploration. Cutting-edge methods for transforming the data into interpretable images are moving away from linear approximations and high-frequency asymptotics towards Full Waveform Inversion (FWI), a nonlinear data-fitting procedure based on full data modeling using the wave-equation. The size of the problem, the nonlinearity of the forward model, and ill-posedness of the formulation all contribute to a pressing need for fast algorithms and novel regularization techniques to speed up and improve inversion results. In this paper, we design a modified Gauss-Newton algorithm to solve the PDE- constrained optimization problem using ideas from stochastic optimization and compressive sensing. More specifically, we replace the Gauss-Newton subproblems by randomly subsampled, -$\ell_1$ regularized subproblems. This allows us us significantly reduce the computational cost of calculating the updates and exploit the compressibility of wavefields in Curvelets. We explain the relationships and connections between the new method and stochastic optimization and compressive sensing (CS), and demonstrate the efficacy of the new method on a large-scale synthetic seismic example.},
	keywords = {Compressive Sensing, Full-waveform inversion, Optimization, SLIM},
	issn = {1},
	doi = {10.1117/12.893861},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SPIE/2011/herrmann2011SPIEmsp/herrmann2011SPIEmsp.pdf},
	author = {Felix J. Herrmann and Xiang Li and Aleksandr Y. Aravkin and Tristan van Leeuwen}
}
@conference {aravkin2011EAGEnspf,
	title = {A nonlinear sparsity promoting formulation and algorithm for full waveform inversion},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2011},
	month = {05},
	abstract = {Full Waveform Inversion (FWI) is a computational procedure to extract medium parameters from seismic data. FWI is typically formulated as a nonlinear least squares optimization problem, and various regularization techniques are used to guide the optimization because the problem is illposed. In this paper, we propose a novel sparse regularization which exploits the ability of curvelets to efficiently represent geophysical images. We then formulate a corresponding sparsity promoting constrained optimization problem, which we call Nonlinear Basis Pursuit Denoise (NBPDN) and present an algorithm to solve this problem to recover medium parameters. The utility of the NBPDN formulation and efficacy of the algorithm are demonstrated on a stylized cross-well experiment, where a sparse velocity perturbation is recovered with higher quality than the standard FWI formulation (solved with LBFGS). The NBPDN formulation and algorithm can recover the sparse perturbation even when the data volume is compressed to 5 \% of the original size using random superposition.},
	keywords = {EAGE, Full-waveform inversion, Optimization},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2011/aravkin11EAGEnspf/aravkin11EAGEnspf.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2011/aravkin11EAGEnspf/aravkin11EAGEnspf_pres.pdf},
	url2 = {http://earthdoc.eage.org/publication/publicationdetails/?publication=50199},
	author = {Aleksandr Y. Aravkin and James V. Burke and Felix J. Herrmann and Tristan van Leeuwen}
}
@conference {aravkin2011SEGrobust,
	title = {Robust full-waveform inversion using the Student{\textquoteright}s t-distribution},
	booktitle = {SEG Technical Program Expanded Abstracts},
	volume = {30},
	year = {2011},
	month = {09},
	pages = {2669-2673},
	publisher = {SEG},
	organization = {SEG},
	abstract = {Full-waveform inversion (FWI) is a computational procedure to extract medium parameters from seismic data. Robust methods for FWI are needed to overcome sensitivity to noise and in cases where modeling is particularly poor or far from the real data generating process. We survey previous robust methods from a statistical perspective, and use this perspective to derive a new robust method by assuming the random errors in our model arise from the Student{\textquoteright}s t-distribution. We show that in contrast to previous robust methods, the new method progres- sively down-weighs large outliers, effectively ignoring them once they are large enough. This suggests that the new method is more robust and suitable for situations with very poor data quality or modeling. Experiments show that the new method recovers as well or better than previous robust methods, and can recover models with quality comparable to standard methods on noise-free data when some of the data is completely corrupted, and even when a marine acquisition mask is entirely ignored in the modeling. The ability to ignore a marine acquisition mask via robust FWI methods offers an opportunity for stochastic optimization methods in marine acquisition.},
	keywords = {Full-waveform inversion, Optimization, SEG},
	doi = {10.1190/1.3627747},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2011/aravkin11SEGrobust/aravkin11SEGrobust.pdf},
	author = {Aleksandr Y. Aravkin and Tristan van Leeuwen and Felix J. Herrmann}
}
@conference {aravkin2011ICIAMrfwiu,
	title = {Robust FWI using Student{\textquoteright}s t-distribution},
	booktitle = {ICIAM},
	year = {2011},
	month = {07},
	publisher = {ICIAM 2011},
	organization = {ICIAM 2011},
	abstract = {Iterative inversion algorithms require repeated simulation of 3D time-dependent acoustic, elastic, or electromagnetic wave fields, extending hundreds of wavelengths and hundreds of periods. Also, seismic data is rich in information at every representable scale. Thus simulation-driven optimization approaches to inversion impose great demands on simulator efficiency and accuracy. While computer hardware advances have been of critical importance in bringing inversion closer to practical application, algorithmic advances in simulator methodology have been equally important. Speakers in this two-part session will address a variety of numerical issues arising in the wave simulation, and in its application to inversion.},
	keywords = {Full-waveform inversion, ICIAM, Optimization, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/ICIAM/2011/aravkin2011ICIAMrfwiu/aravkin2011ICIAMrfwiu.pdf},
	author = {Aleksandr Y. Aravkin and Tristan van Leeuwen and Felix J. Herrmann}
}
@article {vanLeeuwen2010IJGswi,
	title = {Seismic waveform inversion by stochastic optimization},
	journal = {International Journal of Geophysics},
	volume = {2011},
	year = {2011},
	note = {Article ID: 689041, 18pages},
	month = {12},
	abstract = {We explore the use of stochastic optimization methods for seismic waveform inversion. The basic principle of such methods is to randomly draw a batch of realizations of a given misfit function and goes back to the 1950s. The ultimate goal of such an approach is to dramatically reduce the computational cost involved in evaluating the misfit. Following earlier work, we introduce the stochasticity in waveform inversion problem in a rigorous way via a technique called randomized trace estimation. We then review theoretical results that underlie recent developments in the use of stochastic methods for waveform inversion. We present numerical experiments to illustrate the behavior of different types of stochastic optimization methods and investigate the sensitivity to the batch size and the noise level in the data. We find that it is possible to reproduce results that are qualitatively similar to the solution of the full problem with modest batch sizes, even on noisy data. Each iteration of the corresponding stochastic methods requires an order of magnitude fewer PDE solves than a comparable deterministic method applied to the full problem, which may lead to an order of magnitude speedup for waveform inversion in practice.},
	keywords = {FWI, Optimization, SLIM},
	doi = {10.1155/2011/689041},
	url = {https://slim.gatech.edu/Publications/Public/Journals/InternationJournalOfGeophysics/2011/vanLeeuwen10IJGswi/vanLeeuwen10IJGswi.pdf},
	author = {Tristan van Leeuwen and Aleksandr Y. Aravkin and Felix J. Herrmann}
}
@conference {aravkin2011ICIAMspf,
	title = {Sparsity promoting formulations and algorithms for FWI},
	booktitle = {ICIAM},
	year = {2011},
	note = {Presented at AMP Medical and Seismic Imaging, 2011, Vancouver BC.},
	month = {07},
	publisher = {ICIAM 2011},
	organization = {ICIAM 2011},
	abstract = {Full Waveform Inversion (FWI) is a computational procedure to extract medium parameters from seismic data. FWI is typically formulated as a nonlinear least squares optimization problem, and various regularization techniques are used to guide the optimization because the problem is ill-posed. We propose a novel sparse regularization which exploits the ability of curvelets to efficiently represent geophysical images. We then formulate a corresponding sparsity promoting constrained optimization problem, which we solve using an open source algorithm. The techniques are applicable to any inverse problem where sparsity modeling is appropriate. We demonstrate the efficacy of the formulation on a toy example (stylized cross-well experiment) and on a realistic Seismic example (partial Marmoussi model). We also discuss the tradeoff between model fit and sparsity promotion, with a view to extend existing techniques for linear inverse problems to the case where the forward model is nonlinear.},
	keywords = {Full-waveform inversion, Optimization, Presentation, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/ICIAM/2011/aravkin2011ICIAMspf/aravkin2011ICIAMspf_pres.pdf},
	author = {Aleksandr Y. Aravkin and Tristan van Leeuwen and James V. Burke and Felix J. Herrmann}
}
@conference {Mansour11TRwmmw,
	title = {Weighted -$\ell_1$ minimization with multiple weighting sets},
	booktitle = {Proc. SPIE},
	volume = {8138},
	year = {2011},
	month = {09},
	pages = {813809-813809-13},
	abstract = {In this paper, we study the support recovery conditions of weighted -$\ell_1$ minimization for signal reconstruction from compressed sensing measurements when multiple support estimate sets with different accuracy are available. We identify a class of signals for which the recovered vector from -$\ell_1$ minimization provides an accurate support estimate. We then derive stability and robustness guarantees for the weighted -$\ell_1$ minimization problem with more than one support estimate. We show that applying a smaller weight to support estimate that enjoy higher accuracy improves the recovery conditions compared with the case of a single support estimate and the case with standard, i.e., non-weighted,-$\ell_1$ minimization. Our theoretical results are supported by numerical simulations on synthetic signals and real audio signals.},
	keywords = {Compressive Sensing, Optimization},
	doi = {10.1117/12.894165},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SPIE/2011/Mansour11TRwmmw/Mansour11TRwmmw.pdf},
	author = {Hassan Mansour and Ozgur Yilmaz}
}
@conference {moghaddam2010SEGrfw,
	title = {Randomized full-waveform inversion: a dimenstionality-reduction approach},
	booktitle = {SEG Technical Program Expanded Abstracts},
	volume = {29},
	year = {2010},
	month = {10},
	pages = {977-982},
	publisher = {SEG},
	organization = {SEG},
	abstract = {Full-waveform inversion relies on the collection of large multi-experiment data volumes in combination with a sophisticated back-end to create high-fidelity inversion results. While improvements in acquisition and inversion have been extremely successful, the current trend of incessantly pushing for higher quality models in increasingly complicated regions of the Earth reveals fundamental shortcomings in our ability to handle increasing problem sizes numerically. Two main culprits can be identified. First, there is the so-called {\textquoteleft}{\textquoteleft}curse of dimensionality{\textquoteright}{\textquoteright} exemplified by Nyquist{\textquoteright}s sampling criterion, which puts disproportionate strain on current acquisition and processing systems as the size and desired resolution increases. Secondly, there is the recent {\textquoteleft}{\textquoteleft}departure from Moore{\textquoteright}s law{\textquoteright}{\textquoteright} that forces us to develop algorithms that are amenable to parallelization. In this paper, we discuss different strategies that address these issues via randomized dimensionality reduction.},
	keywords = {Full-waveform inversion, Optimization, Presentation, SEG},
	doi = {10.1190/1.3513940},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2010/moghaddam10SEGrfw/moghaddam10SEGrfw.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2010/moghaddam10SEGrfw/moghaddam10SEGrfw_pres.pdf},
	author = {Peyman P. Moghaddam and Felix J. Herrmann}
}
@article {herrmann2010GEOPrsg,
	title = {Randomized sampling and sparsity: getting more information from fewer samples},
	journal = {Geophysics},
	volume = {75},
	number = {6},
	year = {2010},
	month = {12},
	pages = {WB173-WB187},
	publisher = {SEG},
	abstract = {Many seismic exploration techniques rely on the collection of massive data volumes that are subsequently mined for information during processing. Although this approach has been extremely successful in the past, current efforts toward higher-resolution images in increasingly complicated regions of the earth continue to reveal fundamental shortcomings in our workflows. Chiefly among these is the so-called {\textquotedblleft}curse of dimensionality{\textquotedblright} exemplified by Nyquist{\textquoteright}s sampling criterion, which disproportionately strains current acquisition and processing systems as the size and desired resolution of our survey areas continue to increase. We offer an alternative sampling method leveraging recent insights from compressive sensing toward seismic acquisition and processing for data that are traditionally considered to be undersampled. The main outcome of this approach is a new technology where acquisition and processing related costs are no longer determined by overly stringent sampling criteria, such as Nyquist. At the heart of our approach lies randomized incoherent sampling that breaks subsampling related interferences by turning them into harmless noise, which we subsequently remove by promoting transform-domain sparsity. Now, costs no longer grow significantly with resolution and dimensionality of the survey area, but instead depend only on transform-domain sparsity. Our contribution is twofold. First, we demonstrate by means of carefully designed numerical experiments that compressive sensing can successfully be adapted to seismic exploration. Second, we show that accurate recovery can be accomplished for compressively sampled data volumes sizes that exceed the size of conventional transform-domain data volumes by only a small factor. Because compressive sensing combines transformation and encoding by a single linear encoding step, this technology is directly applicable to acquisition and to dimensionality reduction during processing. In either case, sampling, storage, and processing costs scale with transform-domain sparsity. We illustrate this principle by means of number of case studies.},
	keywords = {Acquisition, Compressive Sensing, data acquisition, geophysical techniques, Nyquist criterion, Optimization, sampling methods, seismology, SLIM},
	doi = {10.1190/1.3506147},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2010/herrmann2010GEOPrsg/herrmann2010GEOPrsg.pdf},
	author = {Felix J. Herrmann}
}
@article {wang2008GEOPbws,
	title = {Bayesian wavefield separation by transform-domain sparsity promotion},
	journal = {Geophysics},
	volume = {73},
	number = {5},
	year = {2008},
	month = {07},
	pages = {1-6},
	abstract = {Successful removal of coherent noise sources greatly determines the quality of seismic imaging. Major advances were made in this direction, e.g., Surface-Related Multiple Elimination (SRME) and interferometric ground-roll removal. Still, moderate phase, timing, amplitude errors and clutter in the predicted signal components can be detrimental. Adopting a Bayesian approach along with the assumption of approximate curvelet-domain independence of the to-be-separated signal components, we construct an iterative algorithm that takes the predictions produced by for example SRME as input and separates these components in a robust fashion. In addition, the proposed algorithm controls the energy mismatch between the separated and predicted components. Such a control, which was lacking in earlier curvelet-domain formulations, produces improved results for primary-multiple separation on both synthetic and real data.},
	keywords = {curvelet transform, Geophysics, Optimization, Processing, SLIM},
	doi = {10.1190/1.2952571},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2008/wang08GEObws/wang08GEObws.pdf},
	html_version = {https://slim.gatech.edu/Publications/Public/Journals/2008/wang08TRbss/paper_html/paper.html},
	author = {Deli Wang and Rayan Saab and Ozgur Yilmaz and Felix J. Herrmann}
}
@techreport {vandenberg08gsv,
	title = {Group sparsity via linear-time projection},
	number = {TR-2008-09},
	year = {2008},
	month = {06},
	institution = {UBC - Department of Computer Science},
	abstract = {We present an efficient spectral projected-gradient algorithm for optimization subject to a group one-norm constraint. Our approach is based on a novel linear-time algorithm for Euclidean projection onto the one- and group one-norm constraints. Numerical experiments on large data sets suggest that the proposed method is substantially more efficient and scalable than existing methods.},
	keywords = {Optimization, SLIM},
	url = {http://www.optimization-online.org/DB_FILE/2008/07/2056.pdf},
	author = {Ewout van den Berg and Mark Schmidt and Michael P. Friedlander and K. Murphy}
}
@article {hennenfent2008GEOPnii,
	title = {New insights into one-norm solvers from the Pareto curve},
	journal = {Geophysics},
	volume = {73},
	number = {4},
	year = {2008},
	month = {07},
	pages = {A23-A26},
	abstract = {Geophysical inverse problems typically involve a trade off between data misfit and some prior. Pareto curves trace the optimal trade off between these two competing aims. These curves are commonly used in problems with two-norm priors where they are plotted on a log-log scale and are known as L-curves. For other priors, such as the sparsity-promoting one norm, Pareto curves remain relatively unexplored. We show how these curves lead to new insights in one-norm regularization. First, we confirm the theoretical properties of smoothness and convexity of these curves from a stylized and a geophysical example. Second, we exploit these crucial properties to approximate the Pareto curve for a large-scale problem. Third, we show how Pareto curves provide an objective criterion to gauge how different one-norm solvers advance towards the solution.},
	keywords = {Acquisition, Geophysics, Optimization, Pareto, Processing, SLIM},
	doi = {10.1190/1.2944169},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2008/hennenfent08GEOnii/hennenfent08GEOnii.pdf},
	author = {Gilles Hennenfent and Ewout van den Berg and Michael P. Friedlander and Felix J. Herrmann}
}
@article {berg2008SJSCpareto,
	title = {Probing the Pareto frontier for basis pursuit solutions},
	journal = {SIAM Journal on Scientific Computing},
	volume = {31},
	number = {2},
	year = {2008},
	month = {01},
	pages = {890-912},
	publisher = {SIAM},
	abstract = {The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximately, and a single parameter determines a curve that traces the optimal trade-off between the least-squares fit and the one-norm of the solution. We prove that this curve is convex and continuously differentiable over all points of interest, and show that it gives an explicit relationship to two other optimization problems closely related to BPDN. We describe a root-finding algorithm for finding arbitrary points on this curve; the algorithm is suitable for problems that are large scale and for those that are in the complex domain. At each iteration, a spectral gradient-projection method approximately minimizes a least-squares problem with an explicit one-norm constraint. Only matrix-vector operations are required. The primal-dual solution of this problem gives function and derivative information needed for the root-finding method. Numerical experiments on a comprehensive set of test problems demonstrate that the method scales well to large problems.},
	keywords = {basis pursuit, convex program, duality, Newton{\textquoteright}s method, one-norm regularization, Optimization, projected gradient, root-finding, sparse solutions},
	doi = {10.1137/080714488},
	url = {https://slim.gatech.edu/Publications/Public/Journals/SIAMJournalOnScientificComputing/2008/vanderberg08SIAMptp/vanderberg08SIAMptp.pdf},
	author = {Ewout van den Berg and Michael P. Friedlander}
}
@article {hennenfent2008GEOPsdw,
	title = {Simply denoise: wavefield reconstruction via jittered undersampling},
	journal = {Geophysics},
	volume = {73},
	number = {3},
	year = {2008},
	month = {05},
	pages = {V19-V28},
	publisher = {SEG},
	abstract = {In this paper, we present a new discrete undersampling scheme designed to favor wavefield reconstruction by sparsity-promoting inversion with transform elements that are localized in the Fourier domain. Our work is motivated by empirical observations in the seismic community, corroborated by recent results from compressive sampling, which indicate favorable (wavefield) reconstructions from random as opposed to regular undersampling. As predicted by theory, random undersampling renders coherent aliases into harmless incoherent random noise, effectively turning the interpolation problem into a much simpler denoising problem. A practical requirement of wavefield reconstruction with localized sparsifying transforms is the control on the maximum gap size. Unfortunately, random undersampling does not provide such a control and the main purpose of this paper is to introduce a sampling scheme, coined jittered undersampling, that shares the benefits of random sampling, while offering control on the maximum gap size. Our contribution of jittered sub-Nyquist sampling proves to be key in the formulation of a versatile wavefield sparsity-promoting recovery scheme that follows the principles of compressive sampling. After studying the behavior of the jittered undersampling scheme in the Fourier domain, its performance is studied for curvelet recovery by sparsity-promoting inversion (CRSI). Our findings on synthetic and real seismic data indicate an improvement of several decibels over recovery from regularly-undersampled data for the same amount of data collected.},
	keywords = {Acquisition, Compressive Sensing, Geophysics, Optimization, Processing, sampling, SLIM},
	doi = {10.1190/1.2841038},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2008/hennenfent08GEOsdw/hennenfent08GEOsdw.pdf},
	html_version = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2008/hennenfent08GEOsdw/paper_html/paper.html},
	author = {Gilles Hennenfent and Felix J. Herrmann}
}
@article {friedlander2007SJOero,
	title = {Exact regularization of convex programs},
	journal = {SIAM Journal on Optimization},
	volume = {18},
	number = {4},
	year = {2007},
	month = {05},
	pages = {1326-1350},
	abstract = {The regularization of a convex program is exact if all solutions of the regularized problem are also solutions of the original problem for all values of the regularization parameter below some positive threshold. For a general convex program, we show that the regularization is exact if and only if a certain selection problem has a Lagrange multiplier. Moreover, the regularization parameter threshold is inversely related to the Lagrange multiplier. We use this result to generalize an exact regularization result of Ferris and Mangasarian [Appl. Math. Optim., 23(1991), pp. 266{\textendash}273] involving a linearized selection problem. We also use it to derive necessary and sufficient conditions for exact penalization, similar to those obtained by Bertsekas [Math. Programming, 9(1975), pp. 87{\textendash}99] and by Bertsekas, Nedi , Ozdaglar [Convex Analysis and Optimization, Athena Scientific, Belmont, MA, 2003]. When the regularization is not exact, we derive error bounds on the distance from the regularized solution to the original solution set. We also show that existence of a {\textquoteleft}{\textquoteleft}weak sharp minimum{\textquoteright}{\textquoteright} is in some sense close to being necessary for exact regularization. We illustrate the main result with numerical experiments on the l1 regularization of benchmark (degenerate) linear programs and semidefinite/second-order cone programs. The experiments demonstrate the usefulness of l1 regularization in finding sparse solutions.},
	keywords = {Optimization, SLIM},
	doi = {10.1137/060675320},
	author = {Michael P. Friedlander and P. Tseng}
}
