Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints
From MaRDI portal
Publication:1850829
DOI10.1023/A:1012391611462zbMath1033.49038OpenAlexW168211946MaRDI QIDQ1850829
Yaroslav D. Sergeyev, Domenico Famularo, Paolo Pugliese
Publication date: 15 December 2002
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1012391611462
Nonconvex programming, global optimization (90C26) Numerical methods based on necessary conditions (49M05)
Related Items (17)
Univariate global optimization with multiextremal non-differentiable constraints without penalty functions ⋮ Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints ⋮ Safe global optimization of expensive noisy black-box functions in the \(\delta \)-Lipschitz framework ⋮ Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics ⋮ A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set ⋮ A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function ⋮ Metaheuristic vs. deterministic global optimization algorithms: the univariate case ⋮ Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes ⋮ Parallel global optimization algorithm with uniform convergence for solving a set of constrained global optimization problems ⋮ Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives ⋮ Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems ⋮ Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms ⋮ A one-dimensional local tuning algorithm for solving GO problems with partially defined constraints ⋮ A new global optimization method for univariate constrained twice-differentiable NLP problems ⋮ Solving a set of global optimization problems by the parallel technique with uniform convergence ⋮ Efficient multicriterial optimization based on intensive reuse of search information ⋮ Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization
Uses Software
This page was built for publication: Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints
