×
Oettli, W.

Symmetric duality, and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and in the constraints. (English) Zbl 0297.41015

J. Approximation Theory 14, 43-50 (1975).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0297.41015

Cited in 12 Documents

MSC:

41A50 Best approximation, Chebyshev systems
Cite Review PDF
Full Text: DOI

References:

[1] Oettli, W., An iterative method, having linear rate of convergence, for solving a pair of dual linear programs, (Report No. 7204-OR (1972), Institut für Ökonometrie und Operations Research, Universität Bonn) · Zbl 0259.90019
[2] Krabs, W., Ein Pseudo-Gradientenverfahren zur Lösung des diskreten linearen Tschebyscheff-Problems, Computing, (Arch. Elektron. Rechnen), 4, 216-224 (1969) · Zbl 0187.10303
[3] Duffin, R. J., Infinite programs, Ann. of Math. Studies, 38, 157-170 (1956) · Zbl 0072.37603
[4] Eisenberg, E., Duality in homogeneous programming, (Proc. Amer. Math. Soc., 12 (1961)), 783-787 · Zbl 0102.15503
[5] Booth, A. D., An application of the method of steepest descent to the solution of systems of non-linear simultaneous equations, Quart. J. Mech. Appl. Math., 2, 460-468 (1949) · Zbl 0035.07502
[6] Polyak, B. T., USSR Comput. Math. and Math. Phys., 9, 14-29 (1969), (English translation) · Zbl 0229.65056
[7] Berge, C.; Ghouila-Houri, A., Programmes, jeux et réseaux de transport (1962), Dunod: Dunod Paris · Zbl 0111.17302
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.