@conference {peters2019SIAMGEOgmrip,
	title = {Generalized Minkowski sets for the regularization of inverse problems},
	booktitle = {SIAM Conference on Mathematical and Computational Issues in the Geosciences},
	year = {2019},
	note = {(SIAM)},
	month = {05},
	abstract = {We present a new algorithm to compute projections onto the intersection of constraint sets, designed particularly for multiple sets because we exploit similarities between constraint sets. When we do not know projections onto the individual sets in closed form, as is the case for total-variation constraints, our algorithm does not need other optimization algorithms to solve sub-problems. This a significant advantage in terms of computational cost and number of tuning parameters and stopping conditions, compared to classical algorithms to compute projections onto the intersection, such as Dykstra{\textquoteright}s algorithm. The proposed algorithm is suitable for problems with a large number of model parameters such as full-waveform inversion because it exploits coarse and fine-grained parallelism, and we also present a multilevel accelerated version. The corresponding software is open-source and implemented in Julia. We present strategies to use projections onto multiple constraints to regularize full-waveform inversion for models with salt domes or sedimentary geology.},
	keywords = {Intersections, Inverse problems, Minkowski set, Projections, Sets},
	url = {https://www.pathlms.com/siam/courses/11267/sections/14618/video_presentations/128671},
	url2 = {https://meetings.siam.org/sess/dsp_talk.cfm?p=97656},
	author = {Bas Peters and Felix J. Herrmann}
}
@article {peters2019gms,
	title = {Generalized Minkowski sets for the regularization of inverse problems},
	journal = {arXiv e-prints},
	year = {2019},
	note = {(arXiv)},
	month = {03},
	abstract = {Many works on inverse problems in the imaging sciences consider regularization via one or more penalty functions or constraint sets. When the models/images are not easily described using one or a few penalty functions/constraints, additive model descriptions for regularization lead to better imaging results. These include cartoon-texture decomposition, morphological component analysis, and robust principal component analysis; methods that typically rely on penalty functions. We propose a regularization framework, based on the Minkowski set, that merges the strengths of additive models and constrained formulations. We generalize the Minkowski set, such that the model parameters are the sum of two components, each of which is constrained to an intersection of sets. Furthermore, the sum of the components is also an element of another intersection of sets. These generalizations allow us to include multiple pieces of prior knowledge on each of the components, as well as on the sum of components, which is necessary to ensure physical feasibility of partial-differential-equation based parameters estimation problems. We derive the projection operation onto the generalized Minkowski sets and construct an algorithm based on the alternating direction method of multipliers. We illustrate how we benefit from using more prior knowledge in the form of the generalized Minkowski set using seismic waveform inversion and video background-anomaly separation.},
	keywords = {inverse},
	url = {http://arxiv.org/abs/1903.03942},
	author = {Bas Peters and Felix J. Herrmann}
}
