Skip to main content

Shor’s r-Algorithms: Theory and Practice

  • Chapter
  • First Online:
Optimization Methods and Applications

Part of the book series: Springer Optimization and Its Applications ((SOIA,volume 130))

Abstract

Properties of three computational forms of r-algorithms differentiated by their complexities (number of calculations per iteration) are considered. The results on convergence of the limit variants of r-algorithms for smooth functions and r μ (α)-algorithm for nondifferentiable functions are presented. A variant of r(α)-algorithms with a constant coefficient of space dilation α and adaptive step adjustment along the normalized anti-subgradient in the transformed space of variables is discussed. Octave-functions ralgb5 and ralgb4 of r(α)-algorithms with adaptive step adjustment are described. The results of computational experiments for substantially ravine piecewise quadratic function and ravine quadratic and piecewise linear functions are presented.

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

Access this chapter

Institutional subscriptions

Notes

  1. 1.

    As a matrix B 0 a diagonal matrix D n with positive coefficients on the diagonal is often chosen, with the help of which the variables are scaled.

References

  1. Kappel, F., Kuntsevich, A.V.: An implementation of Shor’s r-algorithm. Comput. Optim. Appl. 15(2), 193–205 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. Lemareshal, C., Mifflin, R. (eds.): Nonsmooth Optimization, p. 186. Pergamon Press, Oxford (1978)

    Google Scholar 

  3. Mikhalevich, V.S., Sergienko, I.V., Shor, N.Z., et al.: The software package DISPRO-3: objectives, classes of problems, systemic and algorithmic support. Cybern. Syst. Anal. 21(1), 68–86 (1985)

    Article  Google Scholar 

  4. Mordukhovich, B., Solodov, M., Todd, M. (eds.): Special issue “Nonsmooth optimization and related topics”, dedicated to the memory of professor Naum Shor. Optim. Methods Softw. 23(1), 3–4 (2008)

    Google Scholar 

  5. Sergienko, I.V.: Methods of Optimization and Systems Analysis for Problems of Transcomputational Complexity. Springer Optimization and Its Applications, vol. 72, p. 226. Springer, New York (2012)

    Google Scholar 

  6. Sergienko, I.V., Stetsyuk, P.I.: On N.Z. Shor’s three scientific ideas. Cybern. Syst. Anal. 48(1), 2–16 (2012)

    Google Scholar 

  7. Sergienko, I.V., Mikhalevich, M.V., Stetsyuk, P.I., Koshlai, L.B.: Models and information technologies for decision support during structural and technological changes. Cybern. Syst. Anal. 45(2), 187–203 (2009)

    Article  MATH  Google Scholar 

  8. Sergienko, I.V., Mikhalevich, M., Koshlai, L.: Optimization Models in a Transition Economy. Springer Optimization and Its Applications, vol. 101, p. 334. Springer, New York (2014)

    Google Scholar 

  9. Shor, N.Z.: Methods for minimizing nondifferentiable functions and their applications, Doctor Science Dissertation, Kiev (1970)

    Google Scholar 

  10. Shor, N.Z.: A class of almost-differentiable functions and a minimization method for functions of this class. Cybern. Syst. Anal. 8(4), 599–606 (1972)

    Article  Google Scholar 

  11. Shor, N.Z.: Convergence of a gradient method with space dilation in the direction of the difference between two successive gradients. Cybern. Syst. Anal. 11(4), 564–570 (1975)

    Article  Google Scholar 

  12. Shor, N.Z.: Minimization Methods for Non-Differentiable Functions, p. 178. Springer, Berlin (1985)

    Google Scholar 

  13. Shor, N.Z.: Nondifferentiable Optimization and Polynomial Problems, p. 412. Kluwer Academic Publishers, Boston (1998)

    Google Scholar 

  14. Shor, N.Z.: Monotone modifications of r-algorithms and their applications. Cybern. Syst. Anal. 38(6), 855–672 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  15. Shor, N.Z., Stetsenko, S.I.: Quadratic Extremal Problems and Nondifferentiable Optimization, p. 208. Naukova dumka, Kiev (1989) (in Russian)

    Google Scholar 

  16. Shor, N.Z., Stetsyuk, P.I.: Modified r-algorithm to find the global minimum of polynomial functions. Cybern. Syst. Anal. 33(4), 482–497 (1997)

    Article  MATH  Google Scholar 

  17. Shor, N.Z., Stetsyuk, P.I.: Lagrangian bounds in multiextremal polynomial and discrete optimization problems. J. Glob. Optim. 23(1), 1–41 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  18. Shor, N.Z., Zhurbenko, N.G.: A minimization method using the operation of extension of the space in the direction of the difference of two successive gradients. Cybern. Syst. Anal. 7(3), 450–459 (1971)

    Article  Google Scholar 

  19. Shor, N.Z., Zhurbenko, N.G., Likhovid, A.P., Stetsyuk, P.I.: Algorithms of nondifferentiable optimization: development and application. Cybern. Syst. Anal. 39(3), 537–548 (2003)

    Article  MATH  Google Scholar 

  20. Stetsyuk, P.I.: Convergence of r-algorithms. Cybern. Syst. Anal. 31(6), 935–937 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  21. Stetsyuk, P.I.: Ellipsoid Methods and r-Algorithms, p. 488. Evrika, Chisinau (2014) (in Russian)

    Google Scholar 

  22. Stetsyuk, P.I.: Subgradient methods ralgb5 and ralgb4 for minimization of ravine-like convex functions. Comput. Technol. 22(2), 127–149 (2017) (in Russian)

    MATH  Google Scholar 

  23. Stetsyuk, P., Romanova, T., Scheithauer, G.: On the global minimum in a balanced circular packing problem. Optim. Lett. 10(6), 1347–1360 (2016)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This work was supported by the National Academy of Sciences of Ukraine, project VF.120.19, and Volkswagen Foundation, grant No 90 306. The author would like to thank T.O. Bardadym, O.P. Lykhovyd, I.I. Parasyuk, and V.O. Zhydkov for their help in preparing this paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Petro I. Stetsyuk .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Stetsyuk, P.I. (2017). Shor’s r-Algorithms: Theory and Practice. In: Butenko, S., Pardalos, P., Shylo, V. (eds) Optimization Methods and Applications . Springer Optimization and Its Applications, vol 130. Springer, Cham. https://doi.org/10.1007/978-3-319-68640-0_24

Download citation

Publish with us

Policies and ethics