Pages that link to "Item:Q5074328"
From MaRDI portal
The following pages link to Complexity analysis of primal-dual interior-point methods for linear optimization based on a new efficient Bi-parameterized kernel function with a trigonometric barrier term (Q5074328):
Displaying 8 items.
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term (Q306399) (← links)
- An efficient twice parameterized trigonometric kernel function for linear optimization (Q779775) (← links)
- Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term (Q1724788) (← links)
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function (Q2252687) (← links)
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term (Q2303523) (← links)
- Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term (Q2353462) (← links)
- Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function (Q3177630) (← links)
- Complexity analysis of primal-dual interior-point methods for convex quadratic programming based on a new twice parameterized kernel function (Q6662798) (← links)
