Cover Image

A Heuristic Alternating Direction Method of Multipliers Framework for Distributed and Centralized Tree-Constrained Optimization: Applications to Hop-Constrained Spanning Tree Multicommodity Flow Design

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Mokhtari, Yacine
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 68R10, 68W10, 68W15, 90C11, 90C27, 90C30
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Optimal Online Bipartite Matching in Degree-2 Graphs
by: Bhangale, Amey, et al.
Published: (2025)

Spectrally Constrained Optimization
by: Garner, Casey, et al.
Published: (2023)

Exact recovery for seeded graph matching
by: Fraiman, Nicolas, et al.
Published: (2026)

General Constrained Matrix Optimization
by: Garner, Casey, et al.
Published: (2024)

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

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

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

Distributed Computing for Huge-Scale Linear Programming
by: Tao, Luoyi
Published: (2024)

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

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

Weighted domination models and randomized heuristics
by: Dijkstra, Lukas, et al.
Published: (2022)

On Covering Euclidean Space with Q-arrangements of Cones
by: Ghorbal, Khalil, et al.
Published: (2022)

Quantized and Asynchronous Federated Learning
by: Ortega, Tomas, et al.
Published: (2024)

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

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

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

Similarity-based fuzzy clustering scientific articles: potentials and challenges from mathematical and computational perspectives
by: Huong, Vu Thi, et al.
Published: (2025)

Delayed Feedback in Online Non-Convex Optimization: A Non-Stationary Approach with Applications
by: Lara, Felipe, et al.
Published: (2024)

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

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

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

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

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

Multiprocessor Scheduling with Memory Constraints: Fundamental Properties and Finding Optimal Solutions
by: Papp, Pál András, et al.
Published: (2025)

A Matrix Optimization Method for Blind Extraction of External Equitable Partitions from Low Pass Graph Signals
by: Teng, Wenshun, et al.
Published: (2025)

A simple Path-based LP Relaxation for Directed Steiner Tree
by: Pashkovich, Kanstantsin, et al.
Published: (2026)

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

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

Bundle EXTRA for Decentralized Optimization
by: Liu, Haijuan, et al.
Published: (2026)

Greedy and randomized heuristics for optimization of k-domination models in digraphs and road networks
by: Dijkstra, Lukas, et al.
Published: (2024)

Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity
by: Bansal, Ishan, et al.
Published: (2024)

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

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

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

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

Efficient Multi-Processor Scheduling in Increasingly Realistic Models
by: Papp, Pál András, et al.
Published: (2024)

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

The Generalized Double Pouring Problem: Analysis, Bounds and Algorithms
by: Jäger, Gerold, et al.
Published: (2025)

A $5$-Approximation Analysis for the Cover Small Cuts Problem
by: Simmons, Miles, et al.
Published: (2026)

Identifying Critical Pathways in Coronary Heart Disease via Fuzzy Subgraph Connectivity
by: Ali, Shanookha, et al.
Published: (2025)