Yan Kaganovsky

Parallel Majorization Minimization with Dynamically Restricted Domains for Nonconvex Optimization

We propose an optimization framework for nonconvex problems based on majorization-minimization that is particularity well-suited for parallel computing. It reduces the optimization of a high dimensional nonconvex objective function to successive optimizations of locally tight and convex upper bounds…