ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1705.02356
  4. Cited By
Solving (most) of a set of quadratic equalities: Composite optimization
  for robust phase retrieval
v1v2 (latest)

Solving (most) of a set of quadratic equalities: Composite optimization for robust phase retrieval

5 May 2017
John C. Duchi
Feng Ruan
ArXiv (abs)PDFHTML

Papers citing "Solving (most) of a set of quadratic equalities: Composite optimization for robust phase retrieval"

50 / 63 papers shown
Robust Low-rank Tensor Train Recovery
Robust Low-rank Tensor Train RecoveryIEEE Transactions on Signal Processing (IEEE TSP), 2024
Zhen Qin
Zhihui Zhu
270
3
0
19 Oct 2024
Robust Gradient Descent for Phase Retrieval
Robust Gradient Descent for Phase RetrievalInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2024
Alex Buna
Patrick Rebeschini
OOD
179
1
0
14 Oct 2024
$\ell_1$-norm rank-one symmetric matrix factorization has no spurious
  second-order stationary points
ℓ1\ell_1ℓ1​-norm rank-one symmetric matrix factorization has no spurious second-order stationary points
Jiewen Guan
Anthony Man-Cho So
310
2
0
07 Oct 2024
Smoothed Robust Phase Retrieval
Smoothed Robust Phase Retrieval
Zhong Zheng
Lingzhou Xue
193
3
0
03 Sep 2024
Robust Phase Retrieval by Alternating Minimization
Robust Phase Retrieval by Alternating Minimization
Seonho Kim
Kiryung Lee
153
1
0
28 Mar 2024
Stochastic Weakly Convex Optimization Beyond Lipschitz Continuity
Stochastic Weakly Convex Optimization Beyond Lipschitz ContinuityInternational Conference on Machine Learning (ICML), 2024
Wenzhi Gao
Qi Deng
171
6
0
25 Jan 2024
Adversarial Phase Retrieval via Nonlinear Least Absolute Deviation
Adversarial Phase Retrieval via Nonlinear Least Absolute Deviation
Gao Huang
Song Li
Hang Xu
235
2
0
11 Dec 2023
FedDRO: Federated Compositional Optimization for Distributionally Robust
  Learning
FedDRO: Federated Compositional Optimization for Distributionally Robust Learning
Prashant Khanduri
Chengyin Li
Rafi Ibn Sultan
Yao Qiang
Joerg Kliewer
Dongxiao Zhu
254
1
0
21 Nov 2023
Acceleration and Implicit Regularization in Gaussian Phase Retrieval
Acceleration and Implicit Regularization in Gaussian Phase RetrievalInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2023
Tyler Maunu
M. Molina-Fructuoso
300
1
0
21 Nov 2023
Moreau Envelope ADMM for Decentralized Weakly Convex Optimization
Moreau Envelope ADMM for Decentralized Weakly Convex OptimizationAsia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC), 2023
Reza Mirzaeifard
Naveen K. D. Venkategowda
A. Jung
Stefan Werner
186
0
0
31 Aug 2023
A Unified Analysis for the Subgradient Methods Minimizing Composite
  Nonconvex, Nonsmooth and Non-Lipschitz Functions
A Unified Analysis for the Subgradient Methods Minimizing Composite Nonconvex, Nonsmooth and Non-Lipschitz Functions
Daoli Zhu
Lei Zhao
Shuzhong Zhang
212
2
0
30 Aug 2023
ReSync: Riemannian Subgradient-based Robust Rotation Synchronization
ReSync: Riemannian Subgradient-based Robust Rotation SynchronizationNeural Information Processing Systems (NeurIPS), 2023
Huikang Liu
Xiao Li
Anthony Man-Cho So
298
5
0
24 May 2023
A New Inexact Proximal Linear Algorithm with Adaptive Stopping Criteria
  for Robust Phase Retrieval
