Advertisement

Optimization Methods for Solving Problems of Transcomputational Complexity

  • Ivan V. Sergienko
Chapter
Part of the Springer Optimization and Its Applications book series (SOIA, volume 78)

Abstract

This chapter addresses subgradient nonsmooth optimization methods. The generalized gradient descent method known later as the subgradient method is considered. It was used to solve many high-dimensional problems of production and transportation scheduling with decomposition schemes. Subgradient methods with space dilation, whose special cases are the ellipsoid method and r-algorithms, are analyzed. The application of nonsmooth optimization methods to various mathematical programming problems is discussed. The algorithmic scheme of the well-known descent method is considered. This scheme has made it possible to develop a wide range of local search algorithms, which were used in application packages elaborated at the Institute of Cybernetics. The modern method of local type, the probabilistic method of global equilibrium search, is analyzed. It was applied to solve various classes of problems of transcomputational complexity and appeared to be the most efficient discrete optimization technique. The approaches to accelerating the solution of discrete optimization problems are discussed. The stability of vector discrete optimization problems is analyzed. Different types of stability of integer optimization problems and regularization of unstable problems are considered. Some of the chapter deals with stochastic optimization that involves decision making under risk and uncertainty. Stochastic quasigradient methods and their modifications for stochastic programming problems are considered. The solution of stochastic global optimization, stochastic discrete optimization, stochastic minimax, and vector stochastic optimization problems is analyzed. The use of stochastic optimization methods in risk assessment and management is discussed. The chapter reviews the results of the mathematical theory of control of distributed parameter systems and stochastic and discrete systems and addresses the robust stability, determination of invariant sets of dynamic systems, and spacecraft control. The methods of the analysis of dynamic games, including those with groups of participants under various constraints, are considered as the development of motion control methods.

Keywords

