scientific article; zbMATH DE number 193848
From MaRDI portal
Publication:4040646
optimalityextremal problemsoptimal algorithmsresearch expositionComplexityNumerical integrationAdaptive algorithmssequential optimalityglobal extremumgame-theoretic methodsminimax conceptRecovery of functions
Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical quadrature and cubature formulas (65D32) Analysis of algorithms and problem complexity (68Q25)
Recommendations
- 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
Cited in
(30)- Asymptotic optimality of some multicriterion optimization algorithms
- Guaranteed deterministic approach to superhedging: sensitivity of solutions of the Bellman-Isaacs equations and numerical methods
- scientific article; zbMATH DE number 3920238 (Why is no real title available?)
- scientific article; zbMATH DE number 4064388 (Why is no real title available?)
- Rounding on the standard simplex: regular grids for global optimization
- The algorithm designer versus nature: A game-theoretic approach to information-based complexity
- On average complexity of global optimization problems
- Analysis of algorithms for a class of continuous partition problems
- Some problems in approximation theory and numerical analysis
- A practicable way for computing the directional derivative of the optimal value function in convex programming
- Improvements on the minimax algorithm for the Laplace transformation of orbital energy denominators
- 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
- Solution of continuous problems of optimal covering with spheres using optimal set-partition theory
- scientific article; zbMATH DE number 665283 (Why is no real title available?)
- On passive and active algorithms of reconstruction of functions
- An algorithm for solving global optimization problems with nonlinear constraints
- Always convergent iteration methods for nonlinear equations of Lipschitz functions
- The concept of sequential optimality for problems in numerical analysis
- scientific article; zbMATH DE number 3909615 (Why is no real title available?)
- An elementary solution of a minimax problem arising in algorithms for automatic mesh selection
- scientific article; zbMATH DE number 177335 (Why is no real title available?)
- Hierarchical approach of numerical minimax theorems with applications
- scientific article; zbMATH DE number 3907767 (Why is no real title available?)
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal 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
- Optimization of a class of information compression algorithms
- Comparison of independent, stratified and random covering sample schemes in optimization problems
- Markowitz investment Boolean problem in case of uncertainty, multicriteria and risk
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)
