Pages that link to "Item:Q4580911"

The following pages link to A Proximal Gradient Algorithm for Decentralized Composite Optimization (Q4580911):

Displaying 38 items.

• A fast proximal gradient algorithm for decentralized composite optimization over directed networks (Q1680665) (← links)
• Distributed Nash equilibrium seeking under partial-decision information via the alternating direction method of multipliers (Q1737796) (← links)
• Distributed consensus-based multi-agent convex optimization via gradient tracking technique (Q1738645) (← links)
• New convergence analysis of a primal-dual algorithm with large stepsizes (Q2026110) (← links)
• On the linear convergence of two decentralized algorithms (Q2032033) (← links)
• Stochastic proximal splitting algorithm for composite minimization (Q2047212) (← links)
• Distributed decision-coupled constrained optimization via proximal-tracking (Q2059328) (← links)
• Solving a class of nonsmooth resource allocation problems with directed graphs through distributed Lipschitz continuous multi-proximal algorithms (Q2063835) (← links)
• Distributed composite optimization for multi-agent systems with asynchrony (Q2094068) (← links)
• Decentralized proximal splitting algorithms for composite constrained convex optimization (Q2170762) (← links)
• Communication-efficient algorithms for decentralized and stochastic optimization (Q2297648) (← links)
• Distributed nonconvex constrained optimization over time-varying digraphs (Q2425183) (← links)
• Surrogate-based distributed optimisation for expensive black-box functions (Q2663899) (← links)
• A distributed methodology for approximate uniform global minimum sharing (Q2665417) (← links)
• Distributed subgradient method for multi-agent optimization with quantized communication (Q2978003) (← links)
• Revisiting EXTRA for Smooth Distributed Optimization (Q3300767) (← links)
• Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs (Q4602346) (← links)
• (Q4637046) (← links)
• Global Convergence Rate of Proximal Incremental Aggregated Gradient Methods (Q4641660) (← links)
• Fejér-monotone hybrid steepest descent method for affinely constrained and composite convex minimization tasks (Q4646540) (← links)
• Forward-Backward-Half Forward Algorithm for Solving Monotone Inclusions (Q4687243) (← links)
• GADMM: Fast and Communication Efficient Framework for Distributed Machine Learning (Q4969135) (← links)
• Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays (Q5058405) (← links)
• Distributed Optimization Based on Gradient Tracking Revisited: Enhancing Convergence Rate via Surrogation (Q5071108) (← links)
• (Q5149230) (← links)
• An Optimal Algorithm for Decentralized Finite-Sum Optimization (Q5162661) (← links)
• Distributed regularized online optimization using forward-backward splitting (Q6063118) (← links)
• A fixed step distributed proximal gradient push‐pull algorithm based on integral quadratic constraint (Q6081040) (← links)
• Composite optimization with coupling constraints via dual proximal gradient method with applications to asynchronous networks (Q6085458) (← links)
• A distributed proximal gradient method with time-varying delays for solving additive convex optimizations (Q6110428) (← links)
• A divide-and-conquer algorithm for distributed optimization on networks (Q6122629) (← links)
• A decentralized smoothing quadratic regularization algorithm for composite consensus optimization with non-Lipschitz singularities (Q6126602) (← links)
• Golden ratio proximal gradient ADMM for distributed composite convex optimization (Q6192034) (← links)
• Distributed continuous-time proximal algorithm for nonsmooth resource allocation problem with coupled constraints (Q6537273) (← links)
• Edge-based distributed primal-dual algorithms for seeking generalized Nash equilibria (Q6545273) (← links)
• A decentralized Nesterov gradient method for stochastic optimization over unbalanced directed networks (Q6578718) (← links)
• Distributed accelerated gradient methods with restart under quadratic growth condition (Q6607027) (← links)
• Majority vote for distributed differentially private sign selection (Q6621542) (← links)