Skip to main content
Log in

Interior-Point Algorithms: Creation History, Research Results, Applications, and Prospects*

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

The authors consider a family of interior-point algorithms for solving linear programming problems and provide the results of their theoretical substantiation. Subsets of algorithms that have a linear rate of convergence, asymptotically independent of the parameters of the problem being solved, and a subset of algorithms that lead to relatively interior points of the set of optimal solutions are identified. The history of the creation and development of the algorithms is described. New modifications of interior-point algorithms are presented, which contain the previously developed algorithms as a special case.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. N. Z. Shor, “Monotone modifications of r-algorithms and their applications,” Cybern. Syst. Analysis, Vol. 38, No. 6, 855–872 (2002). https://doi.org/https://doi.org/10.1023/A:1022991904813.

  2. I. V. Sergienko and P. I. Stetsyuk, “On of N. Z. Shor’s three scientific ideas,” Cybern. Syst. Analysis, Vol. 48, No. 1, 2–16 (2012). https://doi.org/https://doi.org/10.1007/s10559-012-9387-x.

  3. P. I. Stetsyuk, A. V. Fesiuk, and O. N. Khomyak, “The generalized ellipsoid method,” Cybern. Syst. Analysis, Vol. 54, No. 4, 576–584 (2018). https://doi.org/https://doi.org/10.1007/s10559-018-0058-4.

  4. P. I. Stetsyuk, “r-Algorithms and ellipsoids,” Cybern. Syst. Analysis, Vol. 32, No. 1, 93–110 (1996). https://doi.org/https://doi.org/10.1007/BF02366587.

  5. I. I. Dikin and V. I. Zorkaltsev, Iterative Solution of Mathematical Programming Problems: Algorithms of the Interior-Point Method [in Russian], Nauka, Novosibirsk (1980).

  6. V. I. Zorkaltsev, S. M. Perzhabinsky, and P. I. Stetsyuk, “Using the interior point method to find normal solutions to a system of linear algebraic equations with bilateral constraints on variables,” Cybern. Syst. Analysis, Vol. 51, No. 6, 896–904 (2015). https://doi.org/https://doi.org/10.1007/s10559-015-9782-1.

  7. S. P. Epifanov, V. I. Zorkaltsev, “Problem of flow distribution with variable nodal flow rates,” Cybern. Syst. Analysis, Vol. 47, No. 1, 74–84 (2011). https://doi.org/https://doi.org/10.1007/s10559-011-9291-9.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to T. V. Belykh.

Additional information

The paper was recommended for publication by the Program Committee of the 7th International Scientific Conference “Mathematical Modeling, Optimization and Information Technologies (MMOTI-2021).”

Translated from Kibernetyka ta Systemnyi Analiz, No. 6, November–December, 2022, pp. 143–148.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Belykh, T.V., Zorkaltsev, V.I. Interior-Point Algorithms: Creation History, Research Results, Applications, and Prospects*. Cybern Syst Anal 58, 977–982 (2022). https://doi.org/10.1007/s10559-023-00532-y

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-023-00532-y

Keywords

Navigation