Online distributed algorithms for mixed equilibrium problems in dynamic environments
From MaRDI portal
Cites work
- A distributed algorithm for solving mixed equilibrium problems
- A proximal dynamic approach to equilibrium problems with finite-time convergence
- A qualitative mathematical analysis of a class of linear variational inequalities via semi-complementarity problems: applications in electronics
- A Saddle Point Algorithm for Networked Online Convex Optimization
- An inertial-like proximal algorithm for equilibrium problems
- Convergence in high probability of distributed stochastic gradient descent algorithms
- DAdam: a consensus-based distributed adaptive gradient method for online optimization
- Distributed ergodic algorithms for mixed equilibrium problems: absent of cut property
- Distributed Mirror Descent for Online Composite Optimization
- Distributed Nash equilibrium seeking under partial-decision information via the alternating direction method of multipliers
- Distributed Online Convex Optimization on Time-Varying Directed Graphs
- Distributed Online Convex Optimization With Time-Varying Coupled Inequality Constraints
- Distributed Online Optimization for Multi-Agent Networks With Coupled Inequality Constraints
- Distributed Online Optimization in Dynamic Environments Using Mirror Descent
- Distributed Online Optimization With Long-Term Constraints
- Distributed Seeking of Time-Varying Nash Equilibrium for Non-Cooperative Games
- Distributed strategies for mixed equilibrium problems: continuous-time theoretical approaches
- Distributed Subgradient Methods for Multi-Agent Optimization
- Dual decomposition for multi-agent distributed optimization with coupling constraints
- Extragradient algorithms extended to equilibrium problems¶
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Modified Popov's explicit iterative algorithms for solving pseudomonotone equilibrium problems
- MONOTONE AND PSEUDO-MONOTONE EQUILIBRIUM PROBLEMS IN HADAMARD SPACES
- Nash equilibria: the variational approach
- New splitting algorithm for mixed equilibrium problems on Hilbert spaces
- Online distributed algorithms for online noncooperative games with stochastic cost functions: high probability bound of regrets
- Online Distributed Convex Optimization on Dynamic Networks
- Online distributed nonconvex optimization with stochastic objective functions: high probability bound analysis of dynamic regrets
- Online distributed optimization with strongly pseudoconvex-sum cost functions and coupled inequality constraints
- Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization
- Robust Stochastic Approximation Approach to Stochastic Programming
- Weak convergence of explicit extragradient algorithms for solving equilibrium problems
This page was built for publication: Online distributed algorithms for mixed equilibrium problems in dynamic environments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6851101)
