Pages that link to "Item:Q2018886"
From MaRDI portal
The following pages link to Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term (Q2018886):
Displaying 9 items.
- An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term (Q513522) (← links)
- An interior-point algorithm for semidefinite least-squares problems. (Q2148405) (← links)
- A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems (Q2311198) (← 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)
- A Complexity Analysis for Interior-Point Algorithms Based on Karmarkar’s Potential Function (Q4308551) (← links)
- Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization (Q5320239) (← 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)
