The interior linearization method for equilibrium programming problems
type: Item
instance of: scholarly article
title: The interior linearization method for equilibrium programming problems
zbMATH Open document ID: 1002.90065
author: Anatoliǐ Sergeevich Antipin
published in: Computational Mathematics and Mathematical Physics
publication date: 2003-01-12T00:00:00Z
review text: 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.
reviewed by: A. Tret'yakov
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K10
zbMATH DE Number: 1701738
zbMATH Keywords: equilibrium programming problem
zbMATH Keywords: fixed point
zbMATH Keywords: biconvexity
zbMATH Keywords: interior linearization method
zbMATH Keywords: solution
zbMATH Keywords: convergence
zbMATH Keywords: bidifferentiability
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1701738