Mykhaylo I. Schlesinger
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Mykhaylo I. Schlesinger has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Evgeniy Vodolazskiy
Institute of Information Technologies and Systems, National Academy of Sciences of Ukraine, Kyiv, Ukraine
7 shared publications - V. M. Yakovenko
MES and NAS of Ukraine
3 shared publications - Boris Flach
Czech Technical University Prague
2 shared publications International Research and Training Center for Information Technologies and Systems of NAS of Ukraine and MES of Ukraine
1 shared publicationInternational Research and Training Centre of Information Technologies and Systems of the NAS and MES of Ukraine
1 shared publication- K. V. Antoniuka
International Scientific-Educational Center of Information Technologies and Systems, NAS and NES of Ukraine
1 shared publication
Latest Publications
- 1 January 2026
- Published by Springer Nature in Cybernetics and Systems Analysis
- Vol. 62 (1) , 87-92
Asymmetrical Generalisation of Chebyshev’s Inequality
- 1 January 2026
- Published by Springer Nature in Cybernetics and Systems Analysis
- Vol. 62 (1) , 87-92
Asymmetrical Generalisation of Chebyshev’s Inequality
- 26 July 2023
- Published by Springer Nature in Cybernetics and Systems Analysis
- Vol. 59 (4) , 567-580
Minimax Theorem for Functions on the Cartesian Product of Branching Polylines
- 26 July 2023
- Published by Springer Nature in Cybernetics and Systems Analysis
- Vol. 59 (4) , 567-580
Minimax Theorem for Functions on the Cartesian Product of Branching Polylines
- 16 December 2022
- Published by Taylor & Francis in The American Mathematical Monthly
- Vol. 130 (2) , 145-157
Minimax Theorem Revisited
The article presents a new proof of the minimax theorem. Its novelty is that it uses only elementary concepts within the scope of obligatory mathematical education of engineers. The minimax theorem results in numerous applications and many of them are far from being obvious. Hence the use of such applications has to be based not only on belief in the minimax theorem, but on a transparent understanding of it without need of more complicated concepts. The audience for this article is mathematicians who lecture on convex analysis to nonmathematicians.
- 16 December 2022
- Published by Taylor & Francis in The American Mathematical Monthly
- Vol. 130 (2) , 145-157
Minimax Theorem Revisited
The article presents a new proof of the minimax theorem. Its novelty is that it uses only elementary concepts within the scope of obligatory mathematical education of engineers. The minimax theorem results in numerous applications and many of them are far from being obvious. Hence the use of such applications has to be based not only on belief in the minimax theorem, but on a transparent understanding of it without need of more complicated concepts. The audience for this article is mathematicians who lecture on convex analysis to nonmathematicians.
- 1 November 2022
- Published by Springer Nature in Cybernetics and Systems Analysis
- Vol. 58 (6) , 862-875
Minimax Deviation Strategies for Machine Learning and Recognition with Short Learning Samples
- 1 November 2022
- Published by Springer Nature in Cybernetics and Systems Analysis
- Vol. 58 (6) , 862-875
Minimax Deviation Strategies for Machine Learning and Recognition with Short Learning Samples
- Open Access
- 1 January 2022
- Published by National Academy of Sciences of Ukraine (Co. LTD Ukrinformnauka) (Publications) in Control Systems and Computers
- No. 1 (297),p. 15-23
Solution of Soft Constrains Problems via their Reparametrization
Introduction. The past quarter-century is characterized by the birth of a new scientific direction, formed as a result of combining research in pattern recognition problems and constraint satisfaction problems. These two scientific directions traditionally belong to the problem of artificial intelligence, but they formalize different aspects of intellectual activity. The formation of a single formal scheme that combines these two directions expands and concretizes the concept of machine thinking, on the formalization of which they are oriented, and necessitates the development of new and improvement of known mathematical optimization methods. Objective. Comparison of three currently known polynomially solvable subclasses of the NP-hard class of optimization problems, which constitutes a mathematical formalization of a new scientific direction. Problems of the first subclass are solved by dynamic programming methods, problems of the second subclass are solved by supermodular maximization methods, and problems of the third subclass are solved by methods of equivalent transformation of optimization problems, also known as their reparametrization. Result. The subclass of problems solved on the basis of their reparametrization includes subclasses solved using dynamic programming or supermodular maximization and thus is the most extensive among the three currently known polynomially solvable subclasses. Conclusion. Key moments in the process of formation of a new scientific direction are given.
- 1 January 2022
- Published by National Academy of Sciences of Ukraine (Co. LTD Ukrinformnauka) (Publications) in Control Systems and Computers
- No. 1 (297),p. 15-23
Open AccessSolution of Soft Constrains Problems via their Reparametrization
Introduction. The past quarter-century is characterized by the birth of a new scientific direction, formed as a result of combining research in pattern recognition problems and constraint satisfaction problems. These two scientific directions traditionally belong to the problem of artificial intelligence, but they formalize different aspects of intellectual activity. The formation of a single formal scheme that combines these two directions expands and concretizes the concept of machine thinking, on the formalization of which they are oriented, and necessitates the development of new and improvement of known mathematical optimization methods. Objective. Comparison of three currently known polynomially solvable subclasses of the NP-hard class of optimization problems, which constitutes a mathematical formalization of a new scientific direction. Problems of the first subclass are solved by dynamic programming methods, problems of the second subclass are solved by supermodular maximization methods, and problems of the third subclass are solved by methods of equivalent transformation of optimization problems, also known as their reparametrization. Result. The subclass of problems solved on the basis of their reparametrization includes subclasses solved using dynamic programming or supermodular maximization and thus is the most extensive among the three currently known polynomially solvable subclasses. Conclusion. Key moments in the process of formation of a new scientific direction are given.
- 30 January 2018
- Published by Springer Nature in Cybernetics and Systems Analysis
- Vol. 54 (1) , 60-74
Finding a Given Number of Solutions to a System of Fuzzy Constraints*
- 30 January 2018
- Published by Springer Nature in Cybernetics and Systems Analysis
- Vol. 54 (1) , 60-74
Finding a Given Number of Solutions to a System of Fuzzy Constraints*
- Open Access
How to Formulate and Solve Statistical Recognition and Learning Problems
We formulate problems of statistical recognition and learning in a common framework of complex hypothesis testing. Based on arguments from multi-criteria optimization, we identify strategies that are improper for solving these problems and derive a common form of the remaining strategies. We show that some widely used approaches to recognition and learning are improper in this sense. We then propose a generalized formulation of the recognition and learning problem which embraces the whole range of sizes of the learning sample, including the zero size. Learning becomes a special case of recognition without learning. We define the concept of closest to optimal strategy, being a solution to the formulated problem, and describe a technique for finding such a strategy. On several illustrative cases, the strategy is shown to be superior to the widely used learning methods based on maximal likelihood estimation.
Open AccessHow to Formulate and Solve Statistical Recognition and Learning Problems
We formulate problems of statistical recognition and learning in a common framework of complex hypothesis testing. Based on arguments from multi-criteria optimization, we identify strategies that are improper for solving these problems and derive a common form of the remaining strategies. We show that some widely used approaches to recognition and learning are improper in this sense. We then propose a generalized formulation of the recognition and learning problem which embraces the whole range of sizes of the learning sample, including the zero size. Learning becomes a special case of recognition without learning. We define the concept of closest to optimal strategy, being a solution to the formulated problem, and describe a technique for finding such a strategy. On several illustrative cases, the strategy is shown to be superior to the widely used learning methods based on maximal likelihood estimation.
- Open Access
Frechet similarity of closed polygonal curves
The article analyzes similarity of closed polygonal curves with respect to the Frechet metric, which is stronger than the well-known Hausdorff metric and therefore is more appropriate in some applications. An algorithm is described that determines whether the Frechet distance between two closed polygonal curves with m and n vertices is less than a given number. The algorithm takes O(mn) time whereas the previously known algorithms take O(mn log(mn)) time.
Open AccessFrechet similarity of closed polygonal curves
The article analyzes similarity of closed polygonal curves with respect to the Frechet metric, which is stronger than the well-known Hausdorff metric and therefore is more appropriate in some applications. An algorithm is described that determines whether the Frechet distance between two closed polygonal curves with m and n vertices is less than a given number. The algorithm takes O(mn) time whereas the previously known algorithms take O(mn log(mn)) time.
- Open Access
Similarity of closed polygonal curves in Frechet metric
The article analyzes similarity of closed polygonal curves in Frechet metric, which is stronger than the well-known Hausdorff metric and therefore is more appropriate in some applications. An algorithm that determines whether the Frechet distance between two closed polygonal curves with m and n vertices is less than a given number is described. The described algorithm takes O(mn) time whereas the previously known algorithms take O(mn log(mn)) time.
Open AccessSimilarity of closed polygonal curves in Frechet metric
The article analyzes similarity of closed polygonal curves in Frechet metric, which is stronger than the well-known Hausdorff metric and therefore is more appropriate in some applications. An algorithm that determines whether the Frechet distance between two closed polygonal curves with m and n vertices is less than a given number is described. The described algorithm takes O(mn) time whereas the previously known algorithms take O(mn log(mn)) time.
- 23 August 2014
- Published by Pleiades Publishing Ltd in Computational Mathematics and Mathematical Physics
- Vol. 54 (8) , 1327-1336
Minimax problems of discrete optimization invariant under majority operators
A special class of discrete optimization problems that are stated as a minimax modification of the constraint satisfaction problem is studied. The minimax formulation of the problem generalizes the classical problem to realistic situations where the constraints order the elements of the set by the degree of their feasibility, rather than defining a dichotomy between feasible and infeasible subsets. The invariance of this ordering under an operator is defined, and the discrete minimization of functions invariant under majority operators is proved to have polynomial complexity. A particular algorithm for this minimization is described.
- 23 August 2014
- Published by Pleiades Publishing Ltd in Computational Mathematics and Mathematical Physics
- Vol. 54 (8) , 1327-1336
Minimax problems of discrete optimization invariant under majority operators
A special class of discrete optimization problems that are stated as a minimax modification of the constraint satisfaction problem is studied. The minimax formulation of the problem generalizes the classical problem to realistic situations where the constraints order the elements of the set by the degree of their feasibility, rather than defining a dichotomy between feasible and infeasible subsets. The invariance of this ordering under an operator is defined, and the discrete minimization of functions invariant under majority operators is proved to have polynomial complexity. A particular algorithm for this minimization is described.