:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Ding, Shihong, Yang, Long, Luo, Luo, Fang, Cong
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2407.14839
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Accelerating Single-Pass SGD for Generalized Linear Prediction
by: Chen, Qian, et al.
Published: (2026)

Near-optimal and Efficient First-Order Algorithm for Multi-Task Learning with Shared Linear Representation
by: Ding, Shihong, et al.
Published: (2026)

Near-Optimal Tensor PCA via Normalized Stochastic Gradient Ascent with Overparameterization
by: Ding, Shihong, et al.
Published: (2025)

Smooth Quasar-Convex Optimization with Constraints
by: Martínez-Rubio, David
Published: (2025)

Online Non-Stationary Stochastic Quasar-Convex Optimization
by: Pun, Yuen-Man, et al.
Published: (2024)

Improved Dynamic Regret of Distributed Online Multiple Frank-Wolfe Convex Optimization
by: Zhang, Wentao, et al.
Published: (2023)

A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization
by: Ren, Kunjie, et al.
Published: (2025)

Faster Newton Methods for Convex and Nonconvex Optimization in Gradient Complexity
by: Chen, Lesi, et al.
Published: (2025)

On the Complexity of Finite-Sum Smooth Optimization under the Polyak-Łojasiewicz Condition
by: Bai, Yunyan, et al.
Published: (2024)

Faster Stochastic Algorithms for Minimax Optimization under Polyak--Łojasiewicz Conditions
by: Chen, Lesi, et al.
Published: (2023)

Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps
by: Zhang, Wentao, et al.
Published: (2025)

Passivity-Based Local Design Conditions for Global Optimality in Distributed Convex Optimization
by: Jane-Soneira, Pol, et al.
Published: (2025)

Robust Learning Meets Quasar-Convex Optimization: Inexact High-Order Proximal-Point Methods
by: Kabgani, Alireza, et al.
Published: (2026)

Near-Optimal Distributed Minimax Optimization under the Second-Order Similarity
by: Zhou, Qihao, et al.
Published: (2024)

Sparse Convex Quantile Regression: A Generalized Benders Decomposition Approach
by: Luo, Xiaoyu, et al.
Published: (2025)

General Distribution Steering: A Sub-Optimal Solution by Convex Optimization
by: Wu, Guangyu, et al.
Published: (2023)

A Proximal Method for Composite Optimization with Smooth and Convex Components
by: Uzun, Samet, et al.
Published: (2025)

A Partition-Based Implementation of the Relaxed ADMM for Distributed Convex Optimization over Lossy Networks
by: Bastianello, Nicola, et al.
Published: (2018)

Distributed Stochastic Optimization for Non-Smooth and Weakly Convex Problems under Heavy-Tailed Noise
by: Hu, Jun, et al.
Published: (2025)

Quantized Distributed Nonconvex Optimization Algorithms with Linear Convergence under the Polyak--$Ł$ojasiewicz Condition
by: Xu, Lei, et al.
Published: (2022)

Adaptive Accelerated Gradient Descent Methods for Convex Optimization
by: Xu, Zeyi, et al.
Published: (2026)

The Generalized Multiplicative Gradient Method for A Class of Convex Optimization Problems Over Symmetric Cones
by: Zhao, Renbo
Published: (2022)

PAPAL: A Provable PArticle-based Primal-Dual ALgorithm for Mixed Nash Equilibrium
by: Ding, Shihong, et al.
Published: (2023)

A Cutting-plane and Benders' Decomposition Algorithm for Two-Stage Distributionally Robust Convex programs
by: Luo, Fengqiao, et al.
Published: (2021)

Distributed Event-Triggered Bandit Convex Optimization with Time-Varying Constraints
by: Zhang, Kunpeng, et al.
Published: (2024)

Sensitivity-Based Distributed Programming for Non-Convex Optimization
by: von Esch, Maximilian Pierer, et al.
Published: (2025)

Stochastic Decentralized Optimization of Non-Smooth Convex and Convex-Concave Problems over Time-Varying Networks
by: Divilkovskiy, Maxim, et al.
Published: (2025)

Optimal Asynchronous Stochastic Nonconvex Optimization under Heavy-Tailed Noise
by: Wu, Yidong, et al.
Published: (2026)

From Optimization to Satisficing: Robust Screening under Distributional Ambiguity
by: Ma, Shumin, et al.
Published: (2026)

Decentralized Gradient-Free Methods for Stochastic Non-Smooth Non-Convex Optimization
by: Lin, Zhenwei, et al.
Published: (2023)

Distributed Prediction-Correction ADMM for Time-Varying Convex Optimization
by: Bastianello, Nicola, et al.
Published: (2020)

Distributed and Inexact Proximal Gradient Method for Online Convex Optimization
by: Bastianello, Nicola, et al.
Published: (2020)

A Class of Convex Optimization-Based Recursive Algorithms for Identification of Stochastic Systems
by: Ding, Mingxia, et al.
Published: (2024)

On the Linear Speedup of the Push-Pull Method for Decentralized Optimization over Digraphs
by: Liang, Liyuan, et al.
Published: (2025)

A Scalable Bundle Method for Exact Reformulation of SDP in Three-Phase Power Flow Feasibility
by: Fang, Bohang, et al.
Published: (2026)

DRAG: Distributed Resource Allocation Games over Multiple Interacting Coalitions
by: Zhou, Jialing, et al.
Published: (2022)

Differentially Private Non-Convex Optimization under the KL Condition with Optimal Rates
by: Menart, Michael, et al.
Published: (2023)

Decentralized Stochastic Nonconvex Optimization under the Relaxed Smoothness
by: Luo, Luo, et al.
Published: (2025)

On Distributionally Robust Multistage Convex Optimization: New Algorithms and Complexity Analysis
by: Zhang, Shixuan, et al.
Published: (2020)

On Distributionally Robust Multistage Convex Optimization: Data-driven Models and Performance
by: Zhang, Shixuan, et al.
Published: (2022)