A new unconstrained optimization method for imprecise function and gradient values (Q1916739): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1006/jmaa.1996.0041 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2151778798 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1006/JMAA.1996.0041 / rank | |||
Normal rank | |||
Latest revision as of 12:47, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new unconstrained optimization method for imprecise function and gradient values |
scientific article |
Statements
A new unconstrained optimization method for imprecise function and gradient values (English)
0 references
14 July 1996
0 references
The paper presents a numerical algorithm for computing the minimum of a function of \(n\) real variables, based on one-dimensional bisections. They give various numerical results.
0 references
relaxation
0 references
one-dimensional bisections
0 references
