Quadratic fractional optimization problems frequently arise in wireless communications. This paper introduces an enhanced semidefinite optimization relaxation approach for tackling signal design challenges associated with quadratic double–ratio minimax optimization in complex space. It results in two algorithms that offer a global optimum solution for the problem.
Zare, A. and Sadeghi Bigham, B. (2025). ON THE EFFICIENCY OF ALGORITHM FOR SOLVING COMPLEX QUADRATIC DOUBLE–RATIO MINIMAX OPTIMIZATION PROBLEM. Computational Methods for Differential Equations, (), -. doi: 10.22034/cmde.2025.64854.2951
MLA
Zare, A. , and Sadeghi Bigham, B. . "ON THE EFFICIENCY OF ALGORITHM FOR SOLVING COMPLEX QUADRATIC DOUBLE–RATIO MINIMAX OPTIMIZATION PROBLEM", Computational Methods for Differential Equations, , , 2025, -. doi: 10.22034/cmde.2025.64854.2951
HARVARD
Zare, A., Sadeghi Bigham, B. (2025). 'ON THE EFFICIENCY OF ALGORITHM FOR SOLVING COMPLEX QUADRATIC DOUBLE–RATIO MINIMAX OPTIMIZATION PROBLEM', Computational Methods for Differential Equations, (), pp. -. doi: 10.22034/cmde.2025.64854.2951
CHICAGO
A. Zare and B. Sadeghi Bigham, "ON THE EFFICIENCY OF ALGORITHM FOR SOLVING COMPLEX QUADRATIC DOUBLE–RATIO MINIMAX OPTIMIZATION PROBLEM," Computational Methods for Differential Equations, (2025): -, doi: 10.22034/cmde.2025.64854.2951
VANCOUVER
Zare, A., Sadeghi Bigham, B. ON THE EFFICIENCY OF ALGORITHM FOR SOLVING COMPLEX QUADRATIC DOUBLE–RATIO MINIMAX OPTIMIZATION PROBLEM. Computational Methods for Differential Equations, 2025; (): -. doi: 10.22034/cmde.2025.64854.2951
)