A two-level subgradient method for finding saddle points of convex- concave functions
From MaRDI portal
Publication:1323947
zbMATH Open0804.90113MaRDI QIDQ1323947FDOQ1323947
Authors: Igor V. Konnov 
Publication date: 6 July 1994
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Recommendations
- scientific article
- Combined subgradient methods for finding saddle points
- Generalized saddle version of the level method.
- Projection generalized two-point extragradient quasi-Newton method for saddle-point and other problems
- Monotone \(\varepsilon\)-subgradient method for finding saddle points of convex-concave functions
Cited In (18)
- Title not available (Why is that?)
- Subgradient methods for saddle-point problems
- Iterative regularization of the penalty method for an infinite- dimensional search problem for a saddle point
- Title not available (Why is that?)
- Title not available (Why is that?)
- A method for locating a limit saddle point
- Title not available (Why is that?)
- Solving strongly convex-concave composite saddle-point problems with low dimension of one group of variable
- Title not available (Why is that?)
- New modifications of the generalized saddle version of the level method
- Title not available (Why is that?)
- A combined relaxation method for variational inequalities with nonlinear constraints
- Combined subgradient methods for finding saddle points
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized gradient method for the determination of (?+?, ?+?)-saddle points
- A continuous algorithm for finding the saddle points of convex-concave functions
- Two general methods for computing saddle points with applications for decomposing convex programming problems
This page was built for publication: A two-level subgradient method for finding saddle points of convex- concave functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1323947)
