In general, the problem (REF ) is a non-convex problem. Therefore, bilevel optimization has been widely applied to solve the problem (REF ), e.g., [1]}, [2]}, [3]}. The bilevel optimization has an upper-level problem:
\(\begin{aligned}& \underset{T \in \mathcal {T}}{\text{minimize}} && J(\sigma ^*,T)\\& \text{subject to} && \sigma ^*(T) \in \underset{\sigma }{\text{argmin}}\lbrace  J(\sigma ,T): \sigma  \in \mathcal {F} \rbrace ,\end{aligned}\) 
