Pages that link to "Item:Q1572670"
From MaRDI portal
The following pages link to Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions (Q1572670):
Displaying 6 items.
- A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem (Q331977) (← links)
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones (Q650213) (← links)
- Discretization method for semi-definite programming (Q1770709) (← links)
- On long-step predictor-corrector interior-point algorithm for semidefinite programming with Monteiro-Zhang unified search directions (Q4504776) (← links)
- A long-step interior-point algorithm for symmetric cone Cartesian <i>P</i><sub>*</sub>(κ)-HLCP (Q4646542) (← 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)
