Convergence results of an approximation method for constrained saddle point problems

DOI10.1080/00207168408803401zbMATH Open0539.65049OpenAlexW2004792837MaRDI QIDQ3326754FDOQ3326754

Authors: Jacqueline Morgan, M. R. 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

Recommendations

• An algorithm for a constrained saddle point problem via an exact penalty method
• Implementation and numerical results of an approximation method for constrained saddle point problems
• Iterative regularization of the penalty method for an infinite- dimensional search problem for a saddle point
• scientific article; zbMATH DE number 3984476
• On the convergence of the proximal algorithm for saddle-point problems

zbMATH Keywords

penalizationGalerkin methodHilbert spacesconstrained saddle point problemconvex-concave

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (9)

• An algorithm for a constrained saddle point problem via an exact penalty method
• On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems.
• Iterative regularization of the penalty method for an infinite- dimensional search problem for a saddle point
• A convergence of ODE method in constrained optimization
• Title not available (Why is that?)
• Implementation and numerical results of an approximation method for constrained saddle point problems
• On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds
• Affine Relaxations of the Best Response Algorithm: Global Convergence in Ratio-Bounded Games
• On the regularization and approximation of saddle point problems without inf-sup condition

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

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