Convergence results of an approximation method for constrained saddle point problems

DOI10.1080/00207168408803401zbMath0539.65049OpenAlexW2004792837MaRDI QIDQ3326754

Jacqueline Morgan, Maria Rosaria Crisci

Publication date: 1984

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168408803401

zbMATH Keywords

Galerkin methodpenalizationHilbert spacesconstrained saddle point problemconvex-concave

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Newton-type methods (49M15) Optimality conditions for minimax problems (49K35) Methods of successive quadratic programming type (90C55) Optimality conditions for problems in abstract spaces (49K27)

Related Items (1)

Affine Relaxations of the Best Response Algorithm: Global Convergence in Ratio-Bounded Games

Cites Work

• Methode directe de recherche du point de selle d'une fonctlonnelle convexe-concave et application aux problémes variationnels elliptiques avec deux controles antagonistes
• An Interior Penalty Method for Minimax Problems with Constraints

This page was built for publication: Convergence results of an approximation method for constrained saddle point problems