Convergence of the method of Chebyshev centers and some applications (Q3768685)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4027182
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convergence of the method of Chebyshev centers and some applications |
scientific article; zbMATH DE number 4027182 |
Statements
Convergence of the method of Chebyshev centers and some applications (English)
0 references
1986
0 references
methods of Chebyshev centers
0 references
dual cutting plane method
0 references
block method
0 references
0.8586612939834595
0 references
0.7820099592208862
0 references
0.7651270627975464
0 references
0.7595669627189636
0 references
0.7557071447372437
0 references
A general feature of the methods of Chebyshev centers for solving optimization or equilibrium problems is the use of a procedure which generates a sequence of nested sets with their Chebyshev centers (in particular, the centers of maximum-radius spheres contained in these sets). We investigate a class of methods of Chebyshev centers which generalize the method of \textit{J. Elzinga} and \textit{T. G. Moore} [Math. Program. 8, 134-145 (1975; Zbl 0318.90048)] and converge at a geometrical progression rate with an adjustable progression factor. We also consider one particular method from this class - the dual cutting plane method of \textit{W. I. Zangwill} [``Nonlinear programming: A unified approach'' (1969; Zbl 0195.208)], as well as the related block method of convex programming due to \textit{G. B. Dantzig} [``Linear programming and extensions'' (1963; Zbl 0108.331)].
0 references