Copertina

Bundle EXTRA for Decentralized Optimization

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Liu, Haijuan, Zheng, Zhuoqing, Li, Cong, Xu, Wenying, Wu, Xuyang
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Optimization and Control 90C25, 68W15
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Distributed Computing for Huge-Scale Aggregative Convex Programming
di: Tao, Luoyi
Pubblicazione: (2026)

DualFL: A Duality-based Federated Learning Algorithm with Communication Acceleration in the General Convex Regime
di: Park, Jongho, et al.
Pubblicazione: (2023)

Decentralized Optimization in Networks with Arbitrary Delays
di: Ortega, Tomas, et al.
Pubblicazione: (2024)

SUDA-Muon: Structural Design Principles and Boundaries for Fully Decentralized Muon
di: Zhang, Hengrui, et al.
Pubblicazione: (2026)

Distributed Gradient-Regularized Newton Method: Scheduled Consensus and O(epsilon^{-1}) Global Iteration Complexity
di: Hu, Wei, et al.
Pubblicazione: (2026)

Decentralized Optimization in Time-Varying Networks with Arbitrary Delays
di: Ortega, Tomas, et al.
Pubblicazione: (2024)

CompressedScaffnew: The First Theoretical Double Acceleration of Communication from Local Training and Compression in Distributed Optimization
di: Condat, Laurent, et al.
Pubblicazione: (2022)

The Güler-type acceleration for proximal gradient, linearized augmented Lagrangian and linearized alternating direction method of multipliers
di: Zhou, Bin, et al.
Pubblicazione: (2025)

A Heuristic Alternating Direction Method of Multipliers Framework for Distributed and Centralized Tree-Constrained Optimization: Applications to Hop-Constrained Spanning Tree Multicommodity Flow Design
di: Mokhtari, Yacine
Pubblicazione: (2025)

On semidefinite programming characterizations of the numerical radius and its dual norm for quaternionic matrices
di: Friedland, Shmuel
Pubblicazione: (2023)

On the boundedness of the sequence generated by minibatch stochastic gradient descent
di: Bauschke, Heinz H., et al.
Pubblicazione: (2025)

A distributed proximal splitting method with linesearch for locally Lipschitz gradients
di: Atenas, Felipe, et al.
Pubblicazione: (2024)

A New Decomposition Paradigm for Graph-structured Nonlinear Programs via Message Passing
di: Ding, Kuangyu, et al.
Pubblicazione: (2025)

On semidefinite programming characterizations of the numerical radius and its dual norm
di: Friedland, Shmuel, et al.
Pubblicazione: (2023)

Compressed and Sparse Models for Non-Convex Decentralized Learning
di: Campbell, Andrew, et al.
Pubblicazione: (2023)

Distributed Computing for Huge-Scale Linear Programming
di: Tao, Luoyi
Pubblicazione: (2024)

Connections between convex optimization algorithms and subspace correction methods
di: Jiang, Boou, et al.
Pubblicazione: (2025)

Decentralized Parameter-Free Online Learning
di: Ortega, Tomas, et al.
Pubblicazione: (2025)

Riemannian Federated Learning via Averaging Gradient Streams
di: Huang, Zhenwei, et al.
Pubblicazione: (2024)

Loss Minimization for Electrical Flows over Spanning Trees on Grids
di: Ito, Takehiro, et al.
Pubblicazione: (2024)

Decentralized Parameter-Free Online Learning with Compressed Gossip
di: Ortega, Tomas, et al.
Pubblicazione: (2026)

Complexity of Geometric programming in the Turing model and application to nonnegative tensors
di: Friedland, Shmuel, et al.
Pubblicazione: (2023)

Uniform Value and Decidability in Ergodic Blind Stochastic Games
di: Chatterjee, Krishnendu, et al.
Pubblicazione: (2024)

Stable gradient-adjusted root mean square propagation on least squares problem
di: Li, Runze, et al.
Pubblicazione: (2024)

A Speed-up for Helsgaun's TSP Heuristic by Relaxing the Positive Gain Criterion
di: Ammann, Sabrina C. L., et al.
Pubblicazione: (2024)

Stochastic versus Deterministic in Stochastic Gradient Descent
di: Li, Runze, et al.
Pubblicazione: (2025)

Improved approximation ratios for the Quantum Max-Cut problem on general, triangle-free and bipartite graphs
di: Gribling, Sander, et al.
Pubblicazione: (2025)

Primal-Dual Coordinate Descent for Nonconvex-Nonconcave Saddle Point Problems Under the Weak MVI Assumption
di: Walwil, Iyad, et al.
Pubblicazione: (2025)

Topological structure and a polynomial-time solution of linear programming over the real numbers
di: Wei, Jing-Yuan
Pubblicazione: (2018)

A non-iterative polynomial algorithm for linear programming
di: Jing-Yuan, Wei
Pubblicazione: (2013)

An accelerated randomized Bregman-Kaczmarz method for strongly convex linearly constraint optimization
di: Tondji, Lionel, et al.
Pubblicazione: (2025)

Federated Learning on Riemannian Manifolds with Differential Privacy
di: Huang, Zhenwei, et al.
Pubblicazione: (2024)

A semiconcavity approach to stability of entropic plans and exponential convergence of Sinkhorn's algorithm
di: Chiarini, Alberto, et al.
Pubblicazione: (2024)

Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
di: Nesterov, Yurii
Pubblicazione: (2025)

Communication Compression for Distributed Learning without Control Variates
di: Ortega, Tomas, et al.
Pubblicazione: (2024)

Communication Compression for Distributed Learning with Aggregate and Server-Guided Feedback
di: Ortega, Tomas, et al.
Pubblicazione: (2025)

Convergence of iterates and improved rates for accelerated augmented Lagrangian methods for linearly constrained convex optimization
di: He, Xin, et al.
Pubblicazione: (2026)

Exactness and Effective Degree Bound of Lasserre's Relaxation for Polynomial Optimization over Finite Variety
di: Hua, Zheng, et al.
Pubblicazione: (2021)

Improved Regret Guarantees for Online Mirror Descent using a Portfolio of Mirror Maps
di: Gupta, Swati, et al.
Pubblicazione: (2026)

Distributed Parallel Structure-Aware Presolving for Arrowhead Linear Programs
di: Kempke, Nils-Christian, et al.
Pubblicazione: (2026)