Iterative MC-algorithm to solve the global optimization problems
From MaRDI portal
Publication:2397267
DOI10.1134/S0005117917020060zbMath1362.90305OpenAlexW2587563479MaRDI QIDQ2397267
Yuri S. Popkov, Boris S. Darkhovsky, Alexey Yu. Popkov
Publication date: 22 May 2017
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117917020060
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Versions of the method of nonuniform coverings for global optimization of mixed integer nonlinear problems
- Monte Carlo method of batch iterations: probabilistic characteristics
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Introduction to global optimization
- Improving hit-and-run for global optimization
- Introduction to Global Optimization Exploiting Space-Filling Curves
- An Automatic Method of Solving Discrete Programming Problems
- Simulation and the Monte Carlo Method
- Monte Carlo sampling methods using Markov chains and their applications
This page was built for publication: Iterative MC-algorithm to solve the global optimization problems
