A new sampling method in the DIRECT algorithm

DOI10.1016/J.AMC.2005.07.051zbMath1088.65057OpenAlexW2051855984MaRDI QIDQ2369158

Lakhdar Chiter

Publication date: 28 April 2006

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2005.07.051

zbMATH Keywords

ConvergenceGlobal optimizationDIRECT algorithmSampling methodWeakly optimal interval

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (2)

A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function ⋮ On the properties of reachability, observability, controllability, and constructibility of discrete-time positive time-invariant linear systems with aperiodic choice of the sampling instants

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• On Timonov's algorithm for global optimization of univariate Lipschitz functions
• Lipschitzian optimization without the Lipschitz constant
• Algorithms for noisy problems in gas transmission pipeline optimization
• A Sequential Method Seeking the Global Maximum of a Function
• A locally-biased form of the DIRECT algorithm.

This page was built for publication: A new sampling method in the DIRECT algorithm