Estimating the Characteristics of the Accuracy and Computational Complexity in Approximate Methods of Global Optimization of Nonlinear Functionals

  • Authors:

  • M. D. Babich;A. M. Getsko

  • Affiliations:

  • Ukrainian State University of Finance and International Trade, Kyiv, Ukraine;Uzhgorod National University, Uzhgorod, Ukraine

  • Venue:
  • Cybernetics and Systems Analysis
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider the estimation of the accuracy and computational complexity of the combined s-algorithm of the separation of all the solutions in a given bounded domain and their iterative correction up to the required accuracy in the approximate computational solution to multiextremum problems of global optimization of twice continuously differentiable functionals.