default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas F. Coleman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j53]Haofan Zhang, Ke Nian, Thomas F. Coleman, Yuying Li
:
Spectral ranking and unsupervised feature selection for point, collective, and contextual anomaly detection. Int. J. Data Sci. Anal. 9(1): 57-75 (2020)
2010 – 2019
- 2018
- [j52]Aditya Tayal, Thomas F. Coleman, Yuying Li:
Bounding the difference between RankRC and RankSVM and application to multi-level rare class kernel ranking. Data Min. Knowl. Discov. 32(2): 417-452 (2018) - 2016
- [b2]Thomas F. Coleman, Wei Xu:
Automatic differentiation in MATLAB using ADMAT with applications. Software, environments, and tools, SIAM 2016, ISBN 978-1-611-97435-5, pp. 1-105 - [j51]Somayeh Moazeni, Thomas F. Coleman, Yuying Li:
Smoothing and parametric rules for stochastic mean-CVaR optimal execution strategy. Ann. Oper. Res. 237(1-2): 99-120 (2016) - 2015
- [j50]Aditya Tayal, Thomas F. Coleman, Yuying Li:
RankRC: Large-Scale Nonlinear Rare Class Ranking. IEEE Trans. Knowl. Data Eng. 27(12): 3347-3359 (2015) - 2014
- [j49]Wei Xu, Thomas F. Coleman:
Solving nonlinear equations with the Newton-Krylov method based on automatic differentiation. Optim. Methods Softw. 29(1): 88-101 (2014) - [j48]Aditya Tayal, Thomas F. Coleman, Yuying Li:
Primal explicit max margin feature selection for nonlinear support vector machines. Pattern Recognit. 47(6): 2153-2164 (2014) - 2013
- [j47]Somayeh Moazeni, Thomas F. Coleman, Yuying Li:
Regularized robust optimization: the optimal portfolio execution case. Comput. Optim. Appl. 55(2): 341-377 (2013) - [j46]Thomas F. Coleman, Yuying Li, Cheng Wang:
Stable local volatility function calibration using spline kernel. Comput. Optim. Appl. 55(3): 675-702 (2013) - [j45]Wei Xu, Thomas F. Coleman:
Efficient (Partial) Determination of Derivative Matrices via Automatic Differentiation. SIAM J. Sci. Comput. 35(3) (2013) - 2012
- [j44]Wei Xu, Thomas F. Coleman, Gang Liu:
A secant method for nonlinear least-squares minimization. Comput. Optim. Appl. 51(1): 159-173 (2012) - 2010
- [j43]Somayeh Moazeni, Thomas F. Coleman, Yuying Li:
Optimal Portfolio Execution Strategies and Sensitivity to Price Impact Parameters. SIAM J. Optim. 20(3): 1620-1654 (2010)
2000 – 2009
- 2009
- [j42]Dmitriy Levchenkov, Thomas F. Coleman, Yuying Li:
Estimating a Hedge Fund Return Model Based on a Small Number of Samples. INFOR Inf. Syst. Oper. Res. 47(1): 43-58 (2009) - 2008
- [j41]Thomas F. Coleman, Wei Xu:
Fast (Structured) Newton Computations. SIAM J. Sci. Comput. 31(2): 1175-1191 (2008) - 2007
- [c7]Thomas F. Coleman, Wei Xu:
Parallelism in Structured Newton Computations. PARCO 2007: 295-302 - 2005
- [c6]Shirish Chinchalkar, Thomas F. Coleman, Peter Mansfield:
Financial Computations on Clusters Using Web Services. International Conference on Computational Science (2) 2005: 76-83 - 2004
- [c5]Shirish Chinchalkar, Thomas F. Coleman, Peter Mansfield:
Cluster Computing for Financial Engineering. PARA 2004: 395-403 - 2003
- [c4]Katharyn A. Boyle, Thomas F. Coleman, Yuying Li:
Hedging a portfolio of derivatives by modeling cost. CIFEr 2003: 63-70 - 2002
- [j40]Thomas F. Coleman, Jianguo Liu, Wei Yuan:
A New Trust-Region Algorithm for Equality Constrained Optimization. Comput. Optim. Appl. 21(2): 177-199 (2002) - 2001
- [j39]Thomas F. Coleman, Yuying Li, Adrian Mariano:
Segmentation of Pulmonary Nodule Images Using 1-Norm Minimization. Comput. Optim. Appl. 19(3): 243-272 (2001) - [j38]Thomas F. Coleman, Arun Verma:
A Preconditioned Conjugate Gradient Approach to Linear Equality Constrained Minimization. Comput. Optim. Appl. 20(1): 61-72 (2001) - 2000
- [j37]Thomas F. Coleman, Jianguo Liu:
An Exterior Newton Method for Strictly Convex Quadratic Programming. Comput. Optim. Appl. 15(1): 5-32 (2000) - [j36]Thomas F. Coleman, Jianguo Liu, Wei Yuan:
A Quasi-Newton Quadratic Penalty Method for Minimization Subject to Nonlinear Equality Constraints. Comput. Optim. Appl. 15(2): 103-123 (2000) - [j35]Thomas F. Coleman, Yuying Li:
A trust region and affine scaling interior point method for nonconvex minimization with linear inequality constraints. Math. Program. 88(1): 1-31 (2000) - [j34]Thomas F. Coleman, Arun Verma:
ADMIT-1: automatic differentiation and MATLAB interface toolbox. ACM Trans. Math. Softw. 26(1): 150-175 (2000)
1990 – 1999
- 1999
- [j33]Thomas F. Coleman, Jianguo Liu:
An interior Newton method for quadratic programming. Math. Program. 85(3): 491-523 (1999) - [j32]Thomas F. Coleman, Gudbjorn F. Jonsson:
The Efficient Computation of Structured Gradients using Automatic Differentiation. SIAM J. Sci. Comput. 20(4): 1430-1437 (1999) - [j31]Mary Ann Branch, Thomas F. Coleman, Yuying Li:
A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems. SIAM J. Sci. Comput. 21(1): 1-23 (1999) - 1998
- [j30]Thomas F. Coleman, Arun Verma:
The Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation. SIAM J. Sci. Comput. 19(4): 1210-1233 (1998) - 1997
- [c3]Thomas F. Coleman, Joseph Czyzyk, Chunguang Sun, Michael Wagner, Stephen J. Wright:
pPCx: Parallel Software for Linear Programming. PP 1997 - 1996
- [j29]Thomas F. Coleman, Zhijun Wu:
Parallel continuation-based global optimization for molecular conformation and protein folding. J. Glob. Optim. 8(1): 49-65 (1996) - [j28]Thomas F. Coleman, Yuying Li:
An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds. SIAM J. Optim. 6(2): 418-445 (1996) - [j27]Thomas F. Coleman, Yuying Li:
A Reflective Newton Method for Minimizing a Quadratic Function Subject to Bounds on Some of the Variables. SIAM J. Optim. 6(4): 1040-1058 (1996) - 1995
- [j26]Thomas F. Coleman, Aiping Liao:
An efficient trust region method for unconstrained discrete-time optimal control problems. Comput. Optim. Appl. 4(1): 47-66 (1995) - [j25]Shirish Chinchalkar, Thomas F. Coleman:
Parallel structural optimization applied to bone remodeling on distributed memory machines. Comput. Optim. Appl. 4(4): 375-392 (1995) - 1994
- [j24]Thomas F. Coleman, David Shalloway, Zhijun Wu:
A parallel build-up algorithm for global energy minimizations of molecular clusters using effective energy simulated annealing. J. Glob. Optim. 4(2): 171-185 (1994) - [j23]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
- [j22]Thomas F. Coleman, David Shalloway, Zhijun Wu:
Isotropic effective energy simulated annealing searches for low energy molecular cluster states. Comput. Optim. Appl. 2(2): 145-170 (1993) - [j21]Thomas F. Coleman, Laurie A. Hulbert:
A Globally and Superlinearly Convergent Algorithm for Convex Quadratic Programs with Simple Bbounds. SIAM J. Optim. 3(2): 298-321 (1993) - [c2]Thomas F. Coleman, Chunguang Sun:
Parallel Orthogonal Factorizations of Large Sparse Matrices on Distributed -Memory Multiprocessors. PPSC 1993: 457-461 - 1992
- [j20]Thomas F. Coleman, Peter A. Fenyes:
Partitioned quasi-Newton methods for nonlinear equality constrained optimization. Math. Program. 53: 17-44 (1992) - [j19]Thomas F. Coleman, Yuying Li:
A globally and quadratically convergent affine scaling method for linear l1 problems. Math. Program. 56: 189-222 (1992) - [j18]Thomas F. Coleman, Paul E. Plassmann:
A Parallel Nonlinear Least-Squares Solver: Theoretical Analysis and Numerical Results. SIAM J. Sci. Comput. 13(3): 771-793 (1992) - 1990
- [j17]Thomas F. Coleman, Christian Hempel:
Computing a Trust Region Step for a Penalty Function. SIAM J. Sci. Comput. 11(1): 180-201 (1990) - [j16]Thomas F. Coleman, Guangye Li:
Solving Systems of Nonlinear Equations on a Message-Passing Multiprocessor. SIAM J. Sci. Comput. 11(6): 1116-1135 (1990)
1980 – 1989
- 1989
- [j15]Thomas F. Coleman, Laurie A. Hulbert:
A direct active set algorithm for large sparse quadratic programs with simple bounds. Math. Program. 45(1-3): 373-406 (1989) - [j14]Thomas F. Coleman, Earl Zmijewski:
Direct Methods for Sparse Matrices (I. S. Duff, A. M. Erisman, and J. K Reid). SIAM Rev. 31(3): 503-504 (1989) - 1988
- [j13]Thomas F. Coleman:
A chordal preconditioner for large-scale optimization. Math. Program. 40(1-3): 265-287 (1988) - [c1]Thomas F. Coleman, Paul E. Plassmann:
Solution of Nonlinear Least Squares Problems on a Multiprocessor. Shell Conference 1988: 44-60 - 1986
- [j12]Thomas F. Coleman, Anders Edenbrandt, John R. Gilbert:
Predicting fill for sparse orthogonal factorization. J. ACM 33(3): 517-532 (1986) - 1985
- [j11]Thomas F. Coleman, Burton S. Garbow, Jorge J. Moré:
Software for Estimating Sparse Hessian Matrices. ACM Trans. Math. Softw. 11(4): 363-377 (1985) - [j10]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
- [b1]Thomas F. Coleman:
Large Sparse Numerical Optimization. Lecture Notes in Computer Science 165, Springer 1984, ISBN 3-540-12914-6 - [j9]Thomas F. Coleman, Jorge J. Moré:
Estimation of sparse hessian matrices and graph coloring problems. Math. Program. 28(3): 243-270 (1984) - [j8]Thomas F. Coleman, Danny C. Sorensen:
A note on the computation of an orthonormal basis for the null space of a matrix. Math. Program. 29(2): 234-242 (1984) - [j7]Thomas F. Coleman, Burton S. Garbow, Jorge J. Moré:
Software for estimating sparse Jacobian matrices. ACM Trans. Math. Softw. 10(3): 329-345 (1984) - [j6]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) - 1982
- [j5]Thomas F. Coleman, Andrew R. Conn:
Nonlinear programming via an exact penalty function: Asymptotic analysis. Math. Program. 24(1): 123-136 (1982) - [j4]Thomas F. Coleman, Andrew R. Conn:
Nonlinear programming via an exact penalty function: Global analysis. Math. Program. 24(1): 137-161 (1982) - 1981
- [j3]Thomas F. Coleman, Andrew R. Conn:
Erratum. Math. Program. 21(1): 357 (1981) - 1980
- [j2]Thomas F. Coleman, Andrew R. Conn:
Second-order conditions for an exact penalty function. Math. Program. 19(1): 178-185 (1980)
1970 – 1979
- 1978
- [j1]Thomas F. Coleman:
A note on 'new algorithms for constrained minimax optimization'. Math. Program. 15(1): 239-242 (1978)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-04 21:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
