Multilevel iterative schemes of numerical optimization
The author describes a class of numerical methods for mathematical programming problems and problems of the solution of equations based on the approximation of the initial problem to a collection of simpler problems ordered with respect to their complexities. The class of methods in question is described in the form of a general iterative scheme, the concrete definition of which allows one to obtain new methods, as well as classical numerical methods of Newton type. The proposed methods are aimed at a reduction of the computation expenditures for the solution of complex problems of mathematical programming. Some problems of global optimization of nonconvex functions, problems of statistical optimization of parameters of control algorithms, identification problems, problems of terminal control, and other problems of this kind constitute promising directions of the application of suggested multilevel schemes.
- Multigrid optimization in applications
- Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms
- General schemes of iterative optimization with applications to optimal control problems
- Multiplicative schemes of iterational algorithms. II: Convex programming
- scientific article; zbMATH DE number 4059134
This page was built for publication: Multilevel iterative schemes of numerical optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1920369)
