@article {peters2019aos,
	title = {Algorithms and software for projections onto intersections of convex and non-convex sets with applications to inverse problems},
	journal = {arXiv e-prints},
	year = {2019},
	note = {(arXiv)},
	month = {03},
	abstract = {We propose algorithms and software for computing projections onto the intersection of multiple convex and non-convex constraint sets. The software package, called SetIntersectionProjection, is intended for the regularization of inverse problems in physical parameter estimation and image processing. The primary design criterion is working with multiple sets, which allows us to solve inverse problems with multiple pieces of prior knowledge. Our algorithms outperform the well known Dykstra{\textquoteright}s algorithm when individual sets are not easy to project onto because we exploit similarities between constraint sets. Other design choices that make the software fast and practical to use, include recently developed automatic selection methods for auxiliary algorithm parameters, fine and coarse grained parallelism, and a multilevel acceleration scheme. We provide implementation details and examples that show how the software can be used to regularize inverse problems. Results show that we benefit from working with all available prior information and are not limited to one or two regularizers because of algorithmic, computational, or hyper-parameter selection issues.},
	keywords = {algorithm, software},
	url = {http://arxiv.org/abs/1902.09699},
	author = {Bas Peters and Felix J. Herrmann}
}
@presentation {peters2017SINBADFaaj,
	title = {Algorithms and Julia software for FWI with multiple constraints},
	year = {2017},
	publisher = {SINBAD},
	abstract = {We present a framework to add multiple convex and non-convex constraints to nonlinear inverse problems, specifically FWI. The constraints mitigate problems related to noisy data, artifacts arising from working with very few simultaneous sources, inaccurate starting models and using approximate physical forward models. Compared to earlier work at SLIM, the current framework is algorithmically simpler and computationally more efficient. We show examples where the model estimation is improved when we use very limited prior knowledge directly as constraints. We also present the software implementation in Julia and how it is used together with other software that compute data-misfit values and gradients w.r.t. the model parameters.},
	keywords = {Presentation, SINBAD, SINBADFALL2017, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2017/Fall/peters2017SINBADFaaj/peters2017SINBADFaaj.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2017/Fall/peters2017SINBADFaaj/peters2017SINBADFaaj.m4v},
	author = {Bas Peters and Felix J. Herrmann}
}
@conference {peters2015PRECONasl,
	title = {An algorithm for solving least-squares problems with a Helmholtz block and multiple right-hand-sides},
	booktitle = {International Conference On Preconditioning Techniques For Scientific And Industrial Applications},
	year = {2015},
	note = {(PRECON, The Netherlands)},
	month = {06},
	keywords = {CGMN, Helmholtz, least-squares, matrix-free, randomized linear algebra},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/PRECON/2015/peters2015PRECONasl/peters2015PRECONasl_pres.pdf},
	author = {Bas Peters and Chen Greif and Felix J. Herrmann}
}
