Pages that link to "Item:Q1730836"
From MaRDI portal
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):
Displayed 2 items.
- An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization (Q2218879) (← 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)