Toward the Optimal Construction of a Loss Function Without Spurious Local Minima for Solving Quadratic Equations

DOI10.1109/TIT.2019.2956922zbMath1448.65053arXiv1809.10520OpenAlexW2993205200MaRDI QIDQ5123923

Zhen-zhen Li, Jian-Feng Cai, Ke Wei

Publication date: 29 September 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.10520

Mathematics Subject Classification ID

Quadratic programming (90C20) Numerical computation of solutions to systems of equations (65H10)

Related Items (9)

Analysis of Asymptotic Escape of Strict Saddle Sets in Manifold Optimization ⋮ Sparse signal recovery from phaseless measurements via hard thresholding pursuit ⋮ Provable sample-efficient sparse phase retrieval initialized by truncated power method ⋮ Nearly optimal bounds for the global geometric landscape of phase retrieval ⋮ Loss functions for finite sets ⋮ Scalable incremental nonconvex optimization approach for phase retrieval ⋮ The Global Landscape of Phase Retrieval II: Perturbed Amplitude Models ⋮ The Global Landscape of Phase Retrieval II: Quotient Intensity Models ⋮ Solving phase retrieval with random initial guess is nearly as good as by spectral initialization

This page was built for publication: Toward the Optimal Construction of a Loss Function Without Spurious Local Minima for Solving Quadratic Equations