Newton-Raphson Consensus for Distributed Convex Optimization
From MaRDI portal
Publication:2980605
DOI10.1109/TAC.2015.2449811zbMath1359.90099arXiv1511.01509OpenAlexW2811008754MaRDI QIDQ2980605
Luca Schenato, Filippo Zanella, Damiano Varagnolo, Gianluigi Pillonetto, Angelo Cenedese
Publication date: 3 May 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.01509
Related Items (34)
Distributed adaptive Newton methods with global superlinear convergence ⋮ Exponential convergence of distributed optimization for heterogeneous linear multi-agent systems over unbalanced digraphs ⋮ A distributed simultaneous perturbation approach for large-scale dynamic optimization problems ⋮ Distributed smooth optimisation with event-triggered proportional-integral algorithms ⋮ Is ADMM always faster than average consensus? ⋮ Binary classification posed as a quadratically constrained quadratic programming and solved using particle swarm optimization ⋮ Distributed Line Search for Multiagent Convex Optimization ⋮ Distributed second-order continuous-time optimization via adaptive algorithm with nonuniform gradient gains ⋮ A unitary distributed subgradient method for multi-agent optimization with different coupling sources ⋮ Cluster-based distributed augmented Lagrangian algorithm for a class of constrained convex optimization problems ⋮ A locally convergent continuous-time algorithm to find all the roots of a time-varying polynomial ⋮ Subgradient averaging for multi-agent optimisation with different constraint sets ⋮ A distributed methodology for approximate uniform global minimum sharing ⋮ Exponential convergence of a distributed algorithm for solving linear algebraic equations ⋮ Convergence rate analysis of distributed optimization with projected subgradient algorithm ⋮ Distributed optimal in-network resource allocation algorithm design via a control theoretic approach ⋮ Tracking-ADMM for distributed constraint-coupled optimization ⋮ Collaborative neurodynamic optimization for solving nonlinear equations ⋮ Two-timescale recurrent neural networks for distributed minimax optimization ⋮ Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication ⋮ Distributed continuous‐time constrained convex optimization with general time‐varying cost functions ⋮ Distributed fixed-time cluster optimisation for multi-agent systems ⋮ A novel dynamic event-triggered mechanism for dynamic average consensus ⋮ An event-triggered collaborative neurodynamic approach to distributed global optimization ⋮ Distributed finite‐time optimization algorithms for multi‐agent systems under directed graphs ⋮ A distributed fixed-time optimization algorithm for multi-agent systems ⋮ Distributed constrained stochastic subgradient algorithms based on random projection and asynchronous broadcast over networks ⋮ Distributed approximate Newton algorithms and weight design for constrained optimization ⋮ Noise-to-State Exponentially Stable Distributed Convex Optimization on Weight-Balanced Digraphs ⋮ Partition-based multi-agent optimization in the presence of lossy and asynchronous communication ⋮ Distributed decision-coupled constrained optimization via proximal-tracking ⋮ A distributed continuous-time modified Newton-Raphson algorithm ⋮ Triggered gradient tracking for asynchronous distributed optimization ⋮ Newton-like Method with Diagonal Correction for Distributed Optimization
This page was built for publication: Newton-Raphson Consensus for Distributed Convex Optimization
