Pages that link to "Item:Q1730836"

The following pages link to Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term (Q1730836):

Displaying 6 items.

• An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization (Q2218879) (← links)
• An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function (Q2346488) (← links)
• Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term (Q6107947) (← 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)
• Dislocation hyperbolic kernel function (Q6620698) (← links)
• An efficient hyperbolic kernel function yielding the best known iteration bounds for linear programming (Q6661713) (← links)