@article{geiping_composite_2018,
 abstract = {The minimization of a nonconvex composite function can model a variety of imaging tasks. A popular class of algorithms for solving such problems are majorization-minimization techniques which iteratively approximate the composite nonconvex function by a majorizing function that is easy to minimize. Most techniques, e.g., gradient descent, utilize convex majorizers in order to guarantee that the majorizer is easy to minimize. In our work we consider a natural class of nonconvex majorizers for these functions, and show that these majorizers are still sufficient for a globally convergent optimization scheme. Numerical results illustrate that by applying this scheme, one can often obtain superior local optima compared to previous majorization-minimization methods, when the nonconvex majorizers are solved to global optimality. Finally, we illustrate the behavior of our algorithm for depth superresolution from raw time-of-flight data.},
 author = {<NAME> and <NAME>},
 copyright = {All rights reserved},
 doi = {10.1137/18M1171989},
 journal = {SIAM Journal on Imaging Sciences},
 keywords = {90C26; 90C06; 68U10; 32B20; 65K10; 47J06,Computer Science - Computer Vision and Pattern Recognition,Mathematics - Numerical Analysis,Mathematics - Optimization and Control},
 month = {January},
 pages = {2494--2528},
 title = {Composite Optimization by Nonconvex Majorization-Minimization},
 year = {2018}
}

