A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints (Q2147941)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints |
scientific article |
Statements
A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints (English)
0 references
20 June 2022
0 references
convex programming
0 references
interior-point methods
0 references
arc-search
0 references
box constraints
0 references
polynomial complexity
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
0 references
0 references
0 references
0 references
0 references
