A two-step improved Newton method to solve convex unconstrained optimization problems (Q2053267): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s12190-019-01272-z / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127592477 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S12190-019-01272-Z / rank | |||
Normal rank | |||
Latest revision as of 22:47, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A two-step improved Newton method to solve convex unconstrained optimization problems |
scientific article |
Statements
A two-step improved Newton method to solve convex unconstrained optimization problems (English)
0 references
29 November 2021
0 references
Newton method
0 references
unconstrained optimization problems
0 references
convergence analysis
0 references
0 references
0 references
0 references
0 references
0 references
