Estimating the information complexity of global optimization and the global solution of equations

MaRDI QIDQ1311575zbMATH OpenFDO

Authors N. M. Popov

Publication date 3 March 1994

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

all maximum pointsall roots of an equationefficiency criterionLipschitz functions

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• Some issues in the theory of optimal algorithms and informational complexity
• The complexity of the computation of a global minimum in certain classes of optimization problems
• Estimating the characteristics of the accuracy and computational complexity in approximate methods of global optimization of nonlinear functionals
• Publication:4726055
• Determination of the roots and of the global extremum of a lipschitz function

Cited in

(10)

• The complexity of the computation of a global minimum in certain classes of optimization problems
• Optimal algorithms of maximization and approximation in calculations with an uncertain error
• An information global minimization algorithm using the local improvement technique
• Global optimization. An information-theoretic approach
• Two-level schemes for global and multicriterion search
• The information approach to multiextremal optimization problems
• Estimating the characteristics of the accuracy and computational complexity in approximate methods of global optimization of nonlinear functionals
• Two Methods for Solving Optimization Problems Arising in Electronic Measurements and Electrical Engineering
• scientific article; zbMATH DE number 3999669 (Why is no real title available?)
• scientific article; zbMATH DE number 6276166 (Why is no real title available?)

This page was built for publication: Estimating the information complexity of global optimization and the global solution of equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1311575)