A sequential constraint relaxation algorithm for rank-one constrained problems

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 remains open. This paper focuses on solving general rank-one constrained problems via relaxation techniques. However, instead of dropping the rank-one constraint completely as is done in traditional rank-one relaxation methods, a novel algorithm that gradually relaxes the rank-one constraint, termed the sequential rank-one constraint relaxation (SROCR) algorithm, is proposed. Compared with previous algorithms, the SROCR algorithm can solve general rank-one constrained problems, and can find feasible solutions with favorable complexity.