A continuous algorithm for finding the saddle points of convex-concave functions (Q797134)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A continuous algorithm for finding the saddle points of convex-concave functions |
scientific article; zbMATH DE number 3868092
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A continuous algorithm for finding the saddle points of convex-concave functions |
scientific article; zbMATH DE number 3868092 |
Statements
A continuous algorithm for finding the saddle points of convex-concave functions (English)
0 references
1984
0 references
The problem considered in this paper is the one of finding the saddle points of a convex-concave function defined on a product of convex and closed subsets of Euclidean spaces. The algorithm presented is a conceptual one. The system of subdifferential equations (inclusions) for saddle points is given. Stability conditions for this system are discussed and stability is established pointing out the convergence of the algorithm.
0 references
saddle points
0 references
convex-concave function
0 references
convergence
0 references
algorithm
0 references
0.9441716
0 references
0.94153833
0 references
0.9190359
0 references
0.9085025
0 references
0.9050877
0 references
0.89668685
0 references
0.8954713
0 references
0.8932019
0 references
