Estimating the characteristics of the accuracy and computational complexity in approximate methods of global optimization of nonlinear functionals

DOI10.1007/S10559-014-9595-7zbMath1298.90074OpenAlexW2154582969MaRDI QIDQ466015

A. M. Getsko, M. D. Babich

Publication date: 24 October 2014

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-014-9595-7

zbMATH Keywords

functionaloptimizationcomplexityestimateerrorextremum

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization of computations
• A computing experiment in the problem of optimization of computations. I
• Investigation of the total error in minimization of functionals with constraints
• An algorithm of approximate solution of systems of nonlinear equations

This page was built for publication: Estimating the characteristics of the accuracy and computational complexity in approximate methods of global optimization of nonlinear functionals