Abstract
The problem of finding a point of a linear manifold with a minimal weighted Chebyshev norm is considered. In particular, to such a problem, the Chebyshev approximation is reduced. An algorithm that always produces a unique solution to this problem is presented. The algorithm consists in finding relatively internal points of optimal solutions of a finite sequence of linear programming problems. It is proved that the solution generated by this algorithm is the limit to which the Hölder projections of the origin of coordinates onto a linear manifold converge with infinitely increasing power index of the Hölder norms using the same weight coefficients as the Chebyshev norm.
Similar content being viewed by others
REFERENCES
R. Rockafellar, Convex Analysis (Princeton Univ. Press, Princeton, 1970).
V. I. Zorkal’tsev, “The points of a linear manifold nearest the origin of coordinates,” Comput. Math. Math. Phys. 35 (5), 635–641 (1995).
V. I. Zorkal’tsev, “Octahedral and Euclidean projections of a point to a linear manifold,” Proc. Steklov Inst. Math. 284, Suppl. 1, 185–197 (2014).
V. I. Zorkal’tsev and M. A. Kiseleva, Systems of Linear Inequalities (Irkutsk. Gos. Univ., Irkutsk, 2007) [in Russian].
A. V. Lakeev and S. I. Noskov, “The smallest absolute value method for linear regression: The number of zero approximation errors,” in Proceedings of the 15th Baikal International School-Workshop on Optimization Methods and Their Applications: Mathematical Programming (Inst. Din. Sist. Teor. Upr. Sib. Otd. Ross. Akad. Nauk, Irkutsk, 2011), Vol. 2, pp. 117–120.
V. I. Zorkal’tsev, “Interior point method: History and prospects,” Comput. Math. Math. Phys. 29 (10), 1597–1612 (2019).
L. Collatz and W. Krabs, Approximationstheorie: Tschebyscheffsche Approximation mit Anwendungen (Vieweg+Teubner, Wiesbaden, 1973).
A. Haare, “Die Minkowskische Geometrie und die Annäherung an stetige Funktionen,” Math. Ann. 78 (1–4), 294–311 (1917).
A. G. Aganbegyan and A. G. Granberg, Economic-Mathematical Analysis of the Input-Output Balance of the USSR (Mysl’, Moscow, 1968) [in Russian].
B. V. Cherkassovskii, “Problems of matrix balancing,” Mathematical Programming Methods and Software (Ural. Otd. Akad. Nauk SSSR, Sverdlovsk, 1984), pp. 216–217 [in Russian].
I. V. Batoeva, A. R. Bedenkov, V. I. Zorkal’tsev, and S. L. Sadov, Matching of Partial Predictions in Balance Models (Komi Nauchn. Tsentr Ural. Otd. Akad. Nauk SSSR, Syktyvkar, 1990) [in Russian].
V. F. Demyanov and V. N. Malozemov, Introduction to Mimimax (Nauka, Moscow, 1972; Wiley, New York, 1974).
Funding
This work was supported by the Russian Foundation for Basic Research (project no. 19-07-00322) and the Russian Academy of Sciences (project no. 0279-2019-0003).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated by E. Chernokozhin
Rights and permissions
About this article
Cite this article
Zorkal’tsev, V.I. Convergence of Hölder Projections to Chebyshev Projections. Comput. Math. and Math. Phys. 60, 1810–1822 (2020). https://doi.org/10.1134/S0965542520110147
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0965542520110147