A Unified Successive Pseudoconvex Approximation Framework

IEEE Transactions on Signal Processing

Volumn 65, Issue 13, 2017, Pages 3313-3328

  Yang, Yang ^a   Pesavento, Marius ^b  

^a INTEL DEUTSCHLAND GMBH   (Germany)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Energy efficiency; LASSO; line search; massive MIMO; MIMO broadcast channel; nonconvex optimization; nondifferentiable optimization; pseudoconvex optimization; successive convex approximation

Indexed keywords

APPROXIMATION ALGORITHMS; BROADCASTING; CODES (SYMBOLS); COMPUTATIONAL EFFICIENCY; ENERGY EFFICIENCY; GRADIENT METHODS; MIMO SYSTEMS; REGRESSION ANALYSIS;

LASSO; LINE SEARCHES; MIMO BROADCAST CHANNELS; NON-DIFFERENTIABLE OPTIMIZATION; NONCONVEX OPTIMIZATION; PSEUDOCONVEX OPTIMIZATIONS; SUCCESSIVE CONVEX APPROXIMATIONS;

OPTIMIZATION;

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

References (49)

1. W.Yu,W. Rhee, S. Boyd, and J. Cioffi, "Iterativewater-filling for Gaussian vector multiple-access channels," IEEE Trans. Inf. Theory, vol. 50, no. 1, pp. 145-152, Jan. 2004
2. N. Jindal, W. Rhee, S. Vishwanath, S. Jafar, and A. Goldsmith, "Sum power iterative water-filling for multi-antenna Gaussian broadcast channels," IEEE Trans. Inf. Theory, vol. 51, no. 4, pp. 1570-1580, Apr. 2005
3. W. Yu, "Sum-capacity computation for the Gaussian vector broadcast channel via dual decomposition," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 754-759, Feb. 2006
4. S. Ye and R. Blum, "Optimized signaling for MIMO interference systems with feedback," IEEE Trans. Signal Process., vol. 51, no. 11, pp. 2839-2848, Nov. 2003
5. Z.-Q. Luo and S. Zhang, "Dynamic spectrum management: Complexity and duality," IEEE J. Sel. Topics Signal Process., vol. 2, no. 1, pp. 57-73, Feb. 2008
6. S.-J. Kim and G. B. Giannakis, "Optimal resource allocation for MIMO ad hoc cognitive radio networks," IEEE Trans. Inf. Theory, vol. 57, no. 5, pp. 3117-3131, May 2011
7. Q. Shi, M. Razaviyayn, Z.-Q. Luo, and C. He, "An iteratively weighted MMSE approach to distributed sum-utility maximization for a MIMO interfering broadcast channel," IEEE Trans. Signal Process., vol. 59, no. 9, pp. 4331-4340, Sep. 2011
8. G. Scutari, F. Facchinei, P. Song, D. P. Palomar, and J.-S. Pang, "Decomposition by partial linearization: Parallel optimization of multi-agent systems," IEEE Trans. Signal Process., vol. 62, no. 3, pp. 641-656, Feb. 2014
9. Y. Yang, G. Scutari, P. Song, and D. P. Palomar, "RobustMIMO cognitive radio systems under interference temperature constraints," IEEE J. Sel. Areas Commun., vol. 31, no. 11, pp. 2465-2482, Nov. 2013
10. Y. Yang, F. Rubio, G. Scutari, and D. P. Palomar, "Multi-portfolio optimization: A potential game approach," IEEE Trans. Signal Process., vol. 61, no. 22, pp. 5590-5602, Nov. 2013
11. S.-J. Kim, K. Koh, M. Lustig, S. Boyd, and D. Gorinevsky, "An interiorpoint method for large-scale l1-regularized least squares," IEEE J. Sel. Topics Signal Process., vol. 1, no. 4, pp. 606-617, Dec. 2007
12. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, "Distributed optimization and statistical learning via the alternating direction method of multipliers," Found. Trends Mach. Learn., vol. 3, no. 1, pp. 1-122, 2011
13. D. P. Bertsekas, Nonlinear Programming. Belmont, MA, USA: Athena Scientific, 1999
14. N. Parikh and S. Boyd, "Proximal algorithms," Found. Trends Optim., vol. 1, no. 3, pp. 127-239, 2014
15. P. L. Combettes and J.-C. Pesquet, "Proximal splitting methods in signal processing," in Fixed-Point Algorithms for Inverse Problems in Science and Engineering (Ser. Springer Optimization and Its Applications), H. H. Bauschke, R. S. Burachik, P. L. Combettes, V. Elser, D. R. Luke, and H. Wolkowicz, Eds. New York, NY, USA: Springer, 2011, vol. 49, pp. 185-212
16. M. Razaviyayn, M. Hong, and Z.-Q. Luo, "A unified convergence analysis of block successive minimization methods for nonsmooth optimization," SIAM J. Optim., vol. 23, no. 2, pp. 1126-1153, 2013
17. D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Englewood Cliffs, NJ, USA: Prentice-Hall, 1989
18. P. He, "Correction of convergence proof for iterative water-filling in Gaussian MIMO broadcast channels," IEEE Trans. Inf. Theory, vol. 57, no. 4, pp. 2539-2543, Apr. 2011
19. F. Facchinei, G. Scutari, and S. Sagratella, "Parallel selective algorithms for nonconvex big data optimization," IEEE Trans. Signal Process., vol. 63, no. 7, pp. 1874-1889, Nov. 2015
20. G. Scutari, F. Facchinei, and L. Lampariello, "Parallel and distributed methods for constrained nonconvex optimization-Part I: Theory," IEEE Trans. Signal Process., vol. 65, no. 8, pp. 1929-1944, Apr. 2017
21. J. M. Ortega andW. C. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables. New York, NY, USA: Academic, 1970
22. O. L. Mangasarian, Nonlinear Programming. New York, NY, USA: McGraw-Hill, 1969
23. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004
24. J. Nocedal and S. J. Wright, Numerical Optimization, 2nd ed. Berlin, Germany: Springer, 2006
25. S. M. Robinson and R. H. Day, "A sufficient condition for continuity of optimal sets in mathematical programming," J. Math. Anal. Appl., vol. 45, no. 2, pp. 506-511, Feb. 1974
26. R. W. Freund and F. Jarre, "An interior-point method for fractional programs with convex constraints," Math. Program., vol. 67, no. 1, pp. 407-440, 1994
27. M. Patriksson, "Cost approximation: A unified framework of descent algorithms for nonlinear programs," SIAM J. Optim., vol. 8, no. 2, pp. 561-582, May 1998
28. P. Tseng and S.Yun, "A coordinate gradient descentmethod for nonsmooth separable minimization," Math. Program., vol. 117, no. 1, pp. 387-423, 2009
29. R. H. Byrd, J. Nocedal, and F. Oztoprak, "An inexact successive quadratic approximationmethod for L-1 regularized optimization," Math. Program., vol. 157, no. 2, pp. 375-396, Jun. 2016
30. D. P. Palomar and M. Chiang, "A tutorial on decomposition methods for network utility maximization," IEEE J. Sel. Areas Commun., vol. 24, no. 8, pp. 1439-1451, Aug. 2006
31. W. Yu and J. M. Cioffi, "Sum capacity of Gaussian vector broadcast channels," IEEE Trans. Inf. Theory, vol. 50, no. 9, pp. 1875-1892, Sep. 2004
32. M. Grant and S. Boyd, "CVX: Matlab Software for Disciplined Convex Programming, version 2.0 beta," 2012. [Online]. Available: http://cvxr.com/
33. Y. Yang and M. Pesavento, "A parallel algorithm for energy efficiency maximization in massive MIMO networks," in Proc. IEEE Global Commun. Conf., 2016, pp. 1-6
34. A. Zappone, L. Sanguinetti, G. Bacci, E. Jorswieck, and M. Debbah, "Energy-efficient power control: A look at 5G wireless technologies," IEEE Trans. Signal Process., vol. 64, no. 7, pp. 1668-1683, Apr. 2016
35. Y. Yang, G. Scutari, D. P. Palomar, and M. Pesavento, "A parallel decomposition method for nonconvex stochastic multi-agent optimization problems," IEEE Trans. Signal Process., vol. 64, no. 11, pp. 2949-2964, Jun. 2016
36. R. Tibshirani, "Regression shrinkage and selection via the lasso: a retrospective," J. Roy. Statist. Soc.: Ser. B (Statist. Methodol.), vol. 58, no. 1, pp. 267-288, Jun. 1996
37. A. Beck and M. Teboulle, "a fast iterative shrinkage-thresholding algorithm for linear inverse problems," SIAM J. Imag. Sci., vol. 2, no. 1, pp. 183-202, Jan. 2009
38. M. Elad, "Why simple shrinkage is still relevant for redundant representations" IEEE Trans. Inf. Theory, vol. 52, no. 12, pp. 5559-5569, 2006
39. J. Friedman, T. Hastie, H.Höfling, andR. Tibshirani, "Pathwise coordinate optimization," Ann. Appl. Statist., vol. 1, no. 2, pp. 302-332, Dec. 2007
40. M. A. T. Figueiredo, R. D. Nowak, and S. J. Wright, "Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems," IEEE J. Sel. Topics Signal Process., vol. 1, no. 4, pp. 586-597, Dec. 2007
41. Y. Yang, 2016. [Online]. Available: http://www.nts.tu-darmstadt.de/ home-nts/staff-nts/former-staff-nts/mitarbeiterdetails-32448.en.jsp
42. Z. Peng, M. Yan, and W. Yin, "Parallel and distributed sparse optimization," Proc. Asilomar Conf. Signals, Systems Comput., Nov. 2013, pp. 659-646
43. S. Wright, R. Nowak, and M. Figueiredo, "Sparse reconstruction by separable approximation," IEEE Trans. Signal Process., vol. 57, no. 7, pp. 2479-2493, Jul. 2009
44. D. Lorenz, M. Pfetsch, and A. Tillmann, "Solving basis pursuit: Heuristic optimality check and solver comparison," ACM Trans. Math. Soft., vol. 41, no. 2, pp. 1-29, 2015
45. R. T. Rockafellar, "Augmented Lagrangians and applications of the proximal point algorithm in convex programming," Math. Oper. Res., vol. 1, no. 2, pp. 97-116, 1976
46. J. Kuske and A. Tillmann, "Solving basis pursuit: Update," Technische Universität Darmstadt, Darmstadt, Germany, Tech. Rep., Apr. 2016. [Online]. Available: http://www.mathematik.tu-darmstadt.de/ tillmann/docs/SolvingBPupdateApr2016.pdf
47. C. Steffens, Y. Yang, and M. Pesavento, "Multidimensional sparse recovery for MIMO channel parameter estimation," in Proc. Eur. Signal Process. Conf., 2016, pp. 66-70
48. G. Hegde, Y. Yang, C. Steffens, and M. Pesavento, "Parallel lowcomplexity M-PSK detector for large-scale MIMO systems," in Proc. IEEE Sensor Array Multichannel Signal Process. Workshop, 2016, pp. 1-5
49. C. Berge, Topological Spaces: Including a Treatment of Multi-Valued Functions, Vector Spaces and Convexity. New York, NY, USA: Dover, 1997.