A full-Newton step feasible interior-point algorithm for P*(k)-linear complementarity problems
In this paper, a full-Newton step feasible interior-point algorithm is proposed for solving P*(κ) -linear complementarity problems. We prove that the full-Newton step to the central path is local quadratically convergent and the proposed algorithm has polynomial iteration complexity, namely, O ((1+4...
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Published: |
Springer
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/5978 |