Averaged Subgradient Methods for Constrained Convex Optimization and Nash Equilibria Computation

DOI10.1080/0233193021000066455MaRDI QIDQ4805780zbMATH OpenOpenAlexFDO

Authors Dan Butnariu, Elena Resmerita

Publication date 22 March 2004

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0233193021000066455

zbMATH Keywords

Nash equilibriumnoncooperative \(m\)-person game

Mathematics Subject Classification ID

Noncooperative games (91A10) Methods of reduced gradient type (90C52) (n)-person games, (n>2) (91A06)

Recommendations

• scientific article; zbMATH DE number 1086729
• Paths to constrained Nash equilibria
• scientific article; zbMATH DE number 125268
• Equilibrium programming using proximal-like algorithms
• Iterative Algorithms for Equilibrium Problems

Cites work

• scientific article; zbMATH DE number 417962 (Why is no real title available?)
• scientific article; zbMATH DE number 4164577 (Why is no real title available?)
• scientific article; zbMATH DE number 3245885 (Why is no real title available?)
• scientific article; zbMATH DE number 3360422 (Why is no real title available?)
• Convex programming in Hilbert space
• Equilibrium points in n -person games
• Gradient-proximal method of solving of extreme inclusions
• Methods of descent for nondifferentiable optimization
• Note on noncooperative convex games
• Relaxed outer projections, weighted averages and convex feasibility
• The Expected–Projection Method: Its Behavior and Applications to Linear Operator Equations and Convex Optimization
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• The computation of fixed points and applications

Cited in

(5)

• A merit function approach to the subgradient method with averaging
• An improved closed-form solution for the constrained minimization of the root of a quadratic functional
• Minimization of the root of a quadratic functional under an affine equality constraint
• On implementation of a self-dual embedding method for convex programming
• A method with convergence rates for optimization problems with variational inequality constraints

This page was built for publication: Averaged Subgradient Methods for Constrained Convex Optimization and Nash Equilibria Computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4805780)