atlas

Research map / Optimization / Nonconvex and smooth optimization

Convex Phase Retrieval without Lifting via PhaseMax

ICML 2017 · Optimization › Nonconvex and smooth optimization · approach: Adaptive first-order convex methods · 10 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Replace non-convex equality constraints |<a_i,x>|=b_i with convex inequalities |<a_i,x>|<=b_i and maximize <x,xhat>PhaseMax · noiseless Gaussian phase retrievalexact recovery (success probability)No clear effect
Use truncated spectral initializer (oversampling ~6 or higher) before PhaseMax instead of random guessPhaseMax · Gaussian phase retrievaloversampling ratio required for recoveryMixed
Lift problem to n x n matrix (PhaseLift/PhaseCut) instead of working in original dimensionphase retrieval convex relaxation · Gaussian phase retrievalcomputational tractabilityHurt
Empirical success probability vs theoretical lower bound on PhaseMax recovery as a function of initial guess anglePhaseMax · random Gaussian problems, n=100 and n=500success probability vs oversampling ratioNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy