Numerical methods for finding saddle points

DOI10.1016/0041-5553(72)90002-XMaRDI QIDQ4768866zbMATH OpenOpenAlexFDO

Authors V. F. Demyanov, A. B. Pevnyj

Publication date 1973

Published in USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0041-5553(72)90002-x

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cited in

(10)

• Combined relaxation method for monotone equilibrium problems
• A class of gap functions for variational inequalities
• Solution of projection problems over polytopes
• Projection generalized two-point extragradient quasi-Newton method for saddle-point and other problems
• Modified combined relaxation method for general monotone equilibrium problems in Hilbert spaces
• A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
• Solving quality control problems with an algorithm for minimax programs with coupled constraints
• About saddle values of a class of convex-concave functions
• An exponential penalty method for nondifferentiable minimax problems with general constraints
• Two general methods for computing saddle points with applications for decomposing convex programming problems

This page was built for publication: Numerical methods for finding saddle points

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