Methods for solving equilibrium programming problems

From MaRDI portal





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.











This page was built for publication: Methods for solving equilibrium programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2577287)