scientific article; zbMATH DE number 1988044

MaRDI QIDQ4430199zbMATH OpenFDO

Authors Klaus Beer, E. G. Goldstein, N. A. Sokolov

Publication date 5 October 2003

zbMATH Keywords

linear programming problemssaddle levels methodsaddle-point finding

Mathematics Subject Classification ID

Optimality conditions for minimax problems (49K35) Minimax problems in mathematical programming (90C47)

Recommendations

• Generalized saddle version of the level method.
• Two general methods for computing saddle points with applications for decomposing convex programming problems
• scientific article; zbMATH DE number 2000779
• scientific article; zbMATH DE number 4167867
• A two-level subgradient method for finding saddle points of convex- concave functions

Cited in

(3)

• scientific article; zbMATH DE number 4190064 (Why is no real title available?)
• scientific article; zbMATH DE number 2000779 (Why is no real title available?)
• A PRACTICAL ALOGORITHM FOR MINIMIZING A RANK-TWO SADDLE FUNCTION ON A POLYTOPE

This page was built for publication:

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