Pages that link to "Item:Q6189573"
From MaRDI portal
The following pages link to Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function (Q6189573):
Displaying 2 items.
- A large-update primal-dual interior-point algorithm for convex quadratic optimization based on a new bi-parameterized bi-hyperbolic Kernel function (Q6586751) (← links)
- Complexity analysis of primal-dual interior-point methods for convex quadratic programming based on a new twice parameterized kernel function (Q6662798) (← links)
