Applications of gauge duality in robust principal component analysis and semidefinite programming
From MaRDI portal
Abstract: Gauge duality theory was originated by Freund [Math. Programming, 38(1):47-67, 1987] and was recently further investigated by Friedlander, Mac{^e}do and Pong [SIAM J. Optm., 24(4):1999-2022, 2014]. When solving some matrix optimization problems via gauge dual, one is usually able to avoid full matrix decompositions such as singular value and/or eigenvalue decompositions. In such an approach, a gauge dual problem is solved in the first stage, and then an optimal solution to the primal problem can be recovered from the dual optimal solution obtained in the first stage. Recently, this theory has been applied to a class of emph{semidefinite programming} (SDP) problems with promising numerical results [Friedlander and Mac{^e}do, SIAM J. Sci. Comp., to appear, 2016]. In this paper, we establish some theoretical results on applying the gauge duality theory to robust emph{principal component analysis} (PCA) and general SDP. For each problem, we present its gauge dual problem, characterize the optimality conditions for the primal-dual gauge pair, and validate a way to recover a primal optimal solution from a dual one. These results are extensions of [Friedlander and Mac{^e}do, SIAM J. Sci. Comp., to appear, 2016] from nuclear norm regularization to robust PCA and from a special class of SDP which requires the coefficient matrix in the linear objective to be positive definite to SDP problems without this restriction. Our results provide further understanding in the potential advantages and disadvantages of the gauge duality theory.
Recommendations
- Two proposals for robust PCA using semidefinite programming
- Dual gauge programs, with applications to quadratic programming and the minimum-norm problem
- Low-rank spectral optimization via gauge duality
- Exploiting sparsity in the matrix-dilation approach to robust semidefinite programming
- A Dual Approach to Semidefinite Least-Squares Problems
- Robust least square semidefinite programming with applications
- Strongly convex programming for exact matrix completion and robust principal component analysis
- Robust PCA and pairs of projections in a Hilbert space
Cites work
- scientific article; zbMATH DE number 823379 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- Alternating direction augmented Lagrangian methods for semidefinite programming
- An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
- Convex Analysis
- Dual gauge programs, with applications to quadratic programming and the minimum-norm problem
- Gauge optimization and duality
- Low-rank spectral optimization via gauge duality
- New variants of bundle methods
- Non-Euclidean restricted memory level method for large-scale convex optimization
- Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
- Rank-Sparsity Incoherence for Matrix Decomposition
- Robust principal component analysis?
Cited in
(5)- Gauge optimization and duality
- Foundations of gauge and perspective duality
- Dual gauge programs, with applications to quadratic programming and the minimum-norm problem
- Duality of optimization problems with gauge functions
- Classification rules for two exponential populations with a common location using censored samples
This page was built for publication: Applications of gauge duality in robust principal component analysis and semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q341322)
