The interior linearization method for equilibrium programming problems (Q5954752)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The interior linearization method for equilibrium programming problems |
scientific article; zbMATH DE number 1701738
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The interior linearization method for equilibrium programming problems |
scientific article; zbMATH DE number 1701738 |
Statements
The interior linearization method for equilibrium programming problems (English)
0 references
12 January 2003
0 references
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.
0 references
equilibrium programming problem
0 references
fixed point
0 references
biconvexity
0 references
interior linearization method
0 references
solution
0 references
convergence
0 references
bidifferentiability
0 references
