On the efficiency of a global non-differentiable optimization algorithm based on the method of optimal set partitioning
From MaRDI portal
Publication:1411325
DOI10.1023/A:1021931422223zbMath1030.90088MaRDI QIDQ1411325
Elena Kiseleva, Tatyana Stepanchuk
Publication date: 27 October 2003
Published in: Journal of Global Optimization (Search for Journal in Brave)
90C26: Nonconvex programming, global optimization
90C59: Approximation methods and heuristics in mathematical programming
Related Items
An optimal algorithm for global optimization and adaptive covering, Modelling transfer line design problem via a set partitioning problem, 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