10 search results - page 2 / 2 » Conjugate gradient sparse solvers: performance-power charact... |
SIAMJO
2010
14 years 6 months ago
2010
We propose a Newton-CG primal proximal point algorithm for solving large scale log-determinant optimization problems. Our algorithm employs the essential ideas of the proximal poi...
120
click to vote
SC
2009
ACM
15 years 4 months ago
2009
ACM
It has been shown that the sparse grid combination technique can be a practical tool to solve high dimensional PDEs arising in multidimensional option pricing problems in finance...
118
click to vote
ICCV
2011
IEEE
13 years 11 months ago
2011
IEEE
We present a generalized subgraph preconditioning (GSP) technique to solve large-scale bundle adjustment problems efficiently. In contrast with previous work which uses either di...
SC
1992
ACM
15 years 3 months ago
1992
ACM
In this paper, we study the communication characteristics of the CM-5 and the performance e ects of scheduling regular and irregular communication patterns on the CM-5. We conside...
SIAMJO
2000
14 years 11 months ago
2000
Abstract. Despite the efficiency shown by interior-point methods in large-scale linear programming, they usually perform poorly when applied to multicommodity flow problems. The ne...