Pages that link to "Item:Q3505061"
From MaRDI portal
The following pages link to A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods (Q3505061):
Displaying 18 items.
- Large-update interior point algorithm for \(P_*\)-linear complementarity problem (Q257756) (← links)
- A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function (Q384190) (← links)
- Kernel function based interior-point methods for horizontal linear complementarity problems (Q394593) (← links)
- An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term (Q513522) (← links)
- A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods (Q631897) (← links)
- A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO (Q634734) (← links)
- An interior-point algorithm for linear optimization based on a new barrier function (Q720625) (← links)
- A new parameterized kernel function for LO yielding the best known iteration bound for a large-update interior point algorithm (Q1689710) (← 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)
- An efficient parameterized logarithmic kernel function for semidefinite optimization (Q2023749) (← links)
- Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone (Q2405683) (← links)
- Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions (Q2442632) (← links)
- A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION (Q2996870) (← links)
- Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function (Q3177630) (← 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)
- A Numerical Implementation of an Interior Point Methods for Linear Programming Based on a New Kernel Function (Q5356999) (← links)
- Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions (Q6125139) (← links)
- A polynomial interior-point algorithm with improved iteration bounds for linear optimization (Q6498419) (← links)
