A distributed continuous-time modified Newton-Raphson algorithm
From MaRDI portal
Publication:2063762
DOI10.1016/j.automatica.2021.109886zbMath1483.90120arXiv2105.09443OpenAlexW3197519128MaRDI QIDQ2063762
Hossein Moradian, Solmaz S. Kia
Publication date: 3 January 2022
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.09443
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Convexity of the inverse and Moore-Penrose inverse
- Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication
- Newton-Raphson Consensus for Distributed Convex Optimization
- A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
- Distributed Subgradient Methods for Multi-Agent Optimization
- A Fast Distributed Asynchronous Newton-Based Optimization Algorithm
- Robust Dynamic Average Consensus Algorithms
- Multiagent Newton–Raphson Optimization Over Lossy Networks
- On Distributed Convex Optimization Under Inequality and Equality Constraints
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- Zero-Gradient-Sum Algorithms for Distributed Convex Optimization: The Continuous-Time Case
- Distributed Average Tracking of Multiple Time-Varying Reference Signals With Bounded Derivatives
This page was built for publication: A distributed continuous-time modified Newton-Raphson algorithm