A compact variable metric algorithm for nonlinear minimax approximation (Q1062915): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02240210 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W291295066 / rank | |||
Normal rank | |||
Latest revision as of 08:43, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A compact variable metric algorithm for nonlinear minimax approximation |
scientific article |
Statements
A compact variable metric algorithm for nonlinear minimax approximation (English)
0 references
1986
0 references
The paper contains a description of an efficient algorithm for nonlinear minimax approximation. This algorithm uses an approximation of the inverse Hessian matrix of the Lagrangian function which is updated by means of the variable metric method. The main advantage of the new algorithm consists in a simple determination of the direction vector. No quadratic programming subproblem has to be solved. The efficiency of the algorithm is demonstrated on test problems.
0 references
nonlinear minimax approximation
0 references
inverse Hessian matrix of the Lagrangian function
0 references
variable metric method
0 references
