A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints (Q2147941)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7545234
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints |
scientific article; zbMATH DE number 7545234 |
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
0 references
0 references
0 references
0.9340940713882446
0 references
0.9121274352073668
0 references
0.8536730408668518
0 references
