arXiv (All)
open access
Adaptive Algorithms for Robust Phase Retrieval
This paper considers robust phase retrieval, which can be cast as a nonsmooth and nonconvex optimization problem. We propose two first-order algorithms with adaptive step sizes: the subgradient algorithm (AdaSubGrad) and the inexact proximal linear algorithm (AdaIPL). Our contribution lies in a nove
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Phase retrieval via overparametrized nonconvex optimization: nonsmooth amplitude loss landscapes#652136
- Phase retrieval via overparametrized nonconvex optimization: nonsmooth amplitude loss landscapes#650683
- MAGPIE: Multilevel-Adaptive-Guided Solver for Ptychographic Phase Retrieval#1247264
- Federated Zeroth-Order Optimization with Direction Aggregation and Variance Reduction#1257932
- Federated Zeroth-Order Optimization with Direction Aggregation and Variance Reduction#1249101
Record · ID 1216129
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive