Cover Image

Optimal Decentralized Composite Optimization for Convex Functions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ye, Haishan, Chang, Xiangyu
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Can a One-Point Feedback Zeroth-order Algorithm Achieve Linear Dimension Dependent Sample Complexity?
by: Ye, Haishan, et al.
Published: (2025)

A Unified Zeroth-Order Optimization Framework via Oblivious Randomized Sketching
by: Ye, Haishan, et al.
Published: (2025)

High-Probability Guarantees for Random Zeroth-Order Gradient Descent on Smooth Functions
by: Ye, Haishan
Published: (2026)

An Efficient Stochastic Algorithm for Decentralized Nonconvex-Strongly-Concave Minimax Optimization
by: Chen, Lesi, et al.
Published: (2022)

Stochastic Non-Smooth Non-Convex Optimization with Decision-Dependent Distributions
by: Liu, Chengchang, et al.
Published: (2026)

Anderson Acceleration Without Restart: A Novel Method with $n$-Step Super Quadratic Convergence Rate
by: Ye, Haishan, et al.
Published: (2024)

Double Variance Reduction: A Smoothing Trick for Composite Optimization Problems without First-Order Gradient
by: Di, Hao, et al.
Published: (2024)

A Parameter-free Decentralized Algorithm for Composite Convex Optimization
by: Chen, Xiaokai, et al.
Published: (2025)

Why Does Adaptive Zeroth-Order Optimization Work?
by: Ye, Haishan, et al.
Published: (2026)

Explicit and Non-asymptotic Query Complexities of Rank-Based Zeroth-order Algorithm on Stochastic Smooth Functions
by: Ye, Haishan
Published: (2025)

On the Complexity of Decentralized Smooth Nonconvex Finite-Sum Optimization
by: Luo, Luo, et al.
Published: (2022)

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

High-Probability Guarantees for Random Zeroth-Order (Stochastic) Gradient Descent
by: Ye, Haishan
Published: (2026)

Adaptive Stepsize Selection in Decentralized Convex Optimization
by: Kuruzov, Ilya, et al.
Published: (2025)

Optimal Decentralized Smoothed Online Convex Optimization
by: Bhuyan, Neelkamal, et al.
Published: (2024)

Non-Stationary Bandit Convex Optimization: An Optimal Algorithm with Two-Point Feedback
by: He, Chang, et al.
Published: (2025)

Optimal Gradient Tracking for Decentralized Optimization
by: Song, Zhuoqing, et al.
Published: (2021)

Optimal Acceleration for Proximal Minimization of the Sum of Convex and Strongly Convex Functions
by: Chari, Govind M., et al.
Published: (2026)

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

The Optimal Smoothings of Sublinear Functions and Convex Cones
by: Samakhoana, Thabo, et al.
Published: (2025)

Uniformly Optimal and Parameter-free First-order Methods for Convex and Function-constrained Optimization
by: Deng, Qi, et al.
Published: (2024)

A Parameter-Free Zeroth-Order Algorithm for Decentralized Stochastic Convex Optimization
by: Chen, Jiawei, et al.
Published: (2026)

Decentralized Riemannian Conjugate Gradient Method on the Stiefel Manifold
by: Chen, Jun, et al.
Published: (2023)

Learning-Augmented Decentralized Online Convex Optimization in Networks
by: Li, Pengfei, et al.
Published: (2023)

Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks
by: Kovalev, Dmitry, et al.
Published: (2024)

Entropic Optimal Transport Problem with Convex Functional Cost
by: Kazeykina, Anna, et al.
Published: (2025)

On the Optimal Time Complexities in Decentralized Stochastic Asynchronous Optimization
by: Tyurin, Alexander, et al.
Published: (2024)

Weak Proximal Newton Oracles for Composite Convex Optimization
by: Garber, Dan
Published: (2025)

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

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

Estimating Sequences with Memory for Minimizing Convex Non-smooth Composite Functions
by: Dosti, Endrit, et al.
Published: (2025)

Two Innovations in Inexact Augmented Lagrangian Methods for Convex Optimization
by: Eckstein, Jonathan, et al.
Published: (2025)

Near-Optimal Convex Simple Bilevel Optimization with a Bisection Method
by: Wang, Jiulin, et al.
Published: (2024)

Faster Stochastic ADMM for Nonsmooth Composite Convex Optimization in Hilbert Space
by: Deng, Weihua, et al.
Published: (2026)

Preference-Optimized Pareto Set Learning for Blackbox Optimization
by: Haishan, Zhang, et al.
Published: (2024)

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

Solving Convex Smooth Function Constrained Optimization Is Almost As Easy As Unconstrained Optimization
by: Zhang, Zhe, et al.
Published: (2022)

Duality for Non Convex Composite Functions via the Fenchel Rockafellar Perturbation Framework
by: Latorre, Vittorio
Published: (2025)

Optimal Rates for Robust Stochastic Convex Optimization
by: Gao, Changyu, et al.
Published: (2024)

Convexity in Optimal Control Problems
by: Abhijeet, et al.
Published: (2024)