2012
DOI: 10.1109/tsp.2012.2189857
|View full text |Cite
|
Sign up to set email alerts
|

Nonsmooth Optimization for Efficient Beamforming in Cognitive Radio Multicast Transmission

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
149
0
1

Year Published

2015
2015
2022
2022

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 129 publications
(152 citation statements)
references
References 34 publications
2
149
0
1
Order By: Relevance
“…Fortunately, some effective methods have been proposed to cope with this kind of multicast beamforming problem with rank-one constraints, including semidefinite relaxation (SDR) [17,20], second-order cone programming (SOCP) [5,21], PenFun method [13,15] and so on.…”
Section: Detailed Algorithm Designmentioning
confidence: 99%
See 3 more Smart Citations
“…Fortunately, some effective methods have been proposed to cope with this kind of multicast beamforming problem with rank-one constraints, including semidefinite relaxation (SDR) [17,20], second-order cone programming (SOCP) [5,21], PenFun method [13,15] and so on.…”
Section: Detailed Algorithm Designmentioning
confidence: 99%
“…As f o (X) is concave, problem Q DRM 2 is minimization of a concave function over a convex set, which can be efficiently solved with CCP [13,15].…”
Section: Penfun Algorithmmentioning
confidence: 99%
See 2 more Smart Citations
“…The rank-one matrix constraints are dropped to have semidefinite relaxation (SDR) problem.To deal with the rank-more-than-one solution given by SDR, [24] proposes us-ing a randomization method after SDR. As shown in [25]- [27], the performance of such a method is inconsistent and could be poor in many cases. An approximate rank-one solution with compromised performance has been proposed in [28].…”
Section: Introductionmentioning
confidence: 99%