Pages that link to "Item:Q5081279"
From MaRDI portal
The following pages link to Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions (Q5081279):
Displaying 5 items.
- A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term (Q6046863) (← links)
- Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions (Q6125139) (← links)
- A large-update primal-dual interior-point algorithm for convex quadratic optimization based on a new bi-parameterized bi-hyperbolic Kernel function (Q6586751) (← links)
- An efficient hyperbolic kernel function yielding the best known iteration bounds for linear programming (Q6661713) (← links)
- Complexity analysis of primal-dual interior-point methods for convex quadratic programming based on a new twice parameterized kernel function (Q6662798) (← links)
