Pages that link to "Item:Q1861321"
From MaRDI portal
The following pages link to Global convergence enhancement of classical linesearch interior point methods for MCPs (Q1861321):
Displaying 3 items.
- A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods (Q631897) (← links)
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem (Q732130) (← links)
- Infeasible interior-point algorithms based on sampling average approximations for a class of stochastic complementarity problems and their applications (Q1736388) (← links)
