Test Problems for Lipschitz Univariate Global Optimization with Multiextremal Constraints

DOI10.1007/0-306-47648-7_6zbMATH Open1211.90180OpenAlexW114360678MaRDI QIDQ2999080FDOQ2999080

Yaroslav D. Sergeyev, Paolo Pugliese, Domenico Famularo

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

zbMATH Keywords

global optimizationnumerical experimentstest problemsmultiextremal constraints

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Cited In (8)

• A generalization of the construction of test problems for nonconvex optimization
• 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
• Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
• 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)

This page was built for publication: Test Problems for Lipschitz Univariate Global Optimization with Multiextremal Constraints

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