Finite algorithm to find the saddle point of a quadratic function subject to linear constraints
From MaRDI portal
Publication:1899539
DOI10.1007/BF01130087zbMath0832.90123OpenAlexW261277797MaRDI QIDQ1899539
Publication date: 2 November 1995
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01130087
general minimax problemsaddle point of a convex-concave quadratic functionsystem of linear equalities and inequalities
Related Items (3)
On a stochastic bilevel programming problem ⋮ Regularized method for solving variational inequalities with a monotone operator on a polyhedron ⋮ The quasi-Newton method of solution of convex variational inequalities with descent decomposition
Cites Work
This page was built for publication: Finite algorithm to find the saddle point of a quadratic function subject to linear constraints
