University of Oxford Branding

OUCL

news

research

teaching

people

calendar

resources

login

OXFORD UNIVERSITY  COMPUTING LABORATORY

Nick Gould - Publications

Books:

  1. A. R. Conn, N. I. M. Gould and Ph. L. Toint, ``LANCELOT: a Fortran package for large-scale nonlinear optimization, release A'', Series in Computational Mathematics 17, Springer-Verlag, Berlin (1992), ISBN 3-540-55470-X.

  2. A. R. Conn, N. I. M. Gould and Ph. L. Toint, ``Trust-region methods'', SIAM/MPS Series on Optimization, SIAM, Philadelphia (2000), ISBN 0-89871-460-5.

Edited collections:

  1. A. R. Conn, N. I. M. Gould and Ph. L. Toint, ``Large-Scale Optimization'' Mathematical Programming B 45:3 (1989).

  2. A. R. Conn, N. I. M. Gould and Ph. L. Toint, ``Large-Scale Optimization--Applications'' Mathematical Programming B 48:1 (1990).

  3. I. S. Duff, N. I. M. Gould, C. C. Douglas and L. Giraud, ``Direct methods, linear algebra in optimization, and iterative methods: Proceedings from the International Linear Algebra Year workshops, September 1995-June 1996'' BIT 37:3 (1997).

  4. N. I. M. Gould, S. Leyffer and Ph. L. Toint, ``Nonlinear programming: theory and practice'' Mathematical Programming B 100:1 (2004).

