The DIRECT algorithm: 25 years later (Q2022319)

From MaRDI portal

Revision as of 19:19, 16 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use this page instead for the normal view: The DIRECT algorithm: 25 years later

scientific article

Language	Label	Description	Also known as
English	The DIRECT algorithm: 25 years later	scientific article

Statements

scholarly article

0 references

The DIRECT algorithm: 25 years later (English)

0 references

Donald R. Jones

0 references

Joaquim R. R. A. Martins

0 references

Journal of Global Optimization

0 references

publication date

28 April 2021

0 references

zbMATH Keywords

DIRECT

0 references

global optimization

0 references

Lipschitzian optimization

0 references

black-box

0 references

derivative-free

0 references

exploitation versus exploration

0 references

describes a project that uses

0 references

Global Optimization Test

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

MaRDI profile type

0 references

full work available at URL

https://doi.org/10.1007/s10898-020-00952-6

0 references

Using DIRECT to solve an aircraft routing problem

0 references

Derivative-free global ship design optimization using global/local hybridization of the DIRECT algorithm

0 references

Algorithms for noisy problems in gas transmission pipeline optimization

0 references

Filter-based DIRECT method for constrained global optimization

0 references

A comparison of global optimization methods for the design of a high-speed civil transport

0 references

A derivative-free algorithm for constrained global optimization based on exact penalty functions

0 references

A DIRECT-type approach for derivative-free constrained global optimization

0 references

Homogeneous algorithms for multiextremal optimization

0 references

Additive scaling and the \texttt{DIRECT} algorithm

0 references

Nonlinear programming without a penalty function.

0 references

A locally-biased form of the DIRECT algorithm.

0 references

0 references

Lipschitz optimization methods for fitting a sum of damped sinusoids to a series of observations

0 references

A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function

0 references

0 references

On using estimates of Lipschitz constants in global optimization

0 references

Global optimization by multilevel coordinate search

0 references

On the identification of the convex hull of a finite set of points in the plane

0 references

Lipschitzian optimization without the Lipschitz constant

0 references

Local tuning and partition strategies for diagonal GO methods

0 references

Multidimensional Lipschitz global optimization based on efficient diagonal partitions

0 references

MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems

0 references

Improving the convergence rate of the DIRECT global optimization algorithm

0 references

A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems

0 references

Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization

0 references

Array processing and fast optimization algorithms for distorted circular contour retrieval

0 references

0 references

Application of reduced-set Pareto-Lipschitzian optimization to truss optimization

0 references

Simplicial Lipschitz optimization without the Lipschitz constant

0 references

Globally-biased disimpl algorithm for expensive global optimization

0 references

Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants

0 references

Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications

0 references

An algorithm for finding the absolute extremum of a function

0 references

Derivative-free optimization: a review of algorithms and comparison of software implementations

0 references

Application of the \texttt{DIRECT} algorithm to searching for an optimal \(k\)-partition of the set \(\mathcal {A}\subset \mathbb {R}^n\) and its application to the multiple circle detection problem

0 references

An Information Global Optimization Algorithm with Local Tuning

0 references

Global one-dimensional optimization using smooth auxiliary functions

0 references

Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms

0 references

Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants

0 references

Deterministic Global Optimization

0 references

On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales

0 references

A Sequential Method Seeking the Global Maximum of a Function

0 references

Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}

0 references

Global optimization with non-convex constraints. Sequential and parallel algorithms

0 references

Adaptive block coordinate DIRECT algorithm

0 references

On strong homogeneity of two global optimization algorithms based on statistical models of multimodal objective functions

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1007/S10898-020-00952-6

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2022319

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2022319&oldid=38835994"