A consensus-based algorithm for non-convex multiplayer games
From MaRDI portal
Cites work
- A consensus-based global optimization method for high dimensional machine learning problems
- A consensus-based global optimization method with adaptive momentum estimation
- A consensus-based model for global optimization and its mean-field limit
- A constrained consensus based optimization algorithm and its application to finance
- An adaptive consensus based method for multi-objective optimization with uniform Pareto front approximation
- An algorithmic introduction to numerical simulation of stochastic differential equations
- An analytical framework for consensus-based global optimization method
- An operator splitting approach for distributed generalized Nash equilibria computation
- Anisotropic diffusion in consensus-based optimization on the sphere
- Applied asymptotic analysis
- Approximate Nash Equilibria in Large Nonconvex Aggregative Games
- Consensus-based global optimization with personal best
- Consensus-based optimization and ensemble Kalman inversion for global optimization problems with constraints
- Consensus-Based Optimization for Saddle Point Problems
- Consensus-based optimization methods converge globally
- Consensus-based optimization on hypersurfaces: Well-posedness and mean-field limit
- Consensus-based optimization via jump-diffusion stochastic differential equations
- Consensus‐based sampling
- Constrained Consensus-Based Optimization
- Convergence and error estimates for time-discrete consensus-based optimization algorithms
- Convergence of a first-order consensus-based global optimization algorithm
- Distributed algorithm for \(\varepsilon \)-generalized Nash equilibria with uncertain coupled constraints
- Equilibrium points in n -person games
- Evolutionary multiplayer games
- Game theory and mechanism design
- Handbook of metaheuristics
- scientific article; zbMATH DE number 7626752 (Why is no real title available?)
- Large deviations techniques and applications.
- Leveraging memory effects and gradient information in consensus-based optimisation: on global convergence in mean-field law
- Nonconvex games with side constraints
- On the global convergence of particle swarm optimization methods
- On the mean‐field limit for the consensus‐based optimization
- Piecewise affine parameterized value-function based bilevel non-cooperative games
- Polarized consensus-based dynamics for optimization and sampling
- Self-interacting CBO: existence, uniqueness, and long-time convergence
- Stochastic consensus dynamics for nonconvex optimization on the Stiefel manifold: mean-field limit and convergence
- Weakly-convex-concave min-max optimization: provable algorithms and applications in machine learning
- Zero-inertia limit: from particle swarm optimization to consensus-based optimization
Cited in
(4)- Uniform-in-time mean-field limit estimate for the consensus-based optimization
- A particle consensus approach to solving nonconvex-nonconcave min-max problems
- Well-posedness and mean-field limit estimate of a consensus-based algorithm for multiplayer games
- A provable semi-infinite programming approach for solving constrained dynamic games
This page was built for publication: A consensus-based algorithm for non-convex multiplayer games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6952247)
