Shooting method for solving equilibrium programming problems
From MaRDI portal
Recommendations
- A new two-step proximal algorithm of solving the problem of equilibrium programming
- A nonmonotonic explicit proximal-like method for solving equilibrium programming with convex constraints
- Iterative methods for solving monotone equilibrium problems via dual gap functions
- scientific article; zbMATH DE number 2157463
- A projection method for pseudomonotone equilibrium problems
Cites work
- scientific article; zbMATH DE number 1376383 (Why is no real title available?)
- A first-order continuous extra-gradient method with variable metric for solving equilibrium programming problems
- Calculation of fixed points of extremal mappings by gradient-type methods
- Convergence theorems by hybrid methods for monotone mappings and a countable family of nonexpansive mappings and its applications
- Equilibrium programming: Gradient methods
- Equilibrium programming: Proximal methods
- Existence and uniqueness of solution of problem of balanced programming
Cited in
(3)
This page was built for publication: Shooting method for solving equilibrium programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2940338)