Polar Alignment and Atomic Decomposition

Abstract

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.

arXiv comment39 pages

References in corpus (5)

• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
• Forward - Backward Greedy Algorithms for Atomic Norm Regularization
• Sketchy Decisions: Convex Low-Rank Matrix Optimization with Optimal Storage
• Low-rank spectral optimization via gauge duality

Cited by in corpus (1)

• Orthant-Strictly Monotonic Norms, Generalized Top-k and k-Support Norms and the L0 Pseudonorm