:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Qin, Lei, Pu, Ye
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2508.06922
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Convergence Analysis of Noisy Distributed Gradient Descent for Non-convex Optimization -- Saddle Point Escape
by: Qin, Lei, et al.
Published: (2025)

Convergence Analysis of EXTRA in Non-convex Distributed Optimization
by: Qin, Lei, et al.
Published: (2025)

Hessian-guided Perturbed Wasserstein Gradient Flows for Escaping Saddle Points
by: Yamamoto, Naoya, et al.
Published: (2025)

Two-timescale EXTRA for Distributed Smooth Non-convex Optimization
by: Peng, Zeyu, et al.
Published: (2024)

Efficiently Escaping Saddle Points for Policy Optimization
by: Khorasani, Sadegh, et al.
Published: (2023)

Accelerated Gradient Methods for Nonconvex Optimization: Escape Trajectories From Strict Saddle Points and Convergence to Local Minima
by: Dixit, Rishabh, et al.
Published: (2023)

Saddle Point Evasion via Curvature-Regularized Gradient Dynamics
by: Mudrik, Liraz, et al.
Published: (2026)

Curvature-Adaptive Perturbation and Subspace Descent for Robust Saddle Point Escape in High-Dimensional Optimization
by: Katende, Ronald, et al.
Published: (2024)

Efficient Gradient Methods for Distributed Saddle Problems
by: Luo, Ruichen, et al.
Published: (2026)

Efficiently Escaping Saddle Points under Generalized Smoothness via Self-Bounding Regularity
by: Cao, Daniel Yiming, et al.
Published: (2025)

Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms
by: Huang, Minhui, et al.
Published: (2021)

Event-triggered Dual Gradient Tracking for Distributed Resource Allocation
by: Xu, Xiayan, et al.
Published: (2025)

An LP-Based Approach for Bilinear Saddle Point Problem with Instance-dependent Guarantee and Noisy Feedback
by: Jiang, Jiashuo, et al.
Published: (2026)

Proximal Point Method for Online Saddle Point Problem
by: Meng, Qing-xin, et al.
Published: (2024)

Convergence Analysis of Stochastic Saddle Point Mirror Descent Algorithm -- A Projected Dynamical View Point
by: Paul, Anik Kumar, et al.
Published: (2024)

Distributed Saddle-Point Dynamics in Multilayer Networks
by: Rodríguez-Camargo, Christian D., et al.
Published: (2025)

Quantization Avoids Saddle Points in Distributed Optimization
by: Bo, Yanan, et al.
Published: (2024)

Robust Accelerated Primal-Dual Methods for Computing Saddle Points
by: Zhang, Xuan, et al.
Published: (2021)

Spectral Preconditioning for Gradient Methods on Graded Non-convex Functions
by: Doikov, Nikita, et al.
Published: (2024)

Accelerated Primal-Dual Proximal Gradient Splitting Methods for Convex-Concave Saddle-Point Problems
by: Luo, Hao
Published: (2024)

High Probability Convergence Bounds for Non-convex Stochastic Gradient Descent with Sub-Weibull Noise
by: Madden, Liam, et al.
Published: (2020)

Point Convergence of Nesterov's Accelerated Gradient Method: An AI-Assisted Proof
by: Jang, Uijeong, et al.
Published: (2025)

Linear Convergence of a Unified Primal--Dual Algorithm for Convex--Concave Saddle Point Problems with Quadratic Growth
by: Melcher, Cody, et al.
Published: (2025)

Efficient First Order Method for Saddle Point Problems with Higher Order Smoothness
by: Wang, Nuozhou, et al.
Published: (2023)

Decentralized Distributed Optimization for Saddle Point Problems
by: Rogozin, Alexander, et al.
Published: (2021)

Online Resource Allocation with Non-Stationary Customers
by: Zhang, Xiaoyue, et al.
Published: (2024)

A Derivative-Free Saddle-search Algorithm With Linear Convergence Rate
by: Du, Qiang, et al.
Published: (2026)

Point Convergence Analysis of the Accelerated Gradient Method for Multiobjective Optimization: Continuous and Discrete
by: Yin, Yingdong
Published: (2025)

Distributed Normal Map-based Stochastic Proximal Gradient Methods over Networks
by: Huang, Kun, et al.
Published: (2024)

One-Point Residual Feedback Algorithms for Distributed Online Convex and Non-convex Optimization
by: Wang, Yaowen, et al.
Published: (2025)

Direct Spectral Acceleration of First-Order Methods for Saddle Point Problems with Bilinear Coupling
by: Li, Meng, et al.
Published: (2026)

Primal-dual Accelerated Mirror-Descent Method for Constrained Bilinear Saddle-Point Problems
by: Li, Weijian, et al.
Published: (2024)

Distributed Random Reshuffling Methods with Improved Convergence
by: Huang, Kun, et al.
Published: (2023)

Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization
by: Abe, Kenshi, et al.
Published: (2025)

Policy Gradient Methods for Risk-Sensitive Distributional Reinforcement Learning with Provable Convergence
by: Xiao, Minheng, et al.
Published: (2024)

Federated Composite Saddle Point Optimization
by: Bai, Site, et al.
Published: (2023)

Single-loop Projection-free and Projected Gradient-based Algorithms for Nonconvex-concave Saddle Point Problems with Bilevel Structure
by: Ahmadi, Mohammad Mahdi, et al.
Published: (2024)

A Randomized Block-Coordinate Primal-Dual Method for Large-scale Stochastic Saddle Point Problems
by: Hamedani, Erfan Yazdandoost, et al.
Published: (2019)

Convergence of the Iterates of the Stochastic Proximal Gradient Method
by: Madariaga, Javier I.
Published: (2026)

On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms
by: Kovalev, Dmitry, et al.
Published: (2024)