Finding an element in a set by the successive relaxation method (Q1121178)
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: Finding an element in a set by the successive relaxation method |
scientific article; zbMATH DE number 4102828
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding an element in a set by the successive relaxation method |
scientific article; zbMATH DE number 4102828 |
Statements
Finding an element in a set by the successive relaxation method (English)
0 references
1985
0 references
The author describes two algorithms for finding an element of the set \(D=\{x\in H:\) h(x)\(\leq 0\}\), where H is a Hilbert space and h: \(X\to {\mathbb{R}}\) is a quasiconvex functional, when int \(D\neq \emptyset\). It is shown that such an element is found in a finite number of steps, estimated in the paper.
0 references
successive relaxation method
0 references
algorithms
0 references
Hilbert space
0 references
