Guaranteeing global optimality of divide-and-conquer phase retrieval
Develop an optimization technique for the divide-and-conquer binary phase-retrieval algorithm that synergizes with its blockwise decomposition while guaranteeing convergence to a globally optimal solution of the discrete Hessian-norm minimization problem.
References
However, there is no guarantee that Algorithm \ref{alg:phaseRecovery} converges to a global optimum of eq:disHessMin. Another direction for future work would involve employing an optimization technique that synergizes well with the divide-and-conquer nature of Algorithm \ref{alg:phaseRecovery} while guaranteeing optimality, such as the alternating direction method of multipliers (ADMM).
eq:disHessMin:
$\min_{s\in\{-1,1\}^{m\times n}} \sum_{i,j} \Vert #1{H(s \odotg)}{i}{j} \Vert_F^2, $