Login / Signup
An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞- neighbourhood of the central path.
Behrouz Kheirfam
Published in:
Int. J. Comput. Math. (2017)
Keyphrases
</>
linear complementarity problem
interior point algorithm
search space
interior point
linear programming
interior point methods
search algorithm
primal dual
sufficient conditions
convex optimization
probability distribution
linear programming problems