Minimizing a complex quadratic fractional optimization problem with two second-order cone constraints.

One of the problematic research areas in optimization is determining a global optimum for non-convex quadratic fractional optimization problems as a hard problem. This study seeks the quadratic fractional optimization problem in the complex field with two second-order cone constraints. An equivalent quadratic reformulation of the problem is given using the well-known Dinkelbach method, which can obtain its global optimum by applying the semidefinite relaxation approach and rank-one decomposition algorithm at each iteration of some classical methods. Finally, the results show the effectiveness of the proposed methods. [ABSTRACT FROM AUTHOR]