Refereed articles:

  1. P. E. Gill, N. I. M. Gould, W. Murray, M. A. Saunders and M. H. Wright, ``A Weighted Gram-Schmidt method for convex quadratic programming'', Mathematical Programming 30 (1984) 176-196.

  2. A. R. Conn and N. I. M. Gould, ``On the location of directions of infinite descent for nonlinear programming algorithms'', SIAM Journal on Numerical Analysis 21 (1984) 1162-1179.

  3. N. I. M. Gould, ``On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem'', Mathematical Programming 32 (1985) 90-99.

  4. R. J. Caron and N. I. M. Gould, ``Finding a positive semi-definite interval for a parametric matrix'', Linear Algebra and its Applications 76 (1986) 19-29.

  5. N. I. M. Gould, ``On the accurate determination of search directions for simple differentiable penalty functions'', IMA Journal of Numerical Analysis 6 (1986) 357-372.

  6. A. R. Conn and N. I. M. Gould, ``An exact penalty function for semi-infinite programming'', Mathematical Programming 37 (1987) 19-40.

  7. A. R. Conn, N. I. M. Gould and Ph. L. Toint, ``Global convergence of a class of trust region algorithms for optimization with simple bounds'', SIAM Journal on Numerical Analysis 25 (1988) 433-460 and 26 (1989) 764-767.

  8. A. R. Conn, N. I. M. Gould and Ph. L. Toint, ``Testing a class of methods for solving minimization problems with simple bounds on the variables'', Mathematics of Computation 50 (1988) 399-430.

  9. N. I. M. Gould, ``On solving three classes of nonlinear programming problems via simple differentiable penalty functions'', Journal of Optimization Theory and Applications 56 (1988) 89-126.

  10. N. I. M. Gould, ``On the convergence of a sequential penalty function method for constrained minimization'', SIAM Journal on Numerical Analysis 26 (1989) 107-128.

  11. N. I. M. Gould and J. K. Reid, ``New crash procedures for large systems of linear constraints'', Mathematical Programming 45 (1989) 475-501.

  12. I. S. Duff, N. I. M. Gould, M. Lescrenier and J. K. Reid, ``The multifrontal method in a Parallel Environment'', in Reliable Numerical Computation (M. G. Cox and S. Hammarling, eds.) Oxford University Press, (1990) 93-111.

  13. M. Arioli, I. S. Duff, N. I. M. Gould and J. K. Reid, ``The practical use of the Hellerman-Rarick P4 and P5 variant of Erisman et al.'', SIAM Journal on Scientific and Statistical Computing 11 (1990) 913-927.

  14. A. R. Conn, N. I. M. Gould and Ph. L. Toint, ``A introduction to the structure of large scale nonlinear optimization problems and the LANCELOT project'', in Computing Methods in Applied Sciences and Engineering (R. Glowinski and A. Lichnewsky, eds.), SIAM Proceedings in Applied Mathematics 45 (1990) 42-54.

  15. N. I. M. Gould, ``On growth in Gaussian elimination with complete pivoting'', SIAM Journal on Matrix Analysis and Applications 12 (1991) 351-364.

  16. I. S. Duff, N. I. M. Gould, J. K. Reid, J. A. Scott and K. Turner, ``The factorization of sparse symmetric indefinite matrices'', IMA Journal of Numerical Analysis 11 (1991) 181-204.

  17. A. R. Conn, N. I. M. Gould and Ph. L. Toint, ``A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds'', SIAM Journal on Numerical Analysis 28 (1991) 545-572.

  18. A. R. Conn, N. I. M. Gould and Ph. L. Toint, ``Convergence of Quasi-Newton matrices generated by the symmetric rank-one update'', Mathematical Programming 50 (1991) 177-195.

  19. N. I. M. Gould, ``An algorithm for large-scale quadratic programming'', IMA Journal of Numerical Analysis 11 (1991) 299-324.

  20. A. R. Conn, N. I. M. Gould and Ph. L. Toint, ``On the number of inner iterations per outer iteration of a globally convergent algorithm for optimization with general nonlinear equality constraints and simple bounds'', in Numerical Analysis 1991, Proceedings of the 14th Biennial Conference (D. Griffiths and G. Watson, eds.), Pitman Research Notes in Mathematics 260 (1992) 49-68.

  21. A. R. Conn, N. I. M. Gould and Ph. L. Toint, ``Large-scale nonlinearly constrained optimization'', in ICIAM 1991, Proceedings of the 2nd International Conference on Industrial and Applied Mathematics (R. O'Malley, ed.), SIAM, Philadelphia (1992) 51-70.

  22. A. R. Conn, N. I. M. Gould, A. Sartenaer and Ph. L. Toint, ``Global convergence of a class of trust region algorithms for optimization using inexact projections on convex constraints'', SIAM Journal on Optimization 3 (1993) 164-221.

  23. A. R. Conn, N. I. M. Gould, M. Lescrenier and Ph. L. Toint, ``Performance of a multifrontal scheme for partially separable optimization'', in Advances in numerical partial differential equations and optimization, Proceedings of the sixth Mexico-United States Workshop (S. Gomez and J.P. Hennart and R.A. Tapia, eds.) Kluwer Academic Publishers (1994) 79-96.

  24. A. R. Conn, N. I. M. Gould and Ph. L. Toint, ``Improving the decomposition of partially separable functions in the context of large-scale optimization: a first approach'', in Large Scale Optimization: State of the Art (W. W. Hager, D. W. Hearn and P.M. Pardalos, eds.) Kluwer Academic Publishers B.V (1994) 82-94.

  25. A. R. Conn, N. I. M. Gould and Ph. L. Toint, ``Large-scale nonlinear constrained optimization: a current survey'', in E. Spedicato, editor, Algorithms for continuous optimization: the state of the art. Kluwer Academic Publishers, Dordrecht, The Netherlands, (1994) 287-332.

  26. A. R. Conn, N. I. M. Gould and Ph. L. Toint, ``A note on using alternative second-order models for the subproblems arising in barrier function methods for minimization'', Numerische Mathematik 68 (1994) 17-33.

  27. A. R. Conn, N. I. M. Gould and Ph. L. Toint, ``A note on exploiting structure when using slack variables'', Mathematical Programming 67 (1994) 89-98.

  28. I. Bongartz, A. R. Conn, N. I. M. Gould and Ph. L. Toint, ``CUTE: Constrained and Unconstrained Testing Environment'', ACM Transactions on Mathematical Software 21 (1995) 123-160.

  29. M. J. Daydé, J.-Y. L'Excellent and N. I. M. Gould, ``Solution of structured systems of linear equations using element-by-element preconditioners'', in ``Iterative methods in linear algebra, II'' (S. D. Margenov and P. S. Vassilevski, eds.) Volume 3 in the IMACS Series in Computational and Applied Mathematics (1995).

  30. A. R. Conn, N. I. M. Gould, A. Sartenaer and Ph. L. Toint, ``On Iterated-Subspace Minimization Methods for Nonlinear Optimization'', in ``Proceedings on Linear and Nonlinear Conjugate Gradient-Related Methods'' (L. Adams and L. Nazareth, eds.), SIAM, Philadelphia (1996) 50-78.

  31. M. J. Daydé, J.-Y. L'Excellent and N. I. M. Gould, ``Preprocessing of sparse unassembled linear systems for efficient solution using element-by-element preconditioners'', in ``Proceedings of Euro-Par 96, Lyons'' (A. M. L. Bourgé, P. Fragniaud and Y. Roberts, eds.) Lecture Notes in Computer Science 1124 Springer-Verlag, Berlin (1996) 34-43.

  32. A. R. Conn, N. I. M. Gould and Ph. L. Toint, ``Numerical experiments with the LANCELOT package (Release A) for large-scale nonlinear optimization'', Mathematical Programming 73 (1996) 73-110.

  33. A. R. Conn, N. I. M. Gould, A. Sartenaer and Ph. L. Toint, ``Convergence properties of an augmented Lagrangian algorithm for optimization with a combination of general equality and linear constraints'' SIAM Journal on Optimization 6 (1996) 674-703.

  34. A. R. Conn, N. I. M. Gould, A. Sartenaer and Ph. L. Toint, ``Convergence properties of minimization algorithms for convex constraints using a structured trust region'', SIAM Journal on Optimization 6 (1996) 1059-1086.

  35. A. R. Conn, N. I. M. Gould and Ph. L. Toint, ``A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds'', Mathematics of Computation 66 (1997) 261-288 and S1-S11.

  36. A. R. Conn, N. I. M. Gould and Ph. L. Toint, ``On the number of inner iterations per outer iteration of a globally convergent algorithm for optimization with general nonlinear inequality constraints and simple bounds'', Computational Optimization and Applications 7 (1997) 41-69.

  37. A. R. Conn, N. I. M. Gould and Ph. L. Toint, ``Methods for nonlinear constraints in optimization calculations'', in ``The state of the Art in Numerical Analysis'' (I. S. Duff and A. Watson, eds.), Oxford University Press (1997) 363-390.

  38. M. J. Daydé, J.-Y. L'Excellent and N. I. M. Gould, ``Element-by-element preconditioners for large partially separable optimization problems'', SIAM Journal on Scientific and Statistical Computing 18 (1997) 1767-1787.

  39. M. J. Daydé, J. P. Décamps, J.-Y. L'Excellent and N. I. M. Gould, ``Solution of large scale partially separable unconstrained optimization problems using element-by-element preconditioners'', in ``Proceedings of NAFEMS World Congress 97'', Glasgow, Scotland, Vol. 2 (1997) 942-953.

  40. N. I. M. Gould and J. A. Scott, ``Sparse approximate-inverse preconditioners using norm-minimization techniques'', SIAM Journal on Scientific and Statistical Computing 19 (1998) 605-625.

  41. N. I. M. Gould, S. Lucidi, M. Roma and Ph. L. Toint, ``A linesearch algorithm with memory for unconstrained optimization''. in ``High Performance Algorithms and Software in Nonlinear Optimization'' (R. De Leone, A. Murli, P. M. Pardalos and G. Toraldo, eds.), Kluwer Academic Publishers (1998) 207-223.

  42. N. I. M. Gould and J. Nocedal, ``The modified absolute-value factorization norm for trust-region minimization'', in ``High Performance Algorithms and Software in Nonlinear Optimization'' (R. De Leone, A. Murli, P. M. Pardalos and G. Toraldo, eds.), Kluwer Academic Publishers (1998) 225-241.

  43. M. J. Daydé, J. P. Décamps and N. I. M. Gould, ``On the Use of Block Stretching for Solving Unassembled Linear Systems'', Calculateurs Paralléles, Réseaux et Systémes Répartis, 10 (4) (1998) 391-399.

  44. N. I. M. Gould, ``On modified factorizations for large-scale linearly-constrained optimization''. SIAM Journal on Optimization 9 (1999) 1041-1063.

  45. N. I. M. Gould, S. Lucidi, M. Roma and Ph. L. Toint, ``Solving the trust-region subproblem using the Lanczos method'', SIAM Journal on Optimization 9 (1999) 504-525.

  46. N. I. M. Gould and Ph. L. Toint, ``A note on the convergence of barrier algorithms to second-order necessary points'', Mathematical Programming 85 (1999) 433-438.

  47. M. J. Daydé, J. P. Décamps and N. I. M. Gould, ``Subspace-by-Subspace preconditioners for structured linear systems''. Numerical Linear Algebra 6 (1999) 213-234.

  48. A. R. Conn, N. I. M. Gould and Ph. L. Toint, ``A primal-dual algorithm for minimizing a nonconvex function subject to bound and linear equality constraints'', in ``Nonlinear Optimization and Related Topics'', (G. Di Pillo and F. Giannnessi, eds) Kluwer Academic Publishers (1999) 15-50.

  49. N. I. M. Gould ``Iterative methods for ill-conditioned linear systems from optimization'', in ``Nonlinear Optimization and Related Topics'', (G. Di Pillo and F. Giannnessi, eds) Kluwer Academic Publishers (1999) 123-142.

  50. A. R. Conn, N. I. M. Gould, D. Orban and Ph. L. Toint, ``A primal-dual trust-region algorithm for non-convex nonlinear optimization''. Mathematical Programming 87 (2000) 215-249.

  51. C. Keller, N. I. M. Gould and A. J. Wathen, ``Constraint preconditioning for indefinite linear systems'', SIAM Journal on Matrix Analysis and Applications 21 (2000) 1300-1317.

  52. N. I. M. Gould and Ph. L. Toint, ``SQP methods for large-scale nonlinear programming''. in ``System Modelling and Optimization, Methods, Theory and Applications'' (M. J. D. Powell and S. Scholtes, eds) Kluwer Academic Publishers (2000) 149-178.

  53. N. I. M. Gould, S. Lucidi, M. Roma and Ph. L. Toint, ``Exploiting Negative Curvature Directions in Linesearch Methods for Unconstrained Optimization'', Optimization Methods and Software 14 1-2 (2000) 75-98.

  54. N. I. M. Gould, D. Orban, A. Sartenaer and Ph. L. Toint, ``Superlinear convergence of primal-dual interior point algorithms for nonlinear programming''. SIAM Journal on Optimization 11 (2001) 974-1002.

  55. N. I. M. Gould, M. E. Hribar and J. Nocedal, ``On the solution of equality constrained quadratic programming problems arising in optimization'', SIAM Journal on Scientific Computing 23 (4) (2001) 1375-1394.

  56. N. I. M. Gould, D. Orban, A. Sartenaer and Ph. L. Toint, ``Componentwise fast convergence in the solution of full-rank systems of nonlinear equations''. Mathematical Programming B 92 (2002) 481-508.

  57. N. I. M. Gould and Ph. L. Toint, ``An iterative working-set method for large-scale non-convex quadratic programming". Applied Numerical Mathematics 43 (1-2) (2002) 109-128.

  58. R. Fletcher, N. I. M. Gould, S. Leyffer, Ph. L. Toint and A. Wächter, ``Global convergence of trust-region SQP-filter algorithms for general nonlinear programming'', SIAM Journal on Optimization 13 (2002) 635-659.

  59. N. I. M. Gould and Ph. L. Toint, ``Numerical methods for large-scale non-convex quadratic programming'', in ``Trends in Industrial and Applied Mathematics", (A. H. Siddiqi and M. Kocvara, eds) Kluwer Academic Publishers (2002) 149-179.

  60. N. I. M. Gould and S. Leyffer, ``An introduction to algorithms for nonlinear optimization''. in ``Frontiers in Numerical Analyis (Durham 2002)'', (J. F. Blowey, A. W. Craig and T. Shardlow, eds) Springer Verlag (2003) 109-197.

  61. N. I. M. Gould, ``Some Reflections on the Current State of Active-Set and Interior-Point Methods for Constrained Optimization'' SIAG/Optimization Views-and-News 14 (1) (2003) 2-7.

  62. N. I. M. Gould and Ph. L. Toint, ``Global convergence of a hybrid trust-region SQP-Filter algorithm for general nonlinear programming'', in ``System Modelling and Optimization XX'' (E. W. Sachs and R. Tichatschke, eds) Kluwer Academic Publishers (2003) 23-54.

  63. N. I. M. Gould, D. Orban and Ph. L. Toint, ``GALAHAD--a library of thread-safe fortran 90 packages for large-scale nonlinear optimization''. ACM Transactions on Mathematical Software 29(4) (2003) 353-372.

  64. N. I. M. Gould, D. Orban and Ph. L. Toint, ``CUTEr (and SifDec), a Constrained and Unconstrained Testing Environment, revisited'', ACM Transactions on Mathematical Software 29(4) (2003) 373-394.

  65. N. I. M. Gould and Ph. L. Toint. ``The filter idea and its application to the nonlinear feasibility problem''. In ``Proceedings 20th Biennial Conference on Numerical Analysis'' (D. Griffiths and A. Watson, eds), University of Dundee, Scotland (2003), 73-79.

  66. R. H. Byrd, N. I. M. Gould, J. Nocedal and R. A. Waltz ``An active set algorithm for nonlinear programming using linear programming and equality constrained subproblems''. Mathematical Programming B 100:1 (2004) 27-48.

  67. N. I. M. Gould and Ph. L. Toint, ``Preprocessing for quadratic programming'', Mathematical Programming B 100:1 (2004) 95-132.

  68. N. I. M. Gould and J. A. Scott ``A numerical evaluation of HSL packages for the direct-solution of large sparse, symmetric linear systems of equations''. ACM Transactions on Mathematical Software 30(3) (2004) 300-325.

  69. N. I. M. Gould and Ph. L. Toint, ``How mature is nonlinear optimization?'', in Applied mathematics entering the 21st century: invited talks from the ICIAM 2003 Congress (J. M. Hill and R. Moore, eds.), SIAM, Philadelphia (2004) 141-161.

  70. N. I. M. Gould, S. Leyffer and Ph. L. Toint, ``A multidimensional filter algorithm for nonlinear equations and nonlinear least-squares''. SIAM Journal on Optimization 15 (1) (2005) 17-38.

  71. N. I. M. Gould, D. Orban and Ph. L. Toint, ``Numerical methods for large-scale nonlinear optimization'' Acta Numerica 14 (2005) 299-361.

  72. J. A. Scott, Y. Hu and N. I. M. Gould, ``An evaluation of sparse direct symmetric solvers: an introduction and preliminary findings'', in ``PARA'04 Workshop on state-of-the-art in scientific computation'' (J. Dongarra, K. Madsen and J. Wasniewski, eds.) Springer LNCS proceedings, (2005) 818-827.

  73. N. I. M. Gould, D. Orban, A. Sartenaer and Ph. L. Toint, ``Sensitivity of trust-region algorithms to their parameters''. 4OR, 3 (1) (2005) 227-241.

  74. N. I. M. Gould, C. Sainvitu and Ph. L. Toint, ``A filter-trust-region method for unconstrained optimization'' SIAM Journal on Optimization 16 (2) (2006) 341-357.

  75. R. H. Byrd, N. I. M. Gould, J. Nocedal and R. A. Waltz, ``On the convergence of successive linear-quadratic programming algorithms''. SIAM Journal on Optimization 16 (2) (2006) 471-489.

  76. N. I. M. Gould and Ph. L. Toint, ``Global Convergence of a Non-monotone Trust-Region SQP-Filter Algorithm for Nonlinear Programming''. in ``Multiscale Optimization Methods and Applications'' (W. W. Hager, S.-J. Huang, P. M. Pardalos and O. A. Prokopyev, eds.) Springer Series on Nonconvex Optimization and Its Applications, Vol. 82, Springer Verlag (2006) 125-150.

  77. H. S. Dollar, N. I. M. Gould and A. J. Wathen, ``On implicit-factorization constraint preconditioners''. in Large Scale Nonlinear Optimization (G. Di Pillo and M. Roma, eds.) Springer Series on Nonconvex Optimization and Its Applications, Vol. 83, Springer Verlag (2006) 61-82.

  78. H. S. Dollar, N. I. M. Gould, W. H. A. Schilders and A. J. Wathen, ``Implicit-factorization preconditioning and iterative solvers for regularized saddle-point systems''. SIAM Journal on Matrix Analysis and Applications 28 (2006) 170-189.

  79. N. I. M. Gould and Ph. L. Toint, ``FILTRANE, a fortran 95 filter-trust-region package for solving nonlinear feasibility problems''. Technical Report RAL-TR-2003-017 (2003), Rutherford Appleton Laboratory, Chilton, England. To appear ACM Transactions on Mathematical Software.

  80. N. I. M. Gould, Y. Hu and J. A. Scott, ``A numerical evaluation of sparse direct solvers for the solution of large, sparse, symmetric linear systems of equations''. Technical Report RAL-TR-2005-005 (2005), Rutherford Appleton Laboratory, Chilton, England. To appear ACM Transactions on Mathematical Software.

  81. H. S. Dollar, N. I. M. Gould, W. H. A. Schilders and A. J. Wathen, ``Using constraint preconditioners with regularized saddle-point problems''. Technical Report RAL-TR-2005-026 (2005), Rutherford Appleton Laboratory, Chilton, England. To appear Computational Optimization and Applications.

Technical reports:

  1. P. E. Gill, N. I. M. Gould, W. Murray and S. M. Picken, NPL algorithms library reports E/4/11, E/4/12, E/4/17, E/4/18, E/4/23, E/4/24, E/4/25, E/4/57 and E/4/58, National Physical Laboratory, England (1977).

  2. N. I. M. Gould and W. Murray, `` The numerical solution of a problem arising from the accurate determination of an earthquake epicenter occurring in a seismic net'', Stanford University/U.S. Geological Survey (1981).

  3. P. E. Gill, N. I. M. Gould, W. Murray, M. A. Saunders and M. H. Wright, ``A range-space quadratic programming algorithm for problems with a mixture of bounds and general constraints'', Technical report SOL 82-10 (1982) Department of Operations Research, Stanford University, California, U.S.A.

  4. P. E. Gill, N. I. M. Gould, W. Murray, M. A. Saunders and M. H. Wright, ``Range-space methods for convex quadratic programming problems'', Technical report SOL 82-9 (1982) Department of Operations Research, Stanford University, California, U.S.A.

  5. N. I. M. Gould, ``The generalized steepest-edge for linear programming'', report CORR 83-2, Department of Combinatorics and Optimization, University of Waterloo, Canada (1983)

  6. N. I. M. Gould, ``The generalized steepest-edge for linear programming: part 2, practicalities'', report CORR 84-1, Department of Combinatorics and Optimization, University of Waterloo, Canada (1984)

  7. N. I. M. Gould, ``The stability of the solution of general quadratic programs'', report CORR 83-11, Department of Combinatorics and Optimization, University of Waterloo, Canada (1983)

  8. A. R. Conn, N. I. M. Gould and Ph. L. Toint, ``A proposal for a standard data input format for large-scale nonlinear programming problems'', University of Waterloo report CSS-89-61 (1989) Ontario, Canada.

  9. A. R. Conn, N. I. M. Gould and Ph. L. Toint, ``An introduction to the standard data input format (SDIF) for nonlinear mathematical programming problems'', Technical Report 91/8 (1991), Dept. of Mathematics, FUNDP, Namur, Belgium.

  10. A. R. Conn, N. I. M. Gould and Ph. L. Toint, ``A comprehensive description of LANCELOT'', Technical Report 91/10 (1991), Dept. of Mathematics, FUNDP, Namur, Belgium,

  11. A. R. Conn, N. I. M. Gould and Ph. L. Toint, ``Intensive numerical tests with LANCELOT (Release A): the complete results'' Technical Report 92/15 (1992), Dept. of Mathematics, FUNDP, Namur, Belgium.

  12. A. R. Conn, N. I. M. Gould, A. Sartenaer and Ph. L. Toint, ``Global Convergence of two Augmented Lagrangian Algorithms for Optimization with a Combination of General Equality and Linear Constraints'', Technical Report TR/PA/93/26 (1993), CERFACS, Toulouse, France.

  13. A. R. Conn, N. I. M. Gould, A. Sartenaer and Ph. L. Toint, ``Local Convergence Properties of two Augmented Lagrangian Algorithms for Optimization with a Combination of General Equality and Linear Constraints'', Technical Report TR/PA/93/27 (1993), CERFACS, Toulouse, France.

  14. M. Arioli, T. F. Chan, I. S. Duff, N. I. M. Gould and J. K. Reid, ``Computing a search direction for large-scale linearly constrained nonlinear optimization calculations'', Technical Report TR/PA/93/34 (1993), CERFACS, Toulouse, France.

  15. I. Bongartz, A. R. Conn, N. I. M. Gould, M. A. Saunders and Ph. L. Toint, ``A numerical comparison between the LANCELOT and MINOS packages for large-scale nonlinear optimization'', Technical Report RAL-TR 97-054 (1997), Rutherford Appleton Laboratory, Chilton, England.

  16. I. Bongartz, A. R. Conn, N. I. M. Gould, M. A. Saunders and Ph. L. Toint, ``A numerical comparison between the LANCELOT and MINOS packages for large-scale nonlinear optimization: the complete results'', Technical Report 97/14 (1997), Dept. of Mathematics, FUNDP, Namur, Belgium.

  17. N. I. M. Gould, D. Orban and Ph. L. Toint, ``A Quadratic Programming Bibliography''. Numerical Analysis Group Internal Report 2000-1 (2000), Rutherford Appleton Laboratory, Chilton, England.

  18. N. I. M. Gould, D. Orban and Ph. L. Toint, ``Results from a numerical evaluation of LANCELOT B''. Numerical Analysis Group Internal Report 2002-1 (2002), Rutherford Appleton Laboratory, Chilton, England.

  19. R. H. Byrd, N. I. M. Gould, J. Nocedal and R. A. Waltz ``On the convergence of successive linear programming algorithms''. Technical Report RAL-TR-2003-013 (2003), Rutherford Appleton Laboratory, Chilton, England.

  20. N. I. M. Gould and J. A. Scott ``Complete results from a numerical evaluation of HSL packages for the direct-solution of large sparse, symmetric linear systems of equations''. Numerical Analysis Group Internal Report 2003-2 (2003), Rutherford Appleton Laboratory, Chilton, England.

  21. N. I. M. Gould, D. Orban and Ph. L. Toint, ``An interior-point l1-penalty method for nonlinear optimization''. Technical Report RAL-TR-2003-022 (2003), Rutherford Appleton Laboratory, Chilton, England.

  22. N. I. M. Gould, Y. Hu and J. A. Scott, ``Complete results from a numerical evaluation of sparse direct solvers for the solution of large, sparse, symmetric linear systems of equations''. Numerical Analysis Group Internal Report 2005-1 (2005), Rutherford Appleton Laboratory, Chilton, England.

Professor Nicholas Gould 2006-08-07
Random Image
Random Image
Random Image