Complexity analysis of primal-dual interior-point methods for convex quadratic programming based on a new twice parameterized kernel function (Q6662798)
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: Complexity analysis of primal-dual interior-point methods for convex quadratic programming based on a new twice parameterized kernel function |
scientific article; zbMATH DE number 7966764
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity analysis of primal-dual interior-point methods for convex quadratic programming based on a new twice parameterized kernel function |
scientific article; zbMATH DE number 7966764 |
Statements
Complexity analysis of primal-dual interior-point methods for convex quadratic programming based on a new twice parameterized kernel function (English)
0 references
14 January 2025
0 references
convex quadratic programming
0 references
kernel function
0 references
interior-point methods
0 references
large- and small-update methods
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
