Skip to main content
Log in

Method of orthogonal simplexes and its applications to convex programming

  • Published:
Computational Mathematics and Mathematical Physics Aims and scope Submit manuscript

Abstract

Numerical methods for solving a convex programming problem are considered whose guaranteed convergence rate depends only on the space dimension. On average, the ratio of the corresponding geometric progression is better than that in the basis model of ellipsoids or simplexes. Results of numerical experiments are presented.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. V. P. Bulatov and I. O. Shepot’ko, “Orthogonal Method in Convex Programming,” in Applied Mathematics (Sib. Energ. Inst., Irkutsk, 1982) [in Russian].

    Google Scholar 

  2. E. G. Antsiferov and V. P. Bulatov, “Simplex Immersion Algorithm in Convex Programming,” Zh. Vychisl. Mat. Mat. Fiz. 27, 377–384 (1987).

    MathSciNet  Google Scholar 

  3. L. T. Ashchepkov, B. I. Belov, and V. P. Bulatov, Solution Methods for Problems in Mathematical Programming and Optimal Control (Nauka, Novosibirsk, 1984) [in Russian].

    Google Scholar 

  4. B. T. Polyak, Introduction to Optimization (Nauka, Moscow, 1983; Optimization Software, New York, 1987).

    MATH  Google Scholar 

  5. D. B. Yudin and A. S. Nemirovskii, “Information Complexity and Effective Solution Methods for Convex Optimization Problems,” Ekon. Mat. Metody 12, 357–369 (1976).

    Google Scholar 

  6. Yu. Ya. Levin, “A Minimization Algorithm for Convex Functions,” Dokl. Akad. Nauk SSSR 160, 1244–1247 (1965).

    MathSciNet  Google Scholar 

  7. B. S. Mityagin, “Two Inequalities for the Volumes of Convex Bodies,” Mat. Zametki 5(5), 20–25 (1965).

    Google Scholar 

  8. L. G. Khachiyan, “Optimal Algorithms in Convex Programming, Decomposition, and Sorting,” in Computers and Decision Problems (Nauka, Moscow, 1989), pp. 161–204 [in Russian].

    Google Scholar 

  9. L. G. Khachiyan, “Polynomial Algorithms in Linear Programming,” Zh. Vychisl. Mat. Mat. Fiz. 20, 51–69 (1980).

    MATH  MathSciNet  Google Scholar 

  10. N. Z. Shor, “Cutting Methods with Space Stretching for Solving Convex Programming Problems,” Kibernetika, 1, 94–95 (1977).

    Google Scholar 

  11. V. P. Bulatov, Immersion Methods in Optimization Problems (Nauka, Novosibirsk, 1977) [in Russian].

    Google Scholar 

  12. E. G. Antsiferov and Yu. N. Danilenko, “Solution of Convex Programming Problems by the Modified Support Cone Method,” in Optimization Methods and Applications (Nauka, Novosibirsk, 1982), pp. 32–35 [in Russian].

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to V. P. Bulatov.

Additional information

Original Russian Text © V.P. Bulatov, 2008, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2008, Vol. 48, No. 4, pp. 610–622.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bulatov, V.P. Method of orthogonal simplexes and its applications to convex programming. Comput. Math. and Math. Phys. 48, 577–589 (2008). https://doi.org/10.1134/S0965542508040064

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0965542508040064

Keywords

Navigation