Login / Signup
A New Type Algorithm for the Generalized Linear Complementarity Problem Over a Polyhedral Cone In Engineering and Equilibrium Modeling.
Hongchun Sun
Published in:
J. Softw. (2010)
Keyphrases
</>
learning algorithm
k means
computational complexity
convex hull
linear complementarity problem
np hard
dynamic programming
worst case
clustering method
simulated annealing
sufficient conditions
globally optimal
objective function
optimal solution