3221 search results - page 193 / 645 » Termination of Linear Programs |
165
click to vote
MP
2011
14 years 9 months ago
2011
Abstract. Using the least element solution of the P0 and Z matrix linear complementarity problem (LCP), we define an implicit solution function for linear complementarity constrai...
163
click to vote
PPOPP
2009
ACM
16 years 7 months ago
2009
ACM
In a previous paper we show how the FLAME methods and tools provide a solution to compute dense dense linear algebra operations on a multi-GPU platform with reasonable performance...
154
click to vote
ECOOPW
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We present a uni ed approach for expressing high performance numerical linear algebra routines for a class of dense and sparse matrix formats and shapes. As with the Stan...
144
click to vote
AISC
2006
Springer
15 years 10 months ago
2006
Springer
In program analysis and verification, there are some constraints that have to be processed repeatedly. A possible way to speed up the processing is to find some relations among the...
201
click to vote
IPCO
2008
15 years 7 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...