A full Nesterov-Todd step primal-dual path-following interior-point algorithm for semidenite linear complementarity problems
In this paper, a feasible primal-dual path-following interior-point algorithm for monotone semidefinite linear complementarity problems is proposed. At each iteration, the algorithm uses only full Nesterov-Todd feasible steps for tracing approximately the central-path and getting an approximated sol...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Croatian Operational Research Society
2018-07-01
|
Series: | Croatian Operational Research Review |
Subjects: | |
Online Access: | https://hrcak.srce.hr/203892 |