The interior linearization method for equilibrium programming problems
The paper is devoted to an equilibrium programming problem. The concepts of bidifferentiability and biconvexity are introduced, and their properties are discussed. It is shown that the general equilibrium problem can be represented as the sum of a potential and a skew-symmetric problem. An interior linearization method is proposed for calculating an equilibrium solution. The convergence of the method is proved, and the rate of convergence is estimated.
scientific article; zbMATH DE number 1701738