28 citations · 131 across the 41 of their papers we have counts for
44 papers
Restarted Accelerated Primal-Dual Algorithms with Adaptive Stepsizes for Nonlinear Conic Constrained Convex Optimization
Necdet Serhat Aybat, Jinxin Wang
We propose restarted accelerated primal-dual algorithms with (non-monotone) backtracking (rAPDB) for convex nonlinear conic programs, with quadratically constrained quadratic progr…
An Accelerated Primal Dual Algorithm with Backtracking for Decentralized Constrained Optimization
Qiushui Xu, Necdet Serhat Aybat, Mert Gürbüzbalaban
We propose a distributed accelerated primal-dual method with backtracking (D-APDB) for cooperative multi-agent constrained consensus optimization problems over an undirected networ…
A Retraction-free Method for Nonsmooth Minimax Optimization over a Compact Manifold
Necdet Serhat Aybat, Jiang Hu, Zhanwang Deng
We study the minimax problem , where is a compact submanifold, is continuously differentiable in , is a closed, weak…
Accelerated Gradient Methods with Biased Gradient Estimates: Risk Sensitivity, High-Probability Guarantees, and Large Deviation Bounds
Mert Gürbüzbalaban, Yasa Syed, Necdet Serhat Aybat
We study trade-offs between convergence rate and robustness to gradient errors in the context of first-order methods. Our focus is on generalized momentum methods (GMMs)--a broad c…
Adaptive Algorithms for Robust Phase Retrieval
Zhong Zheng, Necdet Serhat Aybat, Shiqian Ma +1
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: th…
AGDA+: Proximal Alternating Gradient Descent Ascent Method with a Nonmonotone Adaptive Step-Size Search for Nonconvex Minimax Problems
Xuan Zhang, Qiushui Xu, Necdet Serhat Aybat
We consider double-regularized nonconvex-strongly concave (NCSC) minimax problems of the form , where , ar…