On the efficiency of a global non-differentiable optimization algorithm based on the method of optimal set partitioning

DOI10.1023/A:1021931422223zbMath1030.90088OpenAlexW1545168611MaRDI QIDQ1411325

Elena Kiseleva, Tatyana Stepanchuk

Publication date: 27 October 2003

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021931422223

zbMATH Keywords

global minimumnon-differentiable optimizationoptimal set partitioning

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

Optimizing radial basis functions by d.c. programming and its use in direct search for global derivative-free optimization ⋮ A particle swarm pattern search method for bound constrained global optimization ⋮ Modelling transfer line design problem via a set partitioning problem ⋮ An optimal algorithm for global optimization and adaptive covering

This page was built for publication: On the efficiency of a global non-differentiable optimization algorithm based on the method of optimal set partitioning