Alternating projection method for intersection of convex sets, multi-agent consensus algorithms, and averaging inequalities
From MaRDI portal
Publication:6552619
DOI10.1134/s0965542524700155MaRDI QIDQ6552619
I. S. Zabarianska, Anton V. Proskurnikov
Publication date: 10 June 2024
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
convex programmingdistributed algorithmsmulti-agent systemsconsensusalternating projection methodFejér mappings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Closed Fejer cycles for inconsistent systems of convex inequalities
- Problems and methods of network control
- Distributed coordination of multi-agent networks. Emergent problems, models, and issues.
- Fejér processes in theory and practice: recent results
- On infinite products of stochastic matrices
- Über die Lage der Nullstellen von Polynomen, die aus Minimumforderungen gewisser Arten entspringen.
- Differential inequalities in multi-agent coordination and opinion dynamics modeling
- Distributed Fejer processes for systems of linear inequalities and problems of linear programming
- Forest matrices around the Laplacian matrix
- Randomized optimal consensus of multi-agent systems
- Operators and iterative processes of Fejér type. Theory and applications.
- On efficient randomized algorithms for finding the PageRank vector
- On backward product of stochastic matrices
- Regularization-based solution of the PageRank problem for large matrices
- Distributed consensus in multi-vehicle cooperative control. Theory and applications.
- On the speed of convergence in the method of Fejer approximations
- Angenäherte Auflösung von Systemen linearer Gleichungen.
- Robust Consensus for Continuous-Time Multiagent Dynamics
- Consensus Algorithms and the Decomposition-Separation Theorem
- A Distributed Algorithm for Solving a Linear Algebraic Equation
- Constrained Consensus in Unbalanced Networks With Communication Delays
- Convergence Speed in Distributed Consensus and Averaging
- Leontief models, Markov chains, substochastic matrices, and positive solutions of matrix equations
- Finitely-convergent recurrent algorithms for solving target inequalities with constraints
- A Distributed Algorithm for Computing a Common Fixed Point of a Finite Family of Paracontractions
- On Projection Algorithms for Solving Convex Feasibility Problems
- Constrained Consensus and Optimization in Multi-Agent Networks
- Randomized Kaczmarz Converges Along Small Singular Vectors
- Consensus Optimization on Manifolds
- Mathematical diagnostics via nonsmooth analysis
- Reaching an Optimal Consensus: Dynamical Systems That Compute Intersections of Convex Sets
- Alternating Projections on Manifolds
- The method of projections for finding the common point of convex sets
- The application of the method of Fejer approximations to the solution of problems of convex programming with non-smooth constraints
- Functional Operators (AM-22), Volume 2
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- Delay Robustness of Consensus Algorithms: Continuous-Time Theory
This page was built for publication: Alternating projection method for intersection of convex sets, multi-agent consensus algorithms, and averaging inequalities