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 条

[1] SEPARABLE CONVEX OPTIMIZATION PROBLEMS WITH LINEAR ASCENDING CONSTRAINTS
Padakandla, Arun
Sundaresan, Rajesh
[J]. SIAM JOURNAL ON OPTIMIZATION, 2009, 20 (03) : 1185 - 1204
[2] Convex Separable Problems With Linear Constraints in Signal Processing and Communications
D'Amico, Antonio A.
Sanguinetti, Luca
Palomar, Daniel P.
[J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2014, 62 (22) : 6045 - 6058
[3] A Graph Model Proposal for Convex Non Linear Separable Problems with Linear Constraints
Cerda, Jaime
Avalos, Alberto
[J]. WORLD CONGRESS ON ENGINEERING AND COMPUTER SCIENCE, WCECS 2013, VOL I, 2013, I : 129 - 133
[4] RELAXATION METHODS FOR PROBLEMS WITH STRICTLY CONVEX SEPARABLE COSTS AND LINEAR CONSTRAINTS
TSENG, P
BERTSEKAS, DP
[J]. MATHEMATICAL PROGRAMMING, 1987, 38 (03) : 303 - 321
[5] Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints
Stefanov, Stefan M.
[J]. JOURNAL OF INTERDISCIPLINARY MATHEMATICS, 2009, 12 (05) : 647 - 673
[6] A Graph-based Decentralization Proposal for Convex Non Linear Separable Problems with Linear Constraints
Cerda, Jaime
Graff, Mario
[J]. WORLD CONGRESS ON ENGINEERING AND COMPUTER SCIENCE, WCECS 2013, VOL I, 2013, I : 41 - 45
[7] A POLYNOMIAL-TIME DESCENT METHOD FOR SEPARABLE CONVEX OPTIMIZATION PROBLEMS WITH LINEAR CONSTRAINTS
Chubanov, Sergei
[J]. SIAM JOURNAL ON OPTIMIZATION, 2016, 26 (01) : 856 - 889
[8] A Dynamical Approach to Two-Block Separable Convex Optimization Problems with Linear Constraints
Bitterlich, Sandy
Csetnek, Erno Robert
Wanka, Gert
[J]. NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION, 2020, 42 (01) : 1 - 38
[9] Algorithms for separable convex optimization with linear ascending constraints
Akhil, P. T.
Sundaresan, Rajesh
[J]. SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 2018, 43 (09):
[10] Algorithms for separable convex optimization with linear ascending constraints
P T Akhil
Rajesh Sundaresan
[J]. Sādhanā, 2018, 43

← 1 2 3 4 5 →