Metaheuristic vs. deterministic global optimization algorithms: the univariate case (Q2422871): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 13:21, 18 December 2024

scientific article

Language	Label	Description	Also known as
English	Metaheuristic vs. deterministic global optimization algorithms: the univariate case	scientific article

Statements

scholarly article

0 references

Metaheuristic vs. deterministic global optimization algorithms: the univariate case (English)

0 references

Dmitri E. Kvasov

0 references

Marat S. Mukhametzhanov

0 references

Applied Mathematics and Computation

0 references

publication date

21 June 2019

0 references

zbMATH Keywords

constrained global optimization

0 references

numerical comparison

0 references

Lipschitz-based deterministic approaches

0 references

nature-inspired metaheuristics

0 references

describes a project that uses

0 references

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.amc.2017.05.014

0 references

Lipschitz global optimization methods in control problems

0 references

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

0 references

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

0 references

Encyclopedia of Optimization

0 references

Handbook of global optimization. Vol. 2

0 references

A comparative study of artificial bee colony algorithm

0 references

A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm

0 references

An adaptive constraint handling technique for differential evolution with dynamic use of variants in engineering optimization

0 references

Introduction to Global Optimization Exploiting Space-Filling Curves

0 references

Deterministic Global Optimization

0 references

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

0 references

Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms

0 references

Global Convergence of Radial Basis Function Trust-Region Algorithms for Derivative-Free Optimization

0 references

A one-dimensional local tuning algorithm for solving GO problems with partially defined constraints

0 references

Test Problems for Lipschitz Univariate Global Optimization with Multiextremal Constraints

0 references

Parallel global optimization on GPU

0 references

Multidimensional Lipschitz global optimization based on efficient diagonal partitions

0 references

Parallel characteristical algorithms for solving problems of global optimization

0 references

Adaptive nested optimization scheme for multidimensional global search

0 references

A partition-based global optimization algorithm

0 references

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

0 references

Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives

0 references

Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization

0 references

Two Methods for Solving Optimization Problems Arising in Electronic Measurements and Electrical Engineering

0 references

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

0 references

Stochastic algorithms for solving structured low-rank matrix approximation problems

0 references

On the Least-Squares Fitting of Data by Sinusoids

0 references

Differential evolution. A practical approach to global optimization. With CD-ROM.

0 references

0 references

A hybrid PSO-GA algorithm for constrained optimization problems

0 references

0 references

Univariate geometric Lipschitz global optimization algorithms

0 references

0 references

Stochastic global optimization.

0 references

On similarities between two models of global optimization: Statistical models and radial basis functions

0 references

A deterministic approach to global box-constrained optimization

0 references

A global minimization algorithm for Lipschitz functions

0 references

An Information Global Optimization Algorithm with Local Tuning

0 references

Globally-biased disimpl algorithm for expensive global optimization

0 references

An algorithm for finding the absolute extremum of a function

0 references

Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints

0 references

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.AMC.2017.05.014

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2422871

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