Unidimensional curve fitting search schemes revisited for multidimensional optimization algorithms (Q1064742): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0045-7906(84)90014-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1997601270 / rank | |||
Normal rank | |||
Latest revision as of 19:58, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unidimensional curve fitting search schemes revisited for multidimensional optimization algorithms |
scientific article |
Statements
Unidimensional curve fitting search schemes revisited for multidimensional optimization algorithms (English)
0 references
1984
0 references
Many approaches to n-dimensional optimization require a subroutine for 1- dimensional minimization. This paper proposes 2 new linesearch algorithms (to be used in the context of n-dimensional optimization) and compares them, experimentally, to the quadratic fit and cubic interpolation methods.
0 references
n-dimensional optimization
0 references
linesearch algorithms
0 references
quadratic fit
0 references
cubic interpolation
0 references
