A wide neighborhood arc-search interior-point algorithm for convex quadratic programming
2017
In this paper, we propose an arc-search interior-point algorithm for convex quadratic programming with a wide neighborhood of the central path, which searches the optimizers along the ellipses that approximate the entire central path. The favorable polynomial complexity bound of the algorithm is obtained, namely O(nlog((x0)Ts0/e)) which is as good as the linear programming analogue. Finally, the numerical experiments show that the proposed algorithm is efficient.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
17
References
0
Citations
NaN
KQI