Differential Game Discrete Optimization Problem Subgradient Method Game Problem Vector Criterion 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 27.
    Volosov, V.V., Shevchenko, V.N.: Robust methods of ellipsoidal estimation of dynamical systems state under restrictions on noise of output measurements and rate of their variation. J. Autom. Inform. Sci 40(10), 38–46 (2008)CrossRefGoogle Scholar
  2. 68.
    Ermoliev, Yu.M.: Stochastic Programming Methods [in Russian]. Nauka, Moscow (1976)Google Scholar
  3. 69.
    Ermol’ev, Yu.M., Norkin, V.I.: Stochastic generalized gradient method for nonconvex nonsmooth stochastic optimization. Cybern. Syst. Anal 34(2), 196–215 (1998)Google Scholar
  4. 70.
    Zhukovskii, V.I., Chikrii, A.A.: Linear–Quadratic Differential Games [in Russian]. Naukova Dumka, Kyiv (1994)Google Scholar
  5. 96.
    Krivonos, Yu.G., Matichin, I.I., Chikrii, A.A.: Dynamic Games with Discontinuous Trajectories [in Russian]. Naukova Dumka, Kyiv (2005)Google Scholar
  6. 97.
    Kuntsevich, A.V., Kuntsevich, V.M.: Stability in the domain of nonlinear difference inclusions. Cybern. Syst. Anal 46(5), 51–59 (2010)CrossRefMathSciNetGoogle Scholar
  7. 98.
    Kuntsevich, V.M., Pshenichnyi, B.N.: Minimal invariant sets of dynamic systems with bounded disturbances. Cybern. Syst. Anal 32(1), 58–64 (1996)CrossRefMATHMathSciNetGoogle Scholar
  8. 99.
    Kuntsevich, A.V., Kuntsevich, V.M.: Invariant sets for families of linear and nonlinear discrete systems with bounded disturbances. Autom. Rem. Contr 73(1), 83–96 (2012)CrossRefMathSciNetGoogle Scholar
  9. 105.
    Lebedeva, T.T., Semenova, N.V., Sergienko, T.I.: Stability of vector problems of integer optimization: relationship with the stability of sets of optimal and nonoptimal solutions. Cybern. Syst. Anal 41(4), 551–558 (2005)CrossRefMATHMathSciNetGoogle Scholar
  10. 106.
    Lebedeva, T.T., Sergienko, T.I.: Different types of stability of vector integer optimization problem: general approach. Cybern. Syst. Anal 44(3), 429–433 (2008)CrossRefMATHMathSciNetGoogle Scholar
  11. 111.
    Mikhalevich, V.S., Gupal, A.M., Norkin, V.I.: Nonconvex Optimization Methods [in Russian]. Nauka, Moscow (1987)Google Scholar
  12. 113.
    Mikhalevich, V.S., Trubin, V.A., Shor, N.Z.: Optimization Problems of Production–Transportation Planning [in Russian]. Nauka, Moscow (1986)Google Scholar
  13. 120.
    Nurminskii, E.A.: Numerical Methods of the Solution of Stochastic Minimax Problems [in Russian]. Naukova Dumka, Kyiv (1979)Google Scholar
  14. 132.
    Pshenichnyi, B.N.: Structure of differential games. DAN. SSSR 184(2), 285–287 (1969)Google Scholar
  15. 133.
    Pshenichnyi, B.N.: Linear differential games. Avtom. Telemekhanika, No. 1, 65–78 (1968)Google Scholar
  16. 139.
    Sergienko, I.V.: Mathematical Models and Methods for the Solution of Discrete Optimization Problems [in Russian]. Naukova Dumka, Kyiv (1988)Google Scholar
  17. 148.
    Sergienko, I.V., Kozeratskaya, L.N., Lebedeva, T.T.: Stability and Parametric Analysis of Discrete Optimization Problems [in Russian]. Naukova Dumka, Kyiv (1995)Google Scholar
  18. 149.
    Sergienko, I.V., Lebedeva, T.T., Roshchin, V.A.: Approximate Solution Methods for Discrete Optimization Problems [in Russian]. Naukova Dumka, Kyiv (1980)Google Scholar
  19. 151.
    Sergienko, I.V., Shilo, V.P.: Discrete Optimization Problems: Challenges, Solution Methods, Analysis [in Russian]. Naukova Dumka, Kyiv (2003)Google Scholar
  20. 152.
    Sergienko, I.V., Shilo, V.P., Roshchin, V.A.: Optimization parallelizing for discrete programming problems. Cybern. Syst. Anal 40(2), 184–189 (2004)CrossRefMATHMathSciNetGoogle Scholar
  21. 156.
    Sergienko, I.V., Chikrii, A.A.: Developing B. N. Pshenichnyi’s scientific ideas in optimization and mathematical control theory. Cybern. Syst. Anal 48(2), 157–179 (2012)CrossRefMathSciNetGoogle Scholar
  22. 157.
    Stetsyuk, P.I.: r-Algorithms and ellipsoids. Cybern. Syst. Anal 32(1), 93–110 (1996)CrossRefMATHMathSciNetGoogle Scholar
  23. 161.
    Khlebnikov, M.V., Polyak, B.T., Kuntsevich, V.M.: Optimization of linear systems subject to bounded exogenous disturbances: the invariant ellipsoid technique. Autom. Rem. Contr 72(11), 2227–2275 (2011)CrossRefMATHMathSciNetGoogle Scholar
  24. 163.
    Chikrii, A.A.: Conflict-Controlled Processes [in Russian]. Naukova Dumka, Kyiv (1992)Google Scholar
  25. 164.
    Chikrii, A.A.: Differential games with several pursuers. In: Mathematical Control Theory, vol. 14, pp. 81–107. Trans. Intern. Math. Banach Center, Warsaw (1985)Google Scholar
  26. 165.
    Chikrii, A.A.: An analytic method in dynamic pursuit games. In: Trans. V.A. Steklov MI RAS, vol. 271, pp. 76–92 (2010)Google Scholar
  27. 168.
    Shilo, V.P.: The method of global equilibrium search. Cybern. Syst. Anal 35(1), 68–74 (1999)CrossRefMATHMathSciNetGoogle Scholar
  28. 169.
    Shylo, V.P., Shylo, O.V.: Solving the maxcut problem by the global equilibrium search. Cybern. Syst. Anal 46(5), 744–754 (2010)CrossRefMathSciNetGoogle Scholar
  29. 170.
    Shor, N.Z.: Minimization Methods for Nondifferentiable Functions and Their Applications [in Russian]. Naukova Dumka, Kyiv (1979)Google Scholar
  30. 171.
    Shor, N.Z., Zhurbenko, N.G.: The minimization method using the operation of space dilation in the direction of the difference of two subsequent gradients. Kibernetika, No. 3, 51–59 (1971)Google Scholar
  31. 172.
    Shor, N.Z., Sergienko, I.V., Shilo, V.P., et al.: Problems of Optimal Design of Reliable Networks [in Ukrainian]. Naukova Dumka, Kyiv (2005)Google Scholar
  32. 173.
    Shor, N.Z., Stetsenko, S.I.: Quadratic Extremum Problems and Nondifferentiable Optimization [in Russian]. Naukova Dumka, Kyiv (1989)Google Scholar
  33. 175.
    Albus, J., Meystel, A., Chikrii, A.: Soft Landing of Moving Objects. Report, NIST, Gaithersburg, USA (1998)Google Scholar
  34. 178.
    Chikrii, A.A.: Optimization of game interaction of fractional-order controlled systems. J. Optim. Meth. Software 3(1), 39–73 (2008)CrossRefMathSciNetGoogle Scholar
  35. 179.
    Chikrii, A.A.: Conflict Controlled Processes. Kluwer Academic Publishers, Boston (1997)CrossRefMATHGoogle Scholar
  36. 182.
    Ermoliev, Yu., Wets, R.J.-B.: (eds.): Numerical Techniques for Stochastic Optimization, Springer Series in Computational Mathematics, vol. 10. Springer, Berlin (1988)Google Scholar
  37. 183.
    Glover, F., Laguna, M., Marti, R.: Fundamentals of scatter search and path relinking. Contr. Cybern 39, 653–684 (2000)MathSciNetGoogle Scholar
  38. 186.
    Knopov, P.S., Kasitskaya, E.J.: Empirical Estimates in Stochastic Optimization and Identification. Kluwer Academic Publishers, Dordrecht (2002)CrossRefMATHGoogle Scholar
  39. 196.
    Chornei, R.K., Daduna, H., Knopov, P.S.: Control of Spatially Structured Random Processes and Random Fields with Applications. Springer, New York (2006)MATHGoogle Scholar
  40. 197.
    Butenko, S., Pardalos, P.M., Sergienko, I.V., Shylo, V., Stetsyuk, P.: Estimating the size of correcting codes using extremal graph problems. In: Pearce, C.E.M., Hunt, E. (eds.) Optimization: Structure and Applications, vol. 32. Springer, Dordrecht (2009)CrossRefGoogle Scholar
  41. 202.
    Shor, N.Z.: Nondifferentiable Optimization and Polynomial Problems. Kluwer Academic Publishers, Boston (1998)CrossRefMATHGoogle Scholar
  42. 203.
    Shylo, V.P., Shylo, O.V.: Path relinking scheme for the max-cut problem within global equilibrium search. Int. J. Swarm. Intell. Res 2(2), 42–51 (2011)CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • Ivan V. Sergienko
    • 1
  1. 1.V. M. Glushkov Cybernetics InstituteNational Academy of Sciences of UkraineKievUkraine

Personalised recommendations