An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints (Q2674577)
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: An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints |
scientific article; zbMATH DE number 7584378
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints |
scientific article; zbMATH DE number 7584378 |
Statements
An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints (English)
0 references
14 September 2022
0 references
arc-search
0 references
interior-point method
0 references
convex quadratic programming
0 references
polynomial algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
