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):
Displaying 11 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)
- Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization (Q995953) (← links)
- On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
- Self-regular functions and new search directions for linear and semidefinite optimization (Q1849264) (← links)
- Simplified infeasible interior-point algorithm for linear optimization based on a simple function (Q2294231) (← links)
- The complexity of self-regular proximity based infeasible IPMs (Q2506182) (← links)
- A dynamic large-update primal‐dual interior-point method for linear optimization (Q4405939) (← links)
- An adaptive self-regular proximity-based large-update IPM for LO (Q5312761) (← 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)
