An algorithm for solving nonlinear least-squares problems with a new curvilinear search (Q911233): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3702408 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An algorithm for solving sparse nonlinear least squares problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Testing Unconstrained Optimization Software / rank | |||
Normal rank | |||
Latest revision as of 15:05, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for solving nonlinear least-squares problems with a new curvilinear search |
scientific article |
Statements
An algorithm for solving nonlinear least-squares problems with a new curvilinear search (English)
0 references
1990
0 references
This paper brings a modification of the algorithm by the author [Computing 39, 307-325 (1987; Zbl 0618.65050)] for solving the nonlinear least squares problem \(\min \{\| F(x)\|^ 2;\quad x\in R^ n\}\) which uses a cheaper curvilinear search instead of the former trust- region strategy. It is proved that the modified algorithm has global convergence properties.
0 references
Gauss-Newton method
0 references
nonlinear least squares problem
0 references
curvilinear search
0 references
trust-region strategy
0 references
global convergence
0 references
