This is a preview of subscription content, log in via an institution to check access.
References
P. M. Pardalos and J. B. Rosen, Constrained Global Optimization: Algorithms and Applications, Lect. Notes Comput. Sci., Vol. 268 (1987).
N. Z. Shor and S. I. Stetsenko, Quadratic Extremal Problems and Nondifferentiable Optimization [in Russian], Naukova Dumka, Kiev (1989).
N. Z. Shor, “An approach to finding global extrema in polynomial problems of mathematical programming,” Kibernetika, No. 5, 102–106 (1987).
N. Z. Shor, “A class of bounds for global minima of polynomial functions,” Kibernetika, No. 6, 9–11 (1987).
P. S. Aleksandrov (ed.), Hilbert Problems [in Russian], Nauka, Moscow (1969).
N. Z. Shor, “Quadratic programming problems,” Izv. Akad. Nauk SSSR, Tekhn. Kibern., No. 1, 128–139 (1987).
D. Hilbert, “lieber die Darstellung definiter Formen als Summen von Formen quadraten,” Math. Ann. Leipzig, 22, 342–350 (1888).
E. Artin, “Ueber die Zerlegung definiter Funktionen in Quadrate” Hamburg Abh., No. 5, 100–115 (1927).
G. Polya, “Ueber positive Darstellung von Polynomen,” Vierteljahrsschrift d. naturforschenden Gesselsch., Zurich, 73, 141–145 (1928).
N. Z. Shor, “Dual estimates in multiextremal problems,” J. Global Optim., No. 2, 411–418 (1992).
N. Z. Shor and N. G. Zhurbenko, “A minimization method with space dilation in the direction of the difference of two successive gradients,” Kibernetika, No. 3, 51–591971).
N. Z. Short, Minimization Methods for Nondifferentiable Functions and Their Applications [in Russian], Naukova Dumka, Kiev (1979).
N. G. Zhurbenko and T. V. Marchuk, An Algorithm for Minimization of Nonsmooth Functionals (r-Algorithm) [in Russian], AN UkrSSR, RFAP, No. 22 (1979).
N. Z. Shor, “Minimization of matrix functions and nondifferentiable optimization,” in: Surveys in Applied and Industrial Mathematics [in Russian], Vol. 2, 113–138 (1995).
C. Lemarechal, “Numerical experiments in nonsmooth optimization,” in: E. A. Nurminski (ed.), Progress in Nondifferentiable Optimization, CP-82-S2, IIASA, Laxenburg (1982), pp. 61–84.
S. I. Nesterova and V. A. Skokov, “Numerical analysis of programs for nonsmooth unconstrained optimization,” Ekon. Mat. Metody, 30, No. 2, 136–145 (1994).
I. N. Molchanov, L. D. Nikolenko, M. F. Yakovlev, et al., A Software System for Solving Systems of Linear Algebraic Equations with Automatic Selection of the Solution Method (ARAS PC) [in Russian], No. 007135, GRFAP (1984).
Scientific Programs in FORTRAN. A Programmer's Manual, Vol. 2: Matrix Algebra and Linear Algebra [in Russian], Statistika, Moscow (1974).
L. Lovasz, “On the Shannon capacity of a graph,” IEEE Trans. Inform. Theory, 25, 1–7 (1979).
N. Z. Shor and O. A. Berezovskii, “New algorithms for solving the maximum cut problem in a graph,” Kibern. Sist. Anal., No. 2, 100–106 (1995).
P. I. Stetsyuk, “Orthogonalizing linear operators in convex programming. I,” Kibern. Sist. Anal., No. 3, 97–119 (1997).
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 28–49, July–August, 1997.
Rights and permissions
About this article
Cite this article
Shor, N.Z., Stetsyuk, P.I. Modifiedr-algorithm to find the global minimum of polynomial functions. Cybern Syst Anal 33, 482–497 (1997). https://doi.org/10.1007/BF02733104
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02733104