Extreme point inequalities and geometry of the rank sparsity ball

DOI10.1007/s10107-014-0795-8zbMath1327.90200arXiv1401.4774OpenAlexW1991937133MaRDI QIDQ494341

Henry Wolkowicz, Stephen A. Vavasis, Dmitriy Drusvyatskiy

Publication date: 31 August 2015

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.4774

zbMATH Keywords

rankconvex analysissparsitynuclear normcompressed sensingexposed face

Mathematics Subject Classification ID

Convex programming (90C25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)

Related Items (4)

Max-norm optimization for robust matrix recovery ⋮ A note on alternating projections for ill-posed semidefinite feasibility problems ⋮ Lattice-Based Patterned Fabric Inspection by Using Total Variation with Sparsity and Low-Rank Representations ⋮ On Representer Theorems and Convex Regularization

Uses Software

• PhaseLift

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nuclear norm minimization for the planted clique and biclique problems
• Faces of the unit ball of a unitarily invariant norm
• Problems of distance geometry and convex properties of quadratic maps
• Rejoinder: Latent variable graphical model selection via convex optimization
• Do semidefinite relaxations solve sparse PCA up to the information limit?
• Nonsmooth analysis of singular values. I: Theory
• Exact matrix completion via convex optimization
• On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
• Introduction to Smooth Manifolds
• Orthogonal Invariance and Identifiability
• Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices
• Robust principal component analysis?
• Decoding by Linear Programming
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• A Proximal Point Algorithm for Sequential Feature Extraction Applications
• Finding Approximately Rank-One Submatrices with the Nuclear Norm and $\ell_1$-Norm
• Stable signal recovery from incomplete and inaccurate measurements
• Convex Analysis
• Phase Retrieval via Matrix Completion
• Compressed sensing

This page was built for publication: Extreme point inequalities and geometry of the rank sparsity ball