scientific article; zbMATH DE number 6508162
From MaRDI portal
Publication:3452587
asynchronous algorithmsdynamic programminglinear systemsmonographnetwork flow analysisparallel computer systemparallel computersparallel numerical algorithmsparallel processingshortest path problemsynchronous algorithms
Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Direct numerical methods for linear systems and matrix inversion (65F05) Iterative numerical methods for linear systems (65F10) Numerical computation of solutions to systems of equations (65H10) Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Computer aspects of numerical algorithms (65Yxx) Distributed algorithms (68W15)
Cited in
(56)- On unbounded delays in asynchronous parallel fixed-point algorithms
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- An interior point-proximal method of multipliers for convex quadratic programming
- A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints
- Opinion dynamics with limited information
- A self-adaptive descent LQP alternating direction method for the structured variational inequalities
- On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming
- Hierarchical decompositions for MPC of resource constrained control systems: applications to building energy management
- Inertial forward-backward splitting method in Banach spaces with application to compressed sensing
- Grid solution of problem with unilateral constraints
- Online learning over a decentralized network through ADMM
- On the robust synthesis of logical consensus algorithms for distributed intrusion detection
- Distributed fixed point method for solving systems of linear algebraic equations
- On the convergence analysis of asynchronous SGD for solving consistent linear systems
- Noise-to-state exponentially stable distributed convex optimization on weight-balanced digraphs
- A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks
- Load balancing in dynamic networks by bounded delays asynchronous diffusion
- Distributed linear programming with event-triggered communication
- Parallel Computing
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 795729 (Why is no real title available?)
- A Kaczmarz Algorithm for Solving Tree Based Distributed Systems of Equations
- Decentralized dictionary learning over time-varying digraphs
- Opinion dynamics with limited information
- Block Policy Mirror Descent
- An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant
- Laplacian-based semi-supervised learning in multilayer hypergraphs by coordinate descent
- Cooperative distributed extremum seeking control for coupled multiagent systems based on distributed identification-gradient tracking
- On the convergence of inexact alternate minimization in problems with \(\ell_0\) penalties
- Distributed algorithms of solving linear matrix equations via double-layered networks
- Iterative distributed model predictive control for heterogeneous systems with non-convex coupled constraints
- Stochastic mirror descent for convex optimization with consensus constraints
- On substochastic inverse eigenvalue problems with the corresponding eigenvector constraints
- Adaptive consensus: a network pruning approach for decentralized optimization
- Balancing communication and computation in gradient tracking algorithms for decentralized optimization
- Lattice-based homomorphic encryption for distributed privacy protection
- Revisit iterative complexity of some projection-type methods for monotone linear variational inequality problems
- Heterogeneous unknown multi-agent systems over switching networks: a distributed optimal coordination design
- Exponential convergence of a distributed divide-and-conquer algorithm for constrained convex optimization on networks
- A non-convex optimization approach of searching algebraic degree phase-type representations for general phase-type distributions
- Nesterov's accelerated Jacobi-type methods for large-scale symmetric positive semidefinite linear systems
- Privacy-preserving optimization algorithm for distributed energy management over time-varying graphs: a state decomposition method
- The role of local steps in local SGD
- A flexible gradient tracking algorithmic framework for decentralized optimization
- Frugal and decentralised resolvent splittings defined by nonexpansive operators
- Projection free methods on product domains
- Brief announcement: A case for Byzantine machine learning
- A guide to stochastic optimisation for large-scale inverse problems
- Block majorization-minimization with diminishing radius for constrained nonsmooth nonconvex optimization
- Meso-scale coalitional control in large-scale networks
- Optimal reconstruction of water-waves from noisy pressure measurements at the seabed
- A learned proximal alternating minimization algorithm and its induced network for a class of two-block nonconvex and nonsmooth optimization
- General inertial alternating structure-adapted proximal gradient descent method for solving nonseparable nonconvex optimization problems
- Near-linear runtime for a classical matrix preconditioning algorithm
- Additive-effect assisted learning
- Counting triangles of graphs via randomized trace estimation with incomplete matrix-vector products
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452587)
