Averaged Subgradient Methods for Constrained Convex Optimization and Nash Equilibria Computation

DOI10.1080/0233193021000066455zbMath1032.90070OpenAlexW2039009006MaRDI QIDQ4805780

Elena Resmerita, Dan Butnariu

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) (n)-person games, (n>2) (91A06) Methods of reduced gradient type (90C52)

Related Items (4)

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 ⋮ A merit function approach to the subgradient method with averaging ⋮ On implementation of a self-dual embedding method for convex programming

Cites Work

• Relaxed outer projections, weighted averages and convex feasibility
• The computation of fixed points and applications
• Methods of descent for nondifferentiable optimization
• Note on noncooperative convex games
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• The Expected–Projection Method: Its Behavior and Applications to Linear Operator Equations and Convex Optimization
• Convex programming in Hilbert space
• Equilibrium points in n -person games
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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