Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function (Q6189573): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.5269/bspm.47772 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4210568808 / rank | |||
Normal rank | |||
Revision as of 10:09, 30 July 2024
scientific article; zbMATH DE number 7801892
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function |
scientific article; zbMATH DE number 7801892 |
Statements
Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function (English)
0 references
8 February 2024
0 references
convex quadratic programming
0 references
interior point methods
0 references
kernel function
0 references
iteration bound
0 references
