On the convergence of the P-algorithm for one-dimensional global optimization of smooth functions
From MaRDI portal
Publication:1807681
DOI10.1023/A:1022677121193zbMath0985.90075MaRDI QIDQ1807681
James M. Calvin, Antanas Žilinskas
Publication date: 19 December 1999
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Related Items
P-algorithm based on a simplicial statistical model of multimodal functions, Univariate global optimization with multiextremal non-differentiable constraints without penalty functions, Global optimization based on a statistical model and simplicial partitioning., One-dimensional P-algorithm with convergence rate \(O(n^{-3+\delta})\) for smooth functions, Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization, An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial, Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
Cites Work