Pages that link to "Item:Q2266861"
From MaRDI portal
The following pages link to A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms (Q2266861):
Displaying 17 items.
- Global and local convergence of a new affine scaling trust region algorithm for linearly constrained optimization (Q335312) (← links)
- A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function (Q384190) (← links)
- A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem (Q606335) (← links)
- A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO (Q634734) (← links)
- New parameterized kernel functions for linear optimization (Q693134) (← links)
- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term (Q695048) (← links)
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions (Q1012072) (← links)
- A new parameterized kernel function for LO yielding the best known iteration bound for a large-update interior point algorithm (Q1689710) (← links)
- The accuracy of interior-point methods based on kernel functions (Q1935292) (← links)
- Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems (Q2115211) (← links)
- Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization (Q2340161) (← links)
- A primal-dual interior-point algorithm for symmetric optimization based on a new kernel function with trigonometric barrier term yielding the best known iteration bounds (Q2361520) (← links)
- Complexity analysis of interior point methods for linear programming based on a parameterized kernel function (Q2954362) (← links)
- Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions (Q5081279) (← links)
- (Q5085900) (← links)
- An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function (Q5089362) (← links)
- Interior-point methods for Cartesian<i>P</i><sub>*</sub>(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions (Q5200563) (← links)