A New Inexact Proximal Linear Algorithm with Adaptive Stopping Criteria for Robust Phase RetrievalIEEE Transactions on Signal Processing (IEEE TSP), 2023
Zhong Zheng
Shiqian Ma
Lingzhou Xue
119
10
0
25 Apr 2023
An inexact LPA for DC composite optimization and application to matrix completions with outliers
An inexact LPA for DC composite optimization and application to matrix completions with outliers
Ting Tao
Ru‐feng Liu
S. Pan
366
0
0
29 Mar 2023
Linearization Algorithms for Fully Composite Optimization
Linearization Algorithms for Fully Composite OptimizationAnnual Conference Computational Learning Theory (COLT), 2023
Maria-Luiza Vladarean
N. Doikov
Martin Jaggi
Nicolas Flammarion
289
4
0
24 Feb 2023
Delayed Stochastic Algorithms for Distributed Weakly Convex Optimization
Delayed Stochastic Algorithms for Distributed Weakly Convex Optimization
W. Gao
Qinhao Deng
329
0
0
30 Jan 2023
SPIRAL: A superlinearly convergent incremental proximal algorithm for
  nonconvex finite sum minimization
SPIRAL: A superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimizationComputational optimization and applications (Comput. Optim. Appl.), 2022
Pourya Behmandpoor
P. Latafat
Andreas Themelis
Marc Moonen
Panagiotis Patrinos
228
2
0
17 Jul 2022
Randomized Coordinate Subgradient Method for Nonsmooth Composite
  Optimization
Randomized Coordinate Subgradient Method for Nonsmooth Composite Optimization
Lei Zhao
Ding-Yuan Chen
Daoli Zhu
Xiao Li
277
1
0
30 Jun 2022
Multiblock ADMM for nonsmooth nonconvex optimization with nonlinear
  coupling constraints
Multiblock ADMM for nonsmooth nonconvex optimization with nonlinear coupling constraints
L. Hien
D. Papadimitriou
149
3
0
19 Jan 2022
Statistically Optimal First Order Algorithms: A Proof via
  Orthogonalization
Statistically Optimal First Order Algorithms: A Proof via OrthogonalizationInformation and Inference A Journal of the IMA (JIII), 2022
Andrea Montanari
Yuchen Wu
276
14
0
13 Jan 2022
Rank Overspecified Robust Matrix Recovery: Subgradient Method and Exact
  Recovery
Rank Overspecified Robust Matrix Recovery: Subgradient Method and Exact RecoveryNeural Information Processing Systems (NeurIPS), 2021
Lijun Ding
Liwei Jiang
Yudong Chen
Qing Qu
Zhihui Zhu
237
30
0
23 Sep 2021
Active manifolds, stratifications, and convergence to local minima in
  nonsmooth optimization
Active manifolds, stratifications, and convergence to local minima in nonsmooth optimizationFoundations of Computational Mathematics (FoCM), 2021
Damek Davis
Dmitriy Drusvyatskiy
L. Jiang
176
17
0
26 Aug 2021
Distributed stochastic inertial-accelerated methods with delayed
  derivatives for nonconvex problems
Distributed stochastic inertial-accelerated methods with delayed derivatives for nonconvex problemsSIAM Journal of Imaging Sciences (SIAM J. Imaging Sci.), 2021
Yangyang Xu
Yibo Xu
Yonggui Yan
Jiewei Chen
264
5
0
24 Jul 2021
Minibatch and Momentum Model-based Methods for Stochastic Weakly Convex
  Optimization
Minibatch and Momentum Model-based Methods for Stochastic Weakly Convex OptimizationNeural Information Processing Systems (NeurIPS), 2021
Qi Deng
Wenzhi Gao
233
17
0
06 Jun 2021
Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms
Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms
Minhui Huang
Weiming Zhu
296
7
0
04 Feb 2021
Spectral Methods for Data Science: A Statistical Perspective
Spectral Methods for Data Science: A Statistical Perspective
Yuxin Chen
Yuejie Chi
Jianqing Fan
Cong Ma
535
202
0
15 Dec 2020
Recursive Importance Sketching for Rank Constrained Least Squares:
  Algorithms and High-order Convergence
Recursive Importance Sketching for Rank Constrained Least Squares: Algorithms and High-order ConvergenceOperational Research (OR), 2020
Yuetian Luo
Wen Huang
Xudong Li
Anru R. Zhang
457
17
0
17 Nov 2020
Optimal Sample Complexity of Subgradient Descent for Amplitude Flow via
  Non-Lipschitz Matrix Concentration
Optimal Sample Complexity of Subgradient Descent for Amplitude Flow via Non-Lipschitz Matrix ConcentrationCommunications in Mathematical Sciences (CMS), 2020
Paul Hand
Oscar Leong
V. Voroninski
166
1
0
31 Oct 2020
Low-Rank Matrix Recovery with Scaled Subgradient Methods: Fast and
  Robust Convergence Without the Condition Number
Low-Rank Matrix Recovery with Scaled Subgradient Methods: Fast and Robust Convergence Without the Condition Number
Tian Tong
Cong Ma
Yuejie Chi
285
60
0
26 Oct 2020
Quickly Finding a Benign Region via Heavy Ball Momentum in Non-Convex
  Optimization
Quickly Finding a Benign Region via Heavy Ball Momentum in Non-Convex Optimization
Jun-Kun Wang
Jacob D. Abernethy
292
8
0
04 Oct 2020
Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy
  Blind Deconvolution under Random Designs
Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution under Random Designs
Yuxin Chen
Jianqing Fan
B. Wang
Yuling Yan
383
17
0
04 Aug 2020
A Manifold Proximal Linear Method for Sparse Spectral Clustering with
  Application to Single-Cell RNA Sequencing Data Analysis
A Manifold Proximal Linear Method for Sparse Spectral Clustering with Application to Single-Cell RNA Sequencing Data AnalysisINFORMS Journal on Optimization (INFORMS J. Optim.), 2020
Zhongruo Wang
Bingyuan Liu
Shixiang Chen
Shiqian Ma
Lingzhou Xue
Hongyu Zhao
231
24
0
18 Jul 2020
From Symmetry to Geometry: Tractable Nonconvex Problems
From Symmetry to Geometry: Tractable Nonconvex Problems
Yuqian Zhang
Qing Qu
John N. Wright
362
48
0
14 Jul 2020
Differentiable Programming for Hyperspectral Unmixing using a
  Physics-based Dispersion Model
Differentiable Programming for Hyperspectral Unmixing using a Physics-based Dispersion ModelEuropean Conference on Computer Vision (ECCV), 2020
J. Janiczek
Parth Thaker
Gautam Dasarathy
C. Edwards
P. Christensen
Suren Jayasuriya
261
4
0
12 Jul 2020
Understanding Notions of Stationarity in Non-Smooth Optimization
Understanding Notions of Stationarity in Non-Smooth Optimization
Jiajin Li
Anthony Man-Cho So
Wing-Kin Ma
225
54
0
26 Jun 2020
Robust Recovery via Implicit Bias of Discrepant Learning Rates for
  Double Over-parameterization
Robust Recovery via Implicit Bias of Discrepant Learning Rates for Double Over-parameterization
Chong You
Zhihui Zhu
Qing Qu
Yi-An Ma
162
43
0
16 Jun 2020
On Distributed Non-convex Optimization: Projected Subgradient Method For
  Weakly Convex Problems in Networks
On Distributed Non-convex Optimization: Projected Subgradient Method For Weakly Convex Problems in Networks
Shixiang Chen
Alfredo García
Shahin Shahrampour
204
5
0
28 Apr 2020
Convergence of a Stochastic Gradient Method with Momentum for Non-Smooth
  Non-Convex Optimization
Convergence of a Stochastic Gradient Method with Momentum for Non-Smooth Non-Convex OptimizationInternational Conference on Machine Learning (ICML), 2020
Vien V. Mai
M. Johansson
236
62
0
13 Feb 2020
On the Sample Complexity and Optimization Landscape for Quadratic
  Feasibility Problems
On the Sample Complexity and Optimization Landscape for Quadratic Feasibility ProblemsInternational Symposium on Information Theory (ISIT), 2020
Parth Thaker
Gautam Dasarathy
Angelia Nedić
182
5
0
04 Feb 2020
Weakly Convex Optimization over Stiefel Manifold Using Riemannian
  Subgradient-Type Methods
Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods
Xiao Li
Shixiang Chen
Zengde Deng
Qing Qu
Zhihui Zhu
Anthony Man-Cho So
502
15
0
12 Nov 2019
Online Stochastic Gradient Descent with Arbitrary Initialization Solves
  Non-smooth, Non-convex Phase Retrieval
Online Stochastic Gradient Descent with Arbitrary Initialization Solves Non-smooth, Non-convex Phase RetrievalJournal of machine learning research (JMLR), 2019
Yan Shuo Tan
Roman Vershynin
160
39
0
28 Oct 2019
Statistical Analysis of Stationary Solutions of Coupled Nonconvex
  Nonsmooth Empirical Risk Minimization
Statistical Analysis of Stationary Solutions of Coupled Nonconvex Nonsmooth Empirical Risk Minimization
Zhengling Qi
Ying Cui
Yufeng Liu
J. Pang
177
5
0
06 Oct 2019
Stochastic algorithms with geometric step decay converge linearly on
  sharp functions
Stochastic algorithms with geometric step decay converge linearly on sharp functionsMathematical programming (Math. Program.), 2019
Damek Davis
Dmitriy Drusvyatskiy
Vasileios Charisopoulos
175
29
0
22 Jul 2019
Max-Affine Regression: Provable, Tractable, and Near-Optimal Statistical
  Estimation
Max-Affine Regression: Provable, Tractable, and Near-Optimal Statistical Estimation
Avishek Ghosh
A. Pananjady
Adityanand Guntuboyina
Kannan Ramchandran
185
27
0
21 Jun 2019
On the Global Minimizers of Real Robust Phase Retrieval with Sparse
  Noise
On the Global Minimizers of Real Robust Phase Retrieval with Sparse NoiseIEEE Transactions on Information Theory (IEEE Trans. Inf. Theory), 2019
Aleksandr Aravkin
J. Burke
Daiwei He
101
1
0
24 May 2019
Low-rank matrix recovery with composite optimization: good conditioning
  and rapid convergence
Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence
Vasileios Charisopoulos
Yudong Chen
Damek Davis
Mateo Díaz
Lijun Ding
Dmitriy Drusvyatskiy
284
93
0
22 Apr 2019
Convex-Concave Backtracking for Inertial Bregman Proximal Gradient
  Algorithms in Non-Convex Optimization
Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Non-Convex Optimization
Mahesh Chandra Mukkamala
Peter Ochs
Thomas Pock
Shoham Sabach
180
57
0
06 Apr 2019
The importance of better models in stochastic optimization
The importance of better models in stochastic optimizationProceedings of the National Academy of Sciences of the United States of America (PNAS), 2019
Hilal Asi
John C. Duchi
150
79
0
20 Mar 2019
Proximal algorithms for constrained composite optimization, with
  applications to solving low-rank SDPs
Proximal algorithms for constrained composite optimization, with applications to solving low-rank SDPs
Yu Bai
John C. Duchi
Song Mei
112
5
0
01 Mar 2019
Composite optimization for robust blind deconvolution
Composite optimization for robust blind deconvolution
Vasileios Charisopoulos
Damek Davis
Mateo Díaz
Dmitriy Drusvyatskiy
288
26
0
06 Jan 2019
12
Next
Page 1 of 2