Numerical methods for finding saddle points
From MaRDI portal
Publication:4768866
DOI10.1016/0041-5553(72)90002-XzbMath0282.90040OpenAlexW1976245130MaRDI QIDQ4768866
Aleksandr Borisovich Pevny, V. F. Dem'yanov
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
Related Items
A class of gap functions for variational inequalities, Modified combined relaxation method for general monotone equilibrium problems in Hilbert spaces, Solving quality control problems with an algorithm for minimax programs with coupled constraints, Projection generalized two-point extragradient quasi-Newton method for saddle-point and other problems, Solution of projection problems over polytopes, A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming, Combined relaxation method for monotone equilibrium problems, An exponential penalty method for nondifferentiable minimax problems with general constraints, About saddle values of a class of convex-concave functions, Two general methods for computing saddle points with applications for decomposing convex programming problems
