Gradient methods for constrained maxima

DOI10.1287/OPRE.5.2.258zbMATH Open1414.90361OpenAlexW2141941614MaRDI QIDQ5378741FDOQ5378741

Authors: Kenneth J. Arrow, Leonid Hurwicz 

Publication date: 3 June 2019

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.5.2.258

Recommendations

• An extension of Sion's minimax theorem with an application to a method for constrained games
• scientific article; zbMATH DE number 1193034
• scientific article; zbMATH DE number 165423
• scientific article; zbMATH DE number 3854836
• Publication:3491320

Mathematics Subject Classification ID

Methods of reduced gradient type (90C52) Other game-theoretic models (91A40)

Cited In (8)

• Stability and robustness for saddle-point dynamics through monotone mappings
• A scaled boundary finite element based node-to-node scheme for 2D frictional contact problems
• THE INCREMENTAL MINING OF CONSTRAINED CUBE GRADIENTS
• Shadow Douglas-Rachford splitting for monotone inclusions
• Gradient maximum principle for minima
• Last-iterate convergence of saddle-point optimizers via high-resolution differential equations
• Asymptotic behaviour of a nonautonomous evolution equation governed by a quasi-nonexpansive operator
• Gradient methods with regularization for constrained optimization problems and their complexity estimates

This page was built for publication: Gradient methods for constrained maxima

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