Pages that link to "Item:Q843962"
From MaRDI portal
The following pages link to A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function (Q843962):
Displaying 11 items.
- A full-Newton step infeasible interior-point algorithm for \(P_\ast (\kappa)\) linear complementarity problem (Q890633) (← links)
- Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function (Q1733331) (← links)
- A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps (Q2192573) (← links)
- A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function (Q2810097) (← links)
- A MODIFIED FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR LINEAR OPTIMIZATION (Q2873836) (← links)
- A new infeasible interior-point algorithm with full step for linear optimization based on a simple function (Q2885543) (← links)
- Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function (Q3177630) (← links)
- An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step (Q4635027) (← links)
- A FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT METHOD FOR LINEAR OPTIMIZATION BASED ON AN EXPONENTIAL KERNEL FUNCTION (Q5417513) (← links)
- A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term (Q6046863) (← links)
- A new search direction for full-Newton step infeasible interior-point method in linear optimization (Q6202360) (← links)