CONVEX SEPARABLE PROBLEMS WITH LINEAR AND BOX CONSTRAINTS

被引：0

作者：

D'Amico, Antonio A. ^{[1
]}

Sanguinetti, Luca ^{[1
,2
]}

Palomar, Daniel P. ^{[3
]}

机构：

[1] Univ Pisa, Dipartimento Ingn Informaz, Pisa, Italy

[2] Ecole Super Elect Supelec, Alcatel Lucent Chair, Gif Sur Yvette, France

[3] Hong Kong Univ Sci & Technol, Dept Elect & Comp Engn, Hong Kong, Hong Kong, Peoples R China

来源：

2014 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP) | 2014年

关键词：

D O I：

暂无

中图分类号：

O42 [声学];

学科分类号：

070206 ; 082403 ;

摘要：

In this work, we focus on separable convex optimization problems with linear and box constraints and compute the solution in closed-form as a function of some Lagrange multipliers that can be easily computed in a finite number of iterations. This allows us to bridge the gap between a wide family of power allocation problems of practical interest in signal processing and communications and their efficient implementation in practice.

引用

页数：5

共 50 条

[31] AN ANALYTIC SOLUTION FOR SOME SEPARABLE CONVEX QUADRATIC PROGRAMMING PROBLEMS WITH EQUALITY AND INEQUALITY CONSTRAINTS
Bayon, L.
Grau, J. M.
Ruiz, M. M.
Suarez, P. M.
[J]. JOURNAL OF MATHEMATICAL INEQUALITIES, 2010, 4 (03): : 453 - 465
[32] Regularization with non-convex separable constraints
Bredies, Kristian
Lorenz, Dirk A.
[J]. INVERSE PROBLEMS, 2009, 25 (08)
[33] FREQUENCY GROUPING IN CONVEX-OPTIMIZATION PROBLEMS WITH LINEAR CONSTRAINTS
KRYSOV, YA
[J]. ENGINEERING CYBERNETICS, 1983, 21 (06): : 43 - 46
[34] Linear reconstruction problems with convex constraints: influence of the a priori data
Gzyl, H
Velasquez, Y
[J]. APPLIED MATHEMATICS AND COMPUTATION, 2000, 109 (2-3) : 189 - 198
[35] RELAXATION METHODS FOR PROBLEMS WITH STRICTLY CONVEX COSTS AND LINEAR CONSTRAINTS
TSENG, P
BERTSEKAS, DP
[J]. MATHEMATICS OF OPERATIONS RESEARCH, 1991, 16 (03) : 462 - 481
[36] A polynomial case of convex integer quadratic programming problems with box integer constraints
Chunli Liu
Jianjun Gao
[J]. Journal of Global Optimization, 2015, 62 : 661 - 674
[37] A new neural network for convex quadratic minimax problems with box and equality constraints
Gao, Xingbao
Li, Cuiping
[J]. COMPUTERS & CHEMICAL ENGINEERING, 2017, 104 : 1 - 10
[38] A polynomial case of convex integer quadratic programming problems with box integer constraints
Liu, Chunli
Gao, Jianjun
[J]. JOURNAL OF GLOBAL OPTIMIZATION, 2015, 62 (04) : 661 - 674
[39] A NOTE ON THE SOLUTION OF SEPARABLE NON-LINEAR LEAST-SQUARES PROBLEMS WITH SEPARABLE NON-LINEAR EQUALITY CONSTRAINTS
CORRADI, C
[J]. SIAM JOURNAL ON NUMERICAL ANALYSIS, 1981, 18 (06) : 1134 - 1138
[40] Modified proximal symmetric ADMMs for multi-block separable convex optimization with linear constraints
Shen, Yuan
Zuo, Yannian
Sun, Liming
Zhang, Xiayang
[J]. ANALYSIS AND APPLICATIONS, 2022, 20 (03) : 401 - 428

← 1 2 3 4 5 →