PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Coleman, Thomas F."

Author of the publication

copydeleteadd this publication to your clipboard
A Reflective Newton Method for Minimizing a Quadratic Function Subject to Bounds on Some of the Variables.

, and . SIAM Journal on Optimization, 6 (4): 1040-1058 (1996)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

F. Dörr

F. Laufer

F. Rusitschka

F. Perni

F. D{\"o}rr

 

Other publications of authors with the same name

A parallel build-up algorithm for global energy minimizations of molecular clusters using effective energy simulated annealing., , and . J. Global Optimization, 4 (2): 171-185 (1994)Software for Estimating Sparse Hessian Matrices., , and . ACM Trans. Math. Softw., 11 (4): 363-377 (1985)Algorithm 636: FORTRAN Subroutines for Estimating Sparse Hessian Matrices., , and . ACM Trans. Math. Softw., 11 (4): 378 (1985)An interior Newton method for quadratic programming., and . Math. Program., 85 (3): 491-523 (1999)Partitioned quasi-Newton methods for nonlinear equality constrained optimization., and . Math. Program., (1992)A note on the computation of an orthonormal basis for the null space of a matrix., and . Math. Program., 29 (2): 234-242 (1984)Solving nonlinear equations with the Newton-Krylov method based on automatic differentiation., and . Optimization Methods and Software, 29 (1): 88-101 (2014)The Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation., and . SIAM J. Scientific Computing, 19 (4): 1210-1233 (1998)Fast (Structured) Newton Computations., and . SIAM J. Scientific Computing, 31 (2): 1175-1191 (2008)The Efficient Computation of Structured Gradients using Automatic Differentiation., and . SIAM J. Scientific Computing, 20 (4): 1430-1437 (1999)