?
Iterative MC-algorithm to solve the global optimization problems
Automation and Remote Control. 2017. Vol. 78. No. 2. P. 261–275.
Popkov A., Darkhovsky B., Popkov Y. S.
A new method was proposed to solve the global minimization problems of the Hölder functions on compact sets obeying continuous functions. The method relies on the Monte Carlo batch processing intended for constructing the sequences of values of the “quasi-global” minima and their decrements. A numerical procedure was proposed to generate a probabilistic stopping rule whose operability was corroborated by numerous tests and benchmarks with algorithmically defined functions.
De Raynal P. C., Honoré I., Menozzi S., Probability Theory and Related Fields 2022 Vol. 184 P. 1–83
We establish strong uniqueness for a class of degenerate SDEs of weak Hörmander type under suitable Hölder regularity conditions for the associated drift term. Our approach relies on the Zvonkin transform which requires to exhibit good smoothing properties of the underlying parabolic PDE with rough, here Hölder, drift coefficients and source term. Such regularizing effects are ...
Added: November 8, 2022
Smirnov S., Voloshinov V., O.V. Sukhoroslov, , in: Proceedings of the 9th International Conference "Distributed Computing and Grid Technologies in Science and Education" (GRID'2021), Dubna, Russia, July 5-9, 2021.: CEUR Workshop Proceedings, 2021. P. 413–417.
ParaSCIP is rather advanced open-source solver for discrete and global optimization problems. This solver is distinguished by that it can run on distributed memory systems and use up to 80,000 cores, solving open problems from the MIPLIB test libraries. Earlier, using this solver, we confirmed the conjecture on optimal packing of nine congruent circles on ...
Added: October 30, 2022
Posypkin M., Kolpakov R., Optimization Letters 2020 Vol. 14 No. 8 P. 2211–2226
Increasing the number of computational cores is a primary way of achieving the high performance of contemporary supercomputers. However, developing parallel applications capable to harness the enormous amount of cores is a challenging task. It is very important to understand the principle limitations of the scalability of parallel applications imposed by the algorithm’s structure. The ...
Added: October 30, 2020
Smirnov S., Sukhoroslov O. V., Voloshinov V., , in: Supercomputing. RuSCDays 2018. Communications in Computer and Information Science, vol 965. Springer, Cham.: Springer, 2019. P. 687–698.
High-performance computing plays an increasingly important role in modern science and technology. However, the lack of convenient interfaces and automation tools greatly complicates the widespread use of HPC resources among scientists. The paper presents an approach to solving these problems relying on Everest, a web-based distributed computing platform. The platform enables convenient access to HPC ...
Added: October 19, 2019
Smirnov Sergey A., Voloshinov V., / Series arXiv "math". 2018. No. 1809.10525.
The article demonstrates rather general approach to problems of discrete geometry: treat them as global optimization problems to be solved by one of general purpose solver implementing branch-and-bound algorithm (B&B). This approach may be used for various types of problems, i.e. Tammes problems, Thomson problems, search of minimal potential energy of micro-clusters, etc. Here we ...
Added: December 20, 2018
Yuri Evtushenko, Mikhail Posypkin, Turkin A. et al., Journal of Global Optimization 2018 Vol. 71 No. 1 P. 129–145
In this paper we propose a method for solving systems of nonlinear inequalities with predefined accuracy based on nonuniform covering concept formerly adopted for global optimization. The method generates inner and outer approximations of the solution set. We describe the general concept and three ways of numerical implementation of the method. The first one is ...
Added: October 31, 2018
Springer, 2015.
This book constitutes revised selected papers from the First International Workshop on Machine Learning, Optimization, and Big Data, MOD 2015, held in Taormina, Sicily, Italy, in July 2015.
The 32 papers presented in this volume were carefully reviewed and selected from 73 submissions. They deal with the algorithms, methods and theories relevant in data science, optimization ...
Added: October 23, 2018
Kashnitsky Y., Kuznetsov S., , in: CLA 2016: Proceedings of the Thirteenth International Conference on Concept Lattices and Their Applications. CEUR Workshop ProceedingsVol. 1624.: M.: Higher School of Economics, National Research University, 2016. Ch. 19 P. 189–202.
Nowadays decision tree learning is one of the most popular classification and regression techniques. Though decision trees are not accurate on their own, they make very good base learners for advanced tree-based methods such as random forests and gradient boosted trees. However, applying ensembles of trees deteriorates interpretability of the final model. Another problem is ...
Added: October 6, 2016
Громов И. Ю., Kozhevnikov A., В кн.: Новые информационные технологии в автоматизированных системах: материалы восемнадцатого научно-технического семинара.: М.: Институт прикладной математики им. М.В. Келдыша РАН, 2015. С. 311–316.
In this paper the technique of parametric and structural synthesis of systems of maintenance of thermal modes of electronic equipment, as optimality criterion uses the ratio of the price system - the quality (the degree of approximation of the temperature to the desired values). Describes the developed software which allows to obtain practical results through ...
Added: February 21, 2016
Wang L., Yang R., Ni H. et al., Applied Soft Computing Journal 2015 Vol. 34 P. 736–743
Inspired by human learning mechanisms, a novel meta-heuristic algorithm named human learning optimization (HLO) is presented in this paper in which the individual learning operator, social learning operator, random exploration learning operator and re-learning operator are developed to generate new solutions and search for the optima by mimicking the human learning process. Then HLO is ...
Added: June 24, 2015
NY: Springer, 2014.
This volume contains a collection of papers based on lectures and presentations delivered at the International Conference on Constructive Nonsmooth Analysis (CNSA) held in St. Petersburg (Russia) from June 18-23, 2012. This conference was organized to mark the 50th anniversary of the birth of nonsmooth analysis and nondifferentiable optimization and was dedicated to J.-J. Moreau ...
Added: September 21, 2013
Horst R., Pardalos P. M., Van Thoai N., Amsterdam: Springer, 2000.
Most of the existing books on optimization focus on the problem of computing locally optimal solutions. Global optimization is concerned with the computation and characterization of global optima of nonlinear functions. Global optimization problems are widespread in the mathematical modeling of real world systems for a very broad range of applications. During the past three ...
Added: February 5, 2013