Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints

DOI10.1007/s00500-020-05078-1zbMath1491.90134OpenAlexW3036242146MaRDI QIDQ2156486

Semen Bevzuk, Konstantin Barkalov, Roman G. Strongin

Publication date: 18 July 2022

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-020-05078-1

zbMATH Keywords

global optimizationnumerical methodsdimensionality reductionnon-convex constraintsmultiextremal problemsLipschitz constant estimates

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (2)

Numerical methods using two different approximations of space-filling curves for black-box global optimization ⋮ Parallel global search algorithm with local tuning for solving mixed-integer global optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• An approach to constrained global optimization based on exact penalty functions
• Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization
• Global optimization. Scientific and engineering case studies
• A deterministic global optimization using smooth diagonal auxiliary functions
• An algorithm for global optimization of Lipschitz continuous functions
• Multidimensional bisection applied to global optimisation
• Global one-dimensional optimization using smooth auxiliary functions
• Lipschitzian optimization without the Lipschitz constant
• Local tuning and partition strategies for diagonal GO methods
• Global optimization: Fractal approach and non-redundant parallelism
• Global optimization with non-convex constraints. Sequential and parallel algorithms
• Generalized parallel computational schemes for time-consuming global optimization
• Solving a set of global optimization problems by the parallel technique with uniform convergence
• Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints
• Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
• A deterministic approach to global box-constrained optimization
• An information global minimization algorithm using the local improvement technique
• Comparison of several stochastic and deterministic derivative-free global optimization algorithms
• Globally-biased disimpl algorithm for expensive global optimization
• A DIRECT-type approach for derivative-free constrained global optimization
• Introduction to Global Optimization Exploiting Space-Filling Curves
• PSwarm: a hybrid solver for linearly constrained global derivative-free optimization
• BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
• An algorithm for finding the global maximum of a multimodal, multivariate function
• An algorithm for finding the absolute extremum of a function
• Acceleration of Global Search by Implementing Dual Estimates for Lipschitz Constant
• Algorithm 829
• Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
• A Sequential Method Seeking the Global Maximum of a Function
• Numerical methods for finding global extrema (Case of a non-uniform mesh)
• A locally-biased form of the DIRECT algorithm.
• Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints

This page was built for publication: Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints