Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines (Q1904957)
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: Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines |
scientific article |
Statements
Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines (English)
0 references
30 May 1996
0 references
linearly convergent descent methods
0 references
convex quadratic spline
0 references
convex quadratic programs
0 references
unconstrained minimization
0 references
row-action methods
0 references
matrix-splitting methods
0 references
Newton-type methods
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
