Distributed Proximal Algorithms for Multiagent Optimization With Coupled Inequality Constraints
From MaRDI portal
Recommendations
- Distributed proximal-gradient method for convex optimization with inequality constraints
- Distributed proximal‐gradient algorithms for nonsmooth convex optimization of second‐order multiagent systems
- Dual decomposition for multi-agent distributed optimization with coupling constraints
- Distributed decision-coupled constrained optimization via proximal-tracking
- Distributed primal-dual stochastic subgradient algorithms for multi-agent optimization under inequality constraints
- Distributed Online Optimization for Multi-Agent Networks With Coupled Inequality Constraints
- Distributed Continuous-Time Nonsmooth Convex Optimization With Coupled Inequality Constraints
- On Distributed Convex Optimization Under Inequality and Equality Constraints
- Distributed Optimization With Coupling Constraints
- Distributed Coupled Multiagent Stochastic Optimization
Cited in
(18)- Proximal ADMM for nonconvex and nonsmooth optimization
- Distributed solver for linear matrix inequalities: an optimization perspective
- Distributed Coupled Multiagent Stochastic Optimization
- An asynchronous subgradient-proximal method for solving additive convex optimization problems
- Resilient penalty function method for distributed constrained optimization under Byzantine attack
- Distributed strategies for mixed equilibrium problems: continuous-time theoretical approaches
- On the linear convergence of distributed Nash equilibrium seeking for multi-cluster games under partial-decision information
- Fixed-time neural networks with time-invariant and time-varying coefficients for mixed variational inequalities
- Distributed Proximal Algorithms for Multi-Agent Optimization with Coupled Inequality Constraints
- Distributed primal-dual method on unbalanced digraphs with row stochasticity
- Distributed event-triggered algorithm for convex optimization with coupled constraints
- Distributed Ishikawa algorithms for seeking the fixed points of multi-agent global operators over time-varying communication graphs
- Achieving violation-free distributed optimization under coupling constraints
- Distributed safe control design and probabilistic safety verification for multi-agent systems
- Hierarchically distributed optimization with a flexible and complexity-reducing algorithm
- Linear convergence for distributed stochastic optimization with coupled inequality constraints
- Distributed aggregative optimization with affine coupling constraints
- Distributed proximal algorithms for constrained resource allocation over continuous and discrete communication
This page was built for publication: Distributed Proximal Algorithms for Multiagent Optimization With Coupled Inequality Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4990169)