Abstract
Gauge duality theory was originated by Freund (1987), and was recently further investigated by Friedlander et al. (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 semidefinite programming (SDP) problems with promising numerical results by Friedlander and Macêdo (2016). We establish some theoretical results on applying the gauge duality theory to robust 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êdo (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.
Similar content being viewed by others
References
Ben-Tal A, Nemirovski A. Non-Euclidean restricted memory level method for large-scale convex optimization. Math Program, 2005, 102: 407–456.
Candès E J, Li X, Ma Y, et al. Robust principal component analysis? J ACM, 2011, 58:1–73
Candès E J, Strohmer T, Voroninski V. PhaseLift: Exact and stable signal recovery from magnitude measurements via convex programming. Comm Pure Appl Math, 2013, 66: 1241–1274
Chandrasekaran V, Sanghavi S, Parrilo P A, et al. Rank-sparsity incoherence for matrix decomposition. SIAM J Optim, 2011, 21: 572–596
Frank M, Wolfe P. An algorithm for quadratic programming. Naval Res Logist Quart, 1956, 3: 95–110
Freund R M. Dual gauge programs, with applications to quadratic programming and the minimum-norm problem. Math Program, 1987, 38: 47–67
Friedlander M P, Macêdo I. Low-rank spectral optimization. SIAM J Sci Comp, 2016, in press
Friedlander M P, Macêdo I, Pong T K. Gauge optimization and duality. SIAM J Optim, 2014, 24: 1999–2022
Golub G H, Ye Q. An inverse free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems. SIAM J Sci Comput, 2002, 2: 312–334
Kiwiel K C. Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities. Math Program, 1995, 69: 89–109
Lemaréchal C, Nemirovskii A, Nesterov Y. New variants of bundle methods. Math Program, 1995, 69: 111–147
Levitin E, Polyak B. Constrained minimization methods. Ussr Comput Math Math Phys, 1956, 6: 1–50
Lewis A S. The convex analysis of unitarily invariant matrix functions. J Convex Anal, 1995, 2: 173–183
Mu C, Zhang Y, Wright J, et al. Scalable robust matrix recovery: Frank-wolfe meets proximal methods. ArXiv:1403. 7588, 2014
Oliveira D E, Wolkowicz H, Xu Y. ADMM for the SDP relaxation of the QAP. ArXiv:1512.05448, 2015
Renegar J. Efficient first-order methods for linear programming and semidefinite programming. ArXiv:1409.5832, 2014
Rockafellar R T. Convex Analysis. Princeton: Princeton University Press, 1970
Shen Y, Wen Z, Zhang Y. Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization. Optim Methods Softw, 2014, 29: 239–263
Shor N Z. Minimization Methods for Non-Diffrentiable Functions. New York: Springer-Verlag, 1985
Wen Z, Goldfarb D, Yin W. Alternating direction augmented Lagrangian methods for semidefinite programming. Math Program Comput, 2010, 2: 203–230
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ma, S., Yang, J. Applications of gauge duality in robust principal component analysis and semidefinite programming. Sci. China Math. 59, 1579–1592 (2016). https://doi.org/10.1007/s11425-016-0312-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11425-016-0312-1
Keywords
- gauge optimization
- gauge duality
- polar function
- antipolar set
- singular value decomposition
- robust principal component analysis
- semidefinite programming