A new preconditioning approach for an interior point‐proximal method of multipliers for linear and convex quadratic programming (Q4959589): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q114852901, #quickstatements; #temporary_batch_1711055989931 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1002/nla.2361 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/NLA.2361 / rank | |||
Normal rank | |||
Latest revision as of 16:26, 30 December 2024
scientific article; zbMATH DE number 7396244
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new preconditioning approach for an interior point‐proximal method of multipliers for linear and convex quadratic programming |
scientific article; zbMATH DE number 7396244 |
Statements
A new preconditioning approach for an interior point‐proximal method of multipliers for linear and convex quadratic programming (English)
0 references
16 September 2021
0 references
BFGS update
0 references
interior point method
0 references
Krylov subspace methods
0 references
preconditioning
0 references
proximal method of multipliers
0 references
