2010
DOI: 10.1109/tcomm.2010.07.090068
|View full text |Cite
|
Sign up to set email alerts
|

Monotonic Optimization Framework for the Two-User MISO Interference Channel

Abstract: Abstract-Resource allocation and transmit optimization for the multiple-antenna Gaussian interference channel are important but difficult problems. The spatial degrees of freedom can be exploited to avoid, align, or utilize the interference. In recent literature, the upper boundary of the achievable rate region has been characterized. However, the resulting programming problems for finding the sum-rate, proportional fair, and minimax (egalitarian) operating points are non-linear and non-convex.In this paper, w… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
67
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
4
3
2

Relationship

1
8

Authors

Journals

citations
Cited by 79 publications
(67 citation statements)
references
References 27 publications
0
67
0
Order By: Relevance
“…In the two-user scenario, a region based on a beamforming parametrization is used in [118], which enables very efficient line-search (see also Example 3.1). If the system utility and user performance functions are concave, then a region based on interference constraints is taken in [215], which enables bounding operations based on interference-constrained beamforming (see Subsection 2.2.1).…”
Section: Remark 211 (Other Bounding Procedures)mentioning
confidence: 99%
See 1 more Smart Citation
“…In the two-user scenario, a region based on a beamforming parametrization is used in [118], which enables very efficient line-search (see also Example 3.1). If the system utility and user performance functions are concave, then a region based on interference constraints is taken in [215], which enables bounding operations based on interference-constrained beamforming (see Subsection 2.2.1).…”
Section: Remark 211 (Other Bounding Procedures)mentioning
confidence: 99%
“…There are many variations on the PA algorithm that might improve the convergence speed: (a) An improved vertex update rule is suggested in [275, Proposition 4.2] to remove more in each iteration; (b) the line-search accuracy δ can be a function of the number of iterations and the vertex g (n) [118,276]; (c) the original problem can be perturbed in an adaptive manner to further avoid shallow cuts and jamming [39,275]; (d) scheduling can be included in the algorithm [39,276]; and (e) the algorithm can be restarted from the current best solution if the number of vertices grows too large [274].…”
Section: Remark 212 (Variations)mentioning
confidence: 99%
“…Though in principle (17) can be solved in a centralized fashion using exhaustive searches [12] or potentially by the method in [19], the computational complexity would be very high.…”
Section: Distributed Pricing-based Precodingmentioning
confidence: 99%
“…Recently, other authors have proposed spaces based on beamforming parametrizations [3], power allocation [4], user rates [5], and received interference [6]. The global optimization was either based on the polyblock approximation algorithm [3], [5] or the branch-and-bound algorithm [4], [6].…”
Section: Introductionmentioning
confidence: 99%