Publication:828539

DOI10.1134/S0005117920080093zbMATH Open1457.90117OpenAlexW3091438572MaRDI QIDQ828539FDOQ828539

Victor P. Gergel, K. A. Barkalov, Roman G. Strongin

Publication date: 9 January 2021

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117920080093

zbMATH Keywords

dimensionality reductionglobal optimizationPeano curvesmultiextremal objective functionsrecursive optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithm 829
• Lipschitzian optimization without the Lipschitz constant
• Global optimization with non-convex constraints. Sequential and parallel algorithms
• Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
• Lipschitz global optimization methods in control problems
• Parallel characteristical algorithms for solving problems of global optimization
• Adaptive nested optimization scheme for multidimensional global search
• BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
• An algorithm for finding the absolute extremum of a function
• A Sequential Method Seeking the Global Maximum of a Function
• Numerical methods for finding global extrema (Case of a non-uniform mesh)
• Parallelization of the global extremum searching process
• A deterministic approach to global box-constrained optimization
• Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
• Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
• Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes
• Parallel multiextremum optimization using a set of Peano curves
• On a uniform estimate of the set of weakly effective points in multi- criterion multi-extremal optimization problems
• Comparison of several stochastic and deterministic derivative-free global optimization algorithms
• Metaheuristic vs. deterministic global optimization algorithms: the univariate case
• Search for the extremum of functions by the principle of maximum information
• Multi-extremal minimization
• A method for solving multi-extremal problems with non-convex constraints, that uses a priori information about estimates of the optimum

Cited In (1)

• Parallel global search algorithm with local tuning for solving mixed-integer global optimization problems

Uses Software

• Global Optimization Toolbox For Maple
• LGO
• Algorithm 829

This page was built for publication: Adaptive global optimization based on a block-recursive dimensionality reduction scheme

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q828539)