Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
From MaRDI portal
Publication:979273
DOI10.1016/j.amc.2010.03.015zbMath1191.65068MaRDI QIDQ979273
Publication date: 25 June 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2010.03.015
linear complementarity problems; interior point methods; polynomial complexity; primal-dual algorithms; numerical implementation
65K05: Numerical mathematical programming methods
Related Items
Cites Work
- A new primal-dual path-following method for convex quadratic programming
- A numerical study of an infeasible primal-dual path-following algorithm for linear programming
- A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
- A polynomial predictor-corrector interior-point algorithm for convex quadratic programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item