Pages that link to "Item:Q2462141"
From MaRDI portal
The following pages link to New complexity analysis of IIPMs for linear optimization based on a specific self-regular function (Q2462141):
Displayed 5 items.
- Infeasible interior-point methods for linear optimization based on large neighborhood (Q306402) (← links)
- A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function (Q843962) (← links)
- Simplified infeasible interior-point algorithm for linear optimization based on a simple function (Q2294231) (← 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)
