Rank-Constrained Schur-Convex Optimization With Multiple Trace/Log-Det Constraints

Rank-constrained optimization problems have received an increasing intensity of interest recently, because many optimization problems in communications and signal processing applications can be cast into a rank-constrained optimization problem. However, due to the nonconvex nature of rank constraints, a systematic solution to general rank-constrained problems has remained open for a long time. In this paper, we focus on a rank-constrained optimization problem with a Schur-convex/concave objective function and multiple trace/log-determinant constraints. We first derive a structural result on the optimal solution of the rank-constrained problem using majorization theory. Based on the solution structure, we transform the rank-constrained problem into an equivalent problem with a unitary constraint. After that, we derive an iterative projected steepest descent algorithm which converges to a local optimal solution. Furthermore, we shall show that under some special cases, we can derive a closed-form global optimal solution. The numerical results show the superior performance of our proposed technique over the baseline schemes.

[1]  Elijah Polak,et al.  Optimization: Algorithms and Consistent Approximations , 1997 .

[2]  Inderjit S. Dhillon,et al.  Guaranteed Rank Minimization via Singular Value Projection , 2009, NIPS.

[3]  Farid Alizadeh,et al.  Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization , 1995, SIAM J. Optim..

[4]  Vincent K. N. Lau,et al.  Rank Constrained Schur-Convex Optimization with Multiple Trace/Log-Det Constraints , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[5]  Sergio Barbarossa,et al.  Competitive Design of Multiuser MIMO Systems Based on Game Theory: A Unified View , 2008, IEEE Journal on Selected Areas in Communications.

[6]  Syed Ali Jafar,et al.  Interference Alignment and Degrees of Freedom of the $K$-User Interference Channel , 2008, IEEE Transactions on Information Theory.

[7]  Yang Song,et al.  Equilibrium Efficiency Improvement in MIMO Interference Systems: A Decentralized Stream Control Approach , 2007, IEEE Transactions on Wireless Communications.

[8]  David Gesbert,et al.  Unified Theory of Complex-Valued Matrix Differentiation , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.

[9]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[10]  Stephen P. Boyd,et al.  Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices , 2003, Proceedings of the 2003 American Control Conference, 2003..

[11]  Daniel Pérez Palomar,et al.  Rank-Constrained Separable Semidefinite Programming With Applications to Optimal Beamforming , 2010, IEEE Transactions on Signal Processing.

[12]  Emmanuel J. Candès,et al.  The Power of Convex Relaxation: Near-Optimal Matrix Completion , 2009, IEEE Transactions on Information Theory.

[13]  Visa Koivunen,et al.  Steepest Descent Algorithms for Optimization Under Unitary Matrix Constraint , 2008, IEEE Transactions on Signal Processing.

[14]  Levent Tunçel,et al.  Optimization algorithms on matrix manifolds , 2009, Math. Comput..

[15]  Renato D. C. Monteiro,et al.  A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization , 2003, Math. Program..

[16]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[17]  Alan Edelman,et al.  The Geometry of Algorithms with Orthogonality Constraints , 1998, SIAM J. Matrix Anal. Appl..

[18]  Wei Yu,et al.  An introduction to convex optimization for communications and signal processing , 2006, IEEE Journal on Selected Areas in Communications.

[19]  Emre Telatar,et al.  Capacity of Multi-antenna Gaussian Channels , 1999, Eur. Trans. Telecommun..

[20]  Nikos D. Sidiropoulos,et al.  Transmit beamforming for physical-layer multicasting , 2006, IEEE Transactions on Signal Processing.

[21]  Jonathan H. Manton,et al.  Optimization algorithms exploiting unitary constraints , 2002, IEEE Trans. Signal Process..

[22]  David Tse,et al.  Optimal sequences, power control, and user capacity of synchronous CDMA systems with linear MMSE multiuser receivers , 1999, IEEE Trans. Inf. Theory.

[23]  John M. Cioffi,et al.  Joint Tx-Rx beamforming design for multicarrier MIMO channels: a unified framework for convex optimization , 2003, IEEE Trans. Signal Process..

[24]  Stephen P. Boyd,et al.  A rank minimization heuristic with application to minimum order system approximation , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

[25]  I. Olkin,et al.  Inequalities: Theory of Majorization and Its Applications , 1980 .

[26]  Mary Ann Ingram,et al.  Stream control in networks with interfering MIMO links , 2003, WCNC.

[27]  Syed Ali Jafar,et al.  Degrees of Freedom of the K User M times N MIMO Interference Channel , 2008, IEEE Trans. Inf. Theory.

[28]  Stefan Vandewalle,et al.  A Riemannian Optimization Approach for Computing Low-Rank Solutions of Lyapunov Equations , 2010, SIAM J. Matrix Anal. Appl..

[29]  Pablo A. Parrilo,et al.  Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization , 2007, SIAM Rev..