scientific article; zbMATH DE number 193848
Adaptive algorithmsComplexityextremal problemsgame-theoretic methodsglobal extremumminimax conceptNumerical integrationoptimal algorithmsoptimalityRecovery of functionsresearch expositionsequential optimality
Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical quadrature and cubature formulas (65D32) Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25)
Complexity and optimality of algorithms in numerical analysis are studied. Problems and algorithms are treated with a general framework based on the minimax concept of optimality. Adaptive algorithms and their implementation as well as game-theoretic methods for constructing optimal algorithms are considered. The central role of sequentially-optimal algorithms results from the fact that the notion of sequential optimality suits a number of real computational processes better than the traditional notions. The following chapters are contained: 1. General model of computation; 2. Numerical integration; 3. Recovery of functions using their values; 4. Search for a global extremum; 5. Some special classes of extremal problems.
- Minimax models in the theory of numerical methods. Transl. from the 1989 Russian orig. by Olga Chuyan
- scientific article; zbMATH DE number 3920238
- scientific article; zbMATH DE number 3909615
- The concept of sequential optimality for problems in numerical analysis
- scientific article; zbMATH DE number 177335
- Solution of continuous problems of optimal covering with spheres using optimal set-partition theory
- The concept of sequential optimality for problems in numerical analysis
- The algorithm designer versus nature: A game-theoretic approach to information-based complexity
- Minimax models in the theory of numerical methods. Transl. from the 1989 Russian orig. by Olga Chuyan
- On passive and active algorithms of reconstruction of functions
- 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
- Analysis of algorithms for a class of continuous partition problems
- An algorithm for solving global optimization problems with nonlinear constraints
- Comparison of independent, stratified and random covering sample schemes in optimization problems
- Rounding on the standard simplex: regular grids for global optimization
- Always convergent iteration methods for nonlinear equations of Lipschitz functions
- Hierarchical approach of numerical minimax theorems with applications
- scientific article; zbMATH DE number 3907767 (Why is no real title available?)
- scientific article; zbMATH DE number 3909615 (Why is no real title available?)
- scientific article; zbMATH DE number 3920238 (Why is no real title available?)
- scientific article; zbMATH DE number 4064388 (Why is no real title available?)
- scientific article; zbMATH DE number 177335 (Why is no real title available?)
- scientific article; zbMATH DE number 665283 (Why is no real title available?)
- A practicable way for computing the directional derivative of the optimal value function in convex programming
- Some problems in approximation theory and numerical analysis
- An elementary solution of a minimax problem arising in algorithms for automatic mesh selection
- Markowitz investment Boolean problem in case of uncertainty, multicriteria and risk
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
- Asymptotic optimality of some multicriterion optimization algorithms
- On average complexity of global optimization problems
- Improvements on the minimax algorithm for the Laplace transformation of orbital energy denominators
- Guaranteed deterministic approach to superhedging: sensitivity of solutions of the Bellman-Isaacs equations and numerical methods
- Some continuous programming problems in numerical analysis
- Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. I. Theoretical foundations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4040646)
