By Zhenan Fan, University of British Columbia, Canada, firstname.lastname@example.org | Halyun Jeong, University of British Columbia, Canada, email@example.com | Yifan Sun, Stony Brook University, USA, firstname.lastname@example.org | Michael P. Friedlander, University of British Columbia, Canada, email@example.com
Structured optimization uses a prescribed set of atoms to assemble a solution that fits a model to data. Polarity, which extends the familiar notion of orthogonality from linear sets to general convex sets, plays a special role in a simple and geometric form of convex duality. This duality correspondence yields a general notion of alignment that leads to an intuitive and complete description of how atoms participate in the final decomposition of the solution. The resulting geometric perspective leads to variations of existing algorithms effective for large-scale problems. We illustrate these ideas with many examples, including applications in matrix completion and morphological component analysis for the separation of mixtures of signals.
The use of convex optimization in the fields of data science and engineering is becoming ubiquitous. But is has been recognized in the research community for more than a decade that significant efficiencies can be gained by acknowledging the latent structure in the solution itself, coupled with the overarching structure provided by convexity. Structured optimization proceeds along these lines by using a prescribed set of points, called atoms, from which to assemble an optimal solution. In effect, the atoms selected to participate in forming a solution decompose the model into simpler parts, which offers opportunities for algorithmic efficiency in solving the optimization problem. An atomic decomposition provides a description of the most informative features of a solution or a kind of generalized principal component analysis.
In this monograph, the authors describe the rich convex geometry that underlies atomic decomposition and demonstrate its use in practical examples. They expose the basic elements of this theory and its many connections to sparse and structured optimization. The authors have adopted a self-contained treatment and make a few modest assumptions that greatly simplify the derivations to make it accessible researchers who are not specialists in convex analysis.
Atomic Decomposition via Polar Alignment provides an introduction for all researchers and practitioners to a powerful optimization technique with many future applications throughout engineering and computer science.