scientific article; zbMATH DE number 4003362
[For the entire collection see Zbl 0617.00009.] An iteration method for searching \(\Lambda\)-approximations for the solution of linear algebraic equations \(Az=u\) is presented which can easily implemented on a computer. This method is based on the algorithm of determining equilibrium points of convex functionals according to J. F. Nash (1960). The unique existence of Nash points for the functionals M(z,\(\alpha)\), N(z,\(\alpha)\) is proved with respect to the roots from the minimal non-zero eigenvalue of \(\tilde A^ T\tilde A\), where \(\tilde A\) is the perturbed operator of A. The method consists in a sequential minimization of some functionals consisting of M(z,\(\alpha)\) and N(z,\(\alpha)\), the Tikhonov parametric functionals.
- A method for constructing the local points of the Nash equilibrium in a linear game problem
- Method of optimal descent with respect to a basis for solving degenerate systems of linear algebraic equations
- Numerical solution of an equilibrium problem of based on the generalized level method
- Computing the Nash equilibrium for LQ games on positive systems iteratively
- scientific article; zbMATH DE number 7500543
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4728102)