Steklov regularization and trajectory methods for univariate global optimization (Q2301181)
From MaRDI portal
| 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: Steklov regularization and trajectory methods for univariate global optimization |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Steklov regularization and trajectory methods for univariate global optimization |
scientific article |
Statements
Steklov regularization and trajectory methods for univariate global optimization (English)
0 references
28 February 2020
0 references
The authors propose a trajectory-based algorithm, using the Steklov regularization function for finding a global minimizer of univariate coercive functions. For monic quartic polynomials, they prove that this trajectory generates a global minimizer. In the process, some properties of quartic polynomials are derived. Comparisons are made with a previous approach which uses a quadratic regularization function. The authors carry out numerical experiments to illustrate the working of the new method on polynomials of various degree as well as a non-polynomial function.
0 references
global optimization
0 references
mean filter
0 references
Steklov smoothing
0 references
Steklov regularization
0 references
scale-shift invariance
0 references
trajectory methods
0 references
0 references
0 references
0 references
0 references
0 references
0.8771676
0 references
0.8767115
0 references
0.8758376
0 references
0.8717783
0 references
0.86997384
0 references
0.86970806
0 references