scientific article

zbMath0717.65037MaRDI QIDQ4040646

Aleksei G. Sukharev

Publication date: 5 June 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

optimalityComplexityextremal problemsoptimal algorithmsresearch expositionNumerical integrationAdaptive algorithmssequential optimalityglobal extremumgame-theoretic methodsminimax conceptRecovery of functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical quadrature and cubature formulas (65D32) Complexity and performance of numerical algorithms (65Y20)

Related Items (18)

On passive and active algorithms of reconstruction of functions ⋮ Guaranteed deterministic approach to superhedging: sensitivity of solutions of the Bellman-Isaacs equations and numerical methods ⋮ The concept of sequential optimality for problems in numerical analysis ⋮ Optimization of a class of information compression algorithms ⋮ Bounds on characteristics of algorithms to find the global minimum of a function in an \(n\)-dimensional parallelepiped with prespecified accuracy ⋮ Choosing grids in cubature formulas for evaluation of integrals for a class of functions of two variables ⋮ An algorithm for solving global optimization problems with nonlinear constraints ⋮ Comparison of independent, stratified and random covering sample schemes in optimization problems ⋮ Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. I. Theoretical foundations ⋮ A practicable way for computing the directional derivative of the optimal value function in convex programming ⋮ On average complexity of global optimization problems ⋮ Rounding on the standard simplex: regular grids for global optimization ⋮ Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms ⋮ Asymptotic optimality of some multicriterion optimization algorithms ⋮ Solution of continuous problems of optimal covering with spheres using optimal set-partition theory ⋮ Unnamed Item ⋮ Analysis of algorithms for a class of continuous partition problems ⋮ Always convergent iteration methods for nonlinear equations of Lipschitz functions

This page was built for publication: