Precision, complexity, and computational schemes of the cubic algorithms
From MaRDI portal
Publication:1090611
DOI10.1007/BF00938537zbMath0621.90070MaRDI QIDQ1090611
Publication date: 1988
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
derivative-free optimizationcubic algorithmmulti-extremal, nonconvex Lipschitzian optimizationnongradient method
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items (10)
The integer cubic algorithm ⋮ An implicit enumeration method for global optimization problems ⋮ New LP bound in multivariate Lipschitz optimization: Theory and applications ⋮ Global optimization in problems with uncertainties: the gamma algorithm. ⋮ Integral global optimization method for differential games with application to pursuit-evasion games ⋮ When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation ⋮ Convergence qualification of adaptive partition algorithms in global optimization ⋮ Global optimization of univariate Lipschitz functions. I: Survey and properties ⋮ Problem-method classification in optimization and control ⋮ The cubic algorithm for global games with application to pursuit-evasion games
Cites Work
This page was built for publication: Precision, complexity, and computational schemes of the cubic algorithms
