One-dimensional P-algorithm with convergence rate \(O(n^{-3+\delta})\) for smooth functions
From MaRDI portal
Publication:1594873
DOI10.1023/A:1004699313526zbMath0992.90053MaRDI QIDQ1594873
Antanas Žilinskas, James M. Calvin
Publication date: 30 July 2002
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
optimizationadaptive algorithmconvergence ratestatistical modelsdecreasing sequence of threshold valuesone-dimensional P-algorithm
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) One- and multidimensional scaling in the social and behavioral sciences (91C15)
Related Items (12)
Safe global optimization of expensive noisy black-box functions in the \(\delta \)-Lipschitz framework ⋮ An adaptive univariate global optimization algorithm and its convergence rate for twice continuously differentiable functions ⋮ P-algorithm based on a simplicial statistical model of multimodal functions ⋮ Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives ⋮ A deterministic global optimization using smooth diagonal auxiliary functions ⋮ On a global optimization algorithm for bivariate smooth functions ⋮ A system for distance studies and applications of metaheuristics ⋮ On convergence rate of a rectangular partition based global optimization algorithm ⋮ GOSH: derivative-free global optimization using multi-dimensional space-filling curves ⋮ A statistical model-based algorithm for ‘black-box’ multi-objective optimisation ⋮ Bi-objective decision making in global optimization based on statistical models ⋮ Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
Cites Work
This page was built for publication: One-dimensional P-algorithm with convergence rate \(O(n^{-3+\delta})\) for smooth functions
