| 2010 | ||
|---|---|---|
| 18 | Somayeh Moazeni, Thomas F. Coleman, Yuying Li: Optimal Portfolio Execution Strategies and Sensitivity to Price Impact Parameters. SIAM Journal on Optimization 20(3): 1620-1654 (2010) | |
| 2008 | ||
| 17 | Thomas F. Coleman, Wei Xu: Fast (Structured) Newton Computations. SIAM J. Scientific Computing 31(2): 1175-1191 (2008) | |
| 2007 | ||
| 16 | Thomas F. Coleman, Wei Xu: Parallelism in Structured Newton Computations. PARCO 2007: 295-302 | |
| 2005 | ||
| 15 | Shirish Chinchalkar, Thomas F. Coleman, Peter Mansfield: Financial Computations on Clusters Using Web Services. International Conference on Computational Science (2) 2005: 76-83 | |
| 2004 | ||
| 14 | Shirish Chinchalkar, Thomas F. Coleman, Peter Mansfield: Cluster Computing for Financial Engineering. PARA 2004: 395-403 | |
| 2000 | ||
| 13 | Thomas F. Coleman, Arun Verma: ADMIT-1: automatic differentiation and MATLAB interface toolbox. ACM Trans. Math. Softw. 26(1): 150-175 (2000) | |
| 1997 | ||
| 12 | Thomas F. Coleman, Joseph Czyzyk, Chunguang Sun, Michael Wagner, Stephen J. Wright: pPCx: Parallel Software for Linear Programming. PPSC 1997 | |
| 1994 | ||
| 11 | Thomas F. Coleman, Yuying Li: On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds. Math. Program. 67: 189-224 (1994) | |
| 1993 | ||
| 10 | Thomas F. Coleman, Chunguang Sun: Parallel Orthogonal Factorizations of Large Sparse Matrices on Distributed -Memory Multiprocessors. PPSC 1993: 457-461 | |
| 1992 | ||
| 9 | Thomas F. Coleman, Peter A. Fenyes: Partitioned quasi-Newton methods for nonlinear equality constrained optimization. Math. Program. 53: 17-44 (1992) | |
| 8 | Thomas F. Coleman, Yuying Li: A globally and quadratically convergent affine scaling method for linear l1 problems. Math. Program. 56: 189-222 (1992) | |
| 1988 | ||
| 7 | Thomas F. Coleman, Paul E. Plassman: Solution of Nonlinear Least Squares Problems on a Multiprocessor. Shell Conference 1988: 44-60 | |
| 1986 | ||
| 6 | Thomas F. Coleman, Anders Edenbrandt, John R. Gilbert: Predicting fill for sparse orthogonal factorization. J. ACM 33(3): 517-532 (1986) | |
| 1985 | ||
| 5 | Thomas F. Coleman, Burton S. Garbow, Jorge J. Moré: Software for Estimating Sparse Hessian Matrices. ACM Trans. Math. Softw. 11(4): 363-377 (1985) | |
| 4 | Thomas F. Coleman, Burton S. Garbow, Jorge J. Moré: Algorithm 636: FORTRAN Subroutines for Estimating Sparse Hessian Matrices. ACM Trans. Math. Softw. 11(4): 378 (1985) | |
| 1984 | ||
| 3 | Thomas F. Coleman: Large Sparse Numerical Optimization Springer 1984 | |
| 2 | Thomas F. Coleman, Burton S. Garbow, Jorge J. Moré: Software for estimating sparse Jacobian matrices. ACM Trans. Math. Softw. 10(3): 329-345 (1984) | |
| 1 | Thomas F. Coleman, Burton S. Garbow, Jorge J. Moré: Algorithm 618: FORTRAN subroutines for estimating sparse Jacobian Matrices. ACM Trans. Math. Softw. 10(3): 346-347 (1984) | |
| 1 | Shirish Chinchalkar | [14] [15] |
| 2 | Joseph Czyzyk | [12] |
| 3 | Anders Edenbrandt | [6] |
| 4 | Peter A. Fenyes | [9] |
| 5 | Burton S. Garbow | [1] [2] [4] [5] |
| 6 | John R. Gilbert | [6] |
| 7 | Yuying Li | [8] [11] [18] |
| 8 | Peter Mansfield | [14] [15] |
| 9 | Somayeh Moazeni | [18] |
| 10 | Jorge J. Moré | [1] [2] [4] [5] |
| 11 | Paul E. Plassman | [7] |
| 12 | Chunguang Sun | [10] [12] |
| 13 | Arun Verma | [13] |
| 14 | Michael Wagner | [12] |
| 15 | Stephen J. Wright | [12] |
| 16 | Wei Xu | [16] [17] |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page