Methods for solving equilibrium programming problems (Q2577287): Difference between revisions

From MaRDI portal
Import241208061232 (talk | contribs)
Normalize DOI.
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1007/S10625-005-0129-Y / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1007/S10625-005-0129-Y / rank
 
Normal rank

Latest revision as of 08:36, 19 December 2024

scientific article
Language Label Description Also known as
English
Methods for solving equilibrium programming problems
scientific article

    Statements

    Methods for solving equilibrium programming problems (English)
    0 references
    0 references
    0 references
    19 December 2005
    0 references
    This paper gives a survey of methods for solving equilibrium programming problems developed by A. S. Antipin, B. A. Budak and F. P. Vasil'ev in the last decade. To compute equilibrium solutions they generalized basic optimization ideas such as the ideas of proximal, gradient, Newton and penalty function methods. They present conditions providing the convergence of the trajectory of the extragradient, linearization and proximal methods and some methods based on combinations of the stabilization method with the methods mentioned above.
    0 references
    0 references
    equilibrium programming problem
    0 references
    proximal method
    0 references
    gradient method
    0 references
    Newton method
    0 references
    penalty function method
    0 references
    stabilization method
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references