Mathematics of Computation, Vol. 69, No. 229 (Jan., 2000), pp. 283-304 (22 pages) Recently, based upon the Chen-Harker-Kanzow-Smale smoothing function and the trajectory and the neighbourhood ...
This is a preview. Log in through your library . Abstract We apply a potential reduction algorithm to solve the general linear complementarity problem (GLCP) minimize ...
Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...
The eigenvalue complementarity problem (EiCP) represents a class of mathematical challenges where the determination of eigenvalues and corresponding eigenvectors is constrained by complementarity ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback