2017 25th European Signal Processing Conference (EUSIPCO) 2017
DOI: 10.23919/eusipco.2017.8081370
|View full text |Cite
|
Sign up to set email alerts
|

A sequential constraint relaxation algorithm for rank-one constrained problems

Abstract: Abstract-Many optimization problems in communications and signal processing can be formulated as rank-one constrained optimization problems. This has motivated the development of methods to solve such problem in specific scenarios. However, due to the non-convex nature of the rank-one constraint, limited progress has been made in solving generic rank-one constrained optimization problems. In particular, the problem of efficiently finding a locally optimal solution to a generic rankone constrained problem remai… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
36
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
8
2

Relationship

1
9

Authors

Journals

citations
Cited by 72 publications
(37 citation statements)
references
References 14 publications
1
36
0
Order By: Relevance
“…The details of the proposed sequential constaint relaxation algorithm is presented in Algorithm 2. For the convergence analysis of Algorithm 2, similar proof can be found in [34],…”
Section: Transmission and Reflection Beamforming Optimizationmentioning
confidence: 92%
“…The details of the proposed sequential constaint relaxation algorithm is presented in Algorithm 2. For the convergence analysis of Algorithm 2, similar proof can be found in [34],…”
Section: Transmission and Reflection Beamforming Optimizationmentioning
confidence: 92%
“…For dealing with the non-convex rank-one constraint, instead of dropping the rank-one constraint completely, we adopt the sequential rank-one constraint relaxation (SROCR) method to solve the problem OP7. The SROCR method [39,46] and penalty-based method [33] are based on the same theory. The penalty-based method in which the Taylor expansion is introduced to deal with the non-convex objective function, may generate suboptimal solution which is far away from the optimal solution.…”
Section: Passive Beamforming Optimizationmentioning
confidence: 99%
“…However, the solution deriving from Gaussian randomization may not satisfy all the constraints, which is not a feasible solution. Fortunately, invoked by [25], SROCR approach is suited for problems (20a)-(20j) to approximate a Rank-1 solution. First, constraint (20g) is replaced with the relaxed constraint which makes the largest eigenvalue to trace ratio of V j with the Initialization: set n � 0 and initialize feasible solutions (x 1 [0], x 3,k [0]) to problem (19).…”
Section: (18)mentioning
confidence: 99%