Test Problems for Lipschitz Univariate Global Optimization with Multiextremal Constraints
From MaRDI portal
Publication:2999080
DOI10.1007/0-306-47648-7_6zbMath1211.90180OpenAlexW114360678MaRDI QIDQ2999080
Paolo Pugliese, Domenico Famularo, Yaroslav D. Sergeyev
Publication date: 11 May 2011
Published in: Nonconvex Optimization and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/0-306-47648-7_6
Related Items (7)
Best practices for comparing optimization algorithms ⋮ Univariate global optimization with multiextremal non-differentiable constraints without penalty functions ⋮ Metaheuristic vs. deterministic global optimization algorithms: the univariate case ⋮ A perturbed version of an inexact generalized Newton method for solving nonsmooth equations ⋮ A one-dimensional local tuning algorithm for solving GO problems with partially defined constraints ⋮ A nonsmooth version of the univariate optimization algorithm for locating the nearest extremum (locating extremum in nonsmooth univariate optimization) ⋮ Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
This page was built for publication: Test Problems for Lipschitz Univariate Global Optimization with Multiextremal Constraints
