Rank-constrained schur-convex optimization with multiple trace/log-det constraints

IEEE Transactions on Signal Processing

Volumn 59, Issue 1, 2011, Pages 304-314

  Yu, Hao ^a   Lau, Vincent K N ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Global optimum; local optimum; rank constrained optimization; schur convex concave; trace log det constraints

Indexed keywords

GLOBAL OPTIMAL SOLUTIONS; GLOBAL OPTIMUM; LOCAL OPTIMA; LOCAL OPTIMAL SOLUTION; SCHUR-CONVEX/CONCAVE; SIGNAL PROCESSING APPLICATIONS; STEEPEST DESCENT ALGORITHM; TRACE/LOG-DET CONSTRAINTS;

CONSTRAINED OPTIMIZATION; CONVEX OPTIMIZATION; ITERATIVE METHODS; OPTIMAL SYSTEMS; SIGNAL PROCESSING;

COMMUNICATION;

EID: 82155171453     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2010.2084997     Document Type: Article

References (28)

1. B.Recht,M.Fazel,andP.A.Parrilo,"Guaranteedminimum-ranksolu- tions of linear matrix equations via nuclear norm minimization," SIAM Rev., to appear.
2. M. Fazel, "Matrix rank minimization with applications," Ph.D. disser- tation, Stanford Univ., Stanford, CA, 2002.
3. Z.-Q. Luo and W. Yu, "An introduction to convex optimization for communications and signal processing," IEEE J. Sel. Areas Commun., vol. 24, no. 8, pp. 1426-1438, Aug. 2006.
4. N. D. Sidiropoulos, T. N. Davidson, and Z.-Q. Luo, "Transmit beam- forming for physical-layer multicasting," IEEE Trans. Signal Process., vol. 54, no. 6, pp. 2239-2251, 2006.
5. E. J. Candès and T. Tao, "The power of convex relaxation: Near-op- timal matrix completion," IEEE Trans. Inf. Theory, vol. 56, no. 5, pp. 2053-2080, May 2010.
6. M. X. Goemans and D. P. Williamson, "Improved approximation algo- rithms for maximum cut and satisability problems using semidenite programming," J. ACM, vol. 42, no. 6, pp. 1115-1145, Nov. 1995.
7. M. Fazel, H. Hindi, and S. P. Boyd, "Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance ma- trices," in Proc. Amer. Control Conf.(ACC), Jun. 2003, pp. 2156-2162.
8. B. Vandereycken and S. Vandewalle, "A Riemannian optimization ap- proach forcomputing low-rank solutionsof Lyapunovequation," SIAM J. Matrix Anal. Appl., to appear.
9. R. Meka, P. Jain, and I. S. Dhillon, "Guaranteed rank minimization via singular value projection," 2009
10. [Online]. Available: http://arxiv.org/abs/0909.5457
11. S. Burer and R. D. Monteiro, "A nonlinear programming algorithm for solving semidenite programs via low-rank factorization," Math. Program., vol. 95, no. 2, pp. 329-357, Feb. 2003.
12. Y.HuangandD.P.Palomar,"Rank-constrainedseparablesemidenite programming with applications to optimal beamforming," IEEE Trans. Signal Process., to appear.
13. A. W. Marshall and I. Olkin, Inequalities: Theory of Majorization and Its Applications. New York: Academic, 1975.
14. H. Yu and V. K. N. Lau, "Rank-constrained Schur-convex optimiza- tion with multiple trace/log-det constraints," 2010
15. [Online]. Available: http://arxiv.org/abs/1009.4268
16. D. P. Palomar, J. M. Ciof, and M. A. Lagunas, "Joint Tx-Rx beam- forming design for multicarrier MIMO channels: A unied framework for convex optimization," IEEE Trans. Signal Process., vol. 51, no. 9, pp. 2381-2401, Sept. 2003.
17. V. R. Cadambe and S. A. Jafar, "Interference alignment and degrees of freedom of the k-user interference channel," IEEE Trans. Inf. Theory, vol. 54, no. 8, pp. 3425-3441, Aug. 2008.
18. G. Arslan, M. F. Demirkol, and Y. Song, "Equilibrium efciency improvement in MIMO interference systems: A decentralized stream control approach," IEEE Trans. Wireless Commun., vol. 6, no. 8, pp. 2984-2993, Aug. 2007.
19. D. Fudenberg and J. Tirole, Game Theory. Cambridge, MA: MIT Press, 1991.
20. R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge, New York: Cambridge Univ. Press, 1985.
21. J.H.Manton,"Optimizationalgorithmsexploitingunitaryconstraints, " IEEE Trans. Signal Process., vol. 50, no. 3, pp. 635-650, 2002.
22. A. Hjørungnes, D. Gesbert, and D. P. Palomar, "Unied theory of com- plex-valued matrix differentiation," in Proc. IEEE Int. Conf. Acoust., Speech Signal Process. (ICASSP), 2007, pp. 345-348.
23. P. Viswanath, V. Anantharam, and D. N. C. Tse, "Optimal sequences, power control, and user capacity of synchronous CDMA systems with linear MMSE multiuser receivers," IEEE Trans. Inf. Theory, vol. 45, no. 6, pp. 1968-1983, Sep. 1999.
24. A. Edelman, T. A. Arias, and S. T. Smith, "The geometry of algorithms with orthogonality constraints," SIAM J. Matrix Anal. Appl., vol. 20, no. 2, pp. 303-353, 1998.
25. T. E. Abrudan, J. Eriksson, and V. Koivunen, "Steepest descent algo- rithms for optimization under unitary constraints," IEEE Trans. Signal Process., vol. 56, no. 3, pp. 1134-1147, 2008.
26. P. A. Absil, R. Mahony, and R. Sepulchre, Optimization Algorithms on Matrix Manifolds. Princeton, NJ: Princeton Univ. Press, 2008.
27. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, London, U.K.: Cambridge Univ. Press, 2004.
28. E. Polak, Optimization: Algorithms and Consistent Approximations. New York: Springer-Verlag, 1997.