N. Gould

发表

On the convegence of a sequential penalty function method for constrained minimization

N. Gould, 1989 .

An Algorithm for Large-Scale Quadratic Programming

N. Gould, 1991 .

On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions

N. Gould, 1986 .

The factorization of sparse symmetric indefinite matrices

I. Duff, J. Reid, N. Gould, 1991 .

On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization

Nicholas I. M. Gould, Jorge Nocedal, Mary E. Hribar, 2001, SIAM J. Sci. Comput..

A Filter Active-Set Trust-Region Method

M. Friedlander, N. Gould, S. Leyffer, 2007 .

Computing a search direction for large scale linearly constrained nonlinear optimization calculations

T. Chan, I. Duff, J. Reid, 1993 .

The modified absolute-value factorization norm for trust-region minimization

J. Nocedal, N. Gould, 1998 .

A weighted gram-schmidt method for convex quadratic programming

Nicholas I. M. Gould, Michael A. Saunders, Philip E. Gill, 1984, Math. Program..

Range-Space Methods for Convex Quadratic Programming.

P. Gill, W. Murray, N. Gould, 1982 .

On the Convergence of Successive Linear-Quadratic Programming Algorithms

Nicholas I. M. Gould, Jorge Nocedal, Richard H. Byrd, 2005, SIAM J. Optim..

An active set algorithm for nonlinear programming using linear programming and equality constrain

J. Nocedal, R. Byrd, N. Gould, 2002 .

SIAM Journal on Optimization

Nicholas I. M. Gould, Stefan Ulbrich, Masao Fukushima, 2012 .

An algorithm for nonlinear optimization using linear programming and equality constrained subproblems

Nicholas I. M. Gould, Jorge Nocedal, Richard H. Byrd, 2004, Math. Program..

On the Convergence of Successive Linear Programming Algorithms

Nicholas I. M. Gould, Jorge Nocedal, Richard H. Byrd, 2003 .

An active-set algorithm for nonlinear programming using linear programming and equality constained subproblems

J. Nocedal, R. Byrd, N. Gould, 2003 .

A second derivative SQP method with imposed descent

Daniel P. Robinson, N. Gould, 2008 .

A Note on Performance Profiles for Benchmarking Software

Nicholas I. M. Gould, Jennifer A. Scott, N. Gould, 2016, ACM Trans. Math. Softw..

A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares

Nicholas I. M. Gould, Sven Leyffer, Philippe L. Toint, 2004, SIAM J. Optim..

On iterative methods and implicit-factorization preconditioners for regularized saddle-point systems

N. Gould, A. Wathen, H. Dollar, 2005 .

A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations

Nicholas I. M. Gould, Jennifer A. Scott, Yifan Hu, 2007, TOMS.

A second-derivative SQP method with a ‘trust-region-free’ predictor step

Daniel P. Robinson, N. Gould, 2012 .

On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem

Nicholas I. M. Gould, N. Gould, 1985, Math. Program..

Exploiting negative curvature directions in linesearch methods for unconstrained optimization

S. Lucidi, P. Toint, N. Gould, 2000 .

A second derivative SQP method: theoretical issues

Daniel P. Robinson, N. Gould, 2008 .

User's guide to PAREBE: parallel element-by-element preconditioners for the conjugate gradient algorithm

Nicholas I. M. Gould, Jean-Yves L'Excellent, Michel Daydé, 1995 .

Preprocessing of Sparse Unassembled Linear Systems for Efficient Solution Using Element-by-Element Preconditioners

Nicholas I. M. Gould, Jean-Yves L'Excellent, Michel J. Daydé, 1996, Euro-Par, Vol. II.

A Second Derivative SQP Method: Global Convergence

Nicholas I. M. Gould, Daniel P. Robinson, N. Gould, 2010, SIAM J. Optim..

RAL-TR-95-037 Constructing appropriate models for large-scale , linearly-constrained , nonconvex , nonlinear optimization algorithms by

N. Gould, 1995 .

2 A SECOND DERIVATIVE SQP METHOD WITH IMPOSED DESCENT 1

Daniel P. Robinson, N. Gould, 2008 .

2 A SECOND DERIVATIVE SQP METHOD : THEORETICAL ISSUES 1

Daniel P. Robinson, N. Gould, 2008 .

RAL-TR-2008-019 A second derivative SQP method with imposed descent 1

Daniel P. Robinson, N. Gould, 2008 .

On growth in Gaussian elimination with complete pivoting

N. Gould, 1991 .

Solution of Unassembled Linear Systems Using Block Stretching: Preliminary Experiments

Jérôme P. Décamps, N. Gould, M. Daydé, 1997 .

A Bramble-Pasciak-like method with applications in optimization

Martin Stoll, Andrew J. Wathen, H. Sue Dollar, 2008 .

A second-derivative trust-region SQP method with a "trust-region-free" predictor step

Daniel P. Robinson, N. Gould, 2009 .

Some Reflections on the Current State of Active-Set and Interior-Point Methods for Constrained Op

N. Gould, 2003 .

The University of Reading Department of Mathematics Using Constraint Preconditioners with Regularized Saddle-Point Problems

N. Gould, A. Wathen, H. Dollar, 2006 .

RAL-TR-2009-024 A second-derivative trust-region SQP method with a “ trust-region-free ” predictor step 1

Daniel P. Robinson, N. Gould, 2009 .

The filter-idea and its application to the nonlinear feasibility problem

N. Gould, 2018 .

On approximate-inverse preconditioners 1 by

N. Gould, J. Scott, 1995 .

On implicit-factorization constraint preconditioners

Andrew J. Wathen, H. Sue Dollar, N. Gould, 2006 .

Finding a positive semidefinite interval for a parametric matrix

N. Gould, R. Caron, 1986 .

On the Use of Block Stretching for Solving Unassembled Linear Systems

Jérôme P. Décamps, N. Gould, M. Daydé, 2018 .

Spectral Analysis of Saddle Point Matrices with Indefinite Leading Blocks

Nicholas I. M. Gould, Valeria Simoncini, N. Gould, 2009, SIAM J. Matrix Anal. Appl..

RAL-TR-1999-016 Constraint preconditioning forinde nite linear

N. Gould, A. Wathen, systemsCarsten, 2007 .

MUSSELS ― A multifrontal sparse symmetric element-input linear solver

Nicholas I. M. Gould, Jennifer A. Scott, Patrick R. Amestoy, 1994 .

Preprint RAL-P-2014-012 R A Nonmonotone Filter SQP Method : Local Convergence and Numerical Results

Daniel P. Robinson, N. Gould, Yueling Loh, 2014 .

RAL-TR-2009-001 A second derivative SQP method : global convergence 1

Daniel P. Robinson, N. Gould, 2009 .

Preprint RAL-P-2014-012 A Filter SQP Method : Local Convergence and Numerical Results

Daniel P. Robinson, N. Gould, Yueling Loh, 2014 .

A dual gradient-projection method for large-scale strictly convex quadratic problems

Daniel P. Robinson, N. Gould, 2016, Computational Optimization and Applications.

A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions

N. Gould, C. Farmer, J. Fowkes, 2012, Journal of Global Optimization.

Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems

N. Gould, J. Scott, T. Rees, 2019, Computational Optimization and Applications.

A Filter Method with Unified Step Computation for Nonlinear Optimization

Nicholas I. M. Gould, Daniel P. Robinson, Yueling Loh, 2014, SIAM J. Optim..

Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties

Nicholas I. M. Gould, Jaroslav M. Fowkes, Coralia Cartis, 2014, Journal of Global Optimization.

Element-by-Element Preconditioners for Large Partially Separable Optimization Problems

Nicholas I. M. Gould, Jean-Yves L'Excellent, Michel J. Daydé, 1997, SIAM J. Sci. Comput..

A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions

Nicholas I. M. Gould, Chris L. Farmer, Jaroslav M. Fowkes, 2013, J. Glob. Optim..

On Modified Factorizations for Large-Scale Linearly Constrained Optimization

Nicholas I. M. Gould, N. Gould, 1999, SIAM J. Optim..

On solving three classes of nonlinear programming problems via simple differentiable penalty functions

N. Gould, Nicholas I. M. Gould, 1988 .

Adaptive augmented Lagrangian methods: algorithms and practical numerical experience

Nicholas I. M. Gould, Hao Jiang, Daniel P. Robinson, 2014, Optim. Methods Softw..

Solution of Large Scale Partially Separable Unconstrained Optimization Problems Using Element-by-Element Preconditioners

Nicholas I. M. Gould, Jean-Yves L'Excellent, Michel Daydé, 1996 .

A fast method for binary programming using first‐order derivatives, with application to topology optimization with buckling constraints

Jennifer A. Scott, H. A. Kim, Chris Budd, 2012 .

A Second Derivative SQP Method: Local Convergence and Practical Issues

Nicholas I. M. Gould, Daniel P. Robinson, N. Gould, 2010, SIAM J. Optim..

The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems

Nicholas I. M. Gould, Jennifer A. Scott, N. Gould, 2017, ACM Trans. Math. Softw..

Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming

Nicholas I. M. Gould, Sven Leyffer, Roger Fletcher, 2002, SIAM J. Optim..

Using constraint preconditioners with regularized saddle-point problems

Nicholas I. M. Gould, Wil H. A. Schilders, Andrew J. Wathen, 2007, Comput. Optim. Appl..

Updating the regularization parameter in the adaptive cubic regularization algorithm

Nicholas I. M. Gould, Philippe L. Toint, Margherita Porcelli, 2012, Comput. Optim. Appl..

A Nonmonotone Filter SQP Method: Local Convergence and Numerical Results

Nicholas I. M. Gould, Daniel P. Robinson, Yueling Loh, 2015, SIAM J. Optim..

Constraint Preconditioning for Indefinite Linear Systems

Nicholas I. M. Gould, Andrew J. Wathen, Carsten Keller, 2000, SIAM J. Matrix Anal. Appl..

Trajectory-following methods for large-scale degenerate convex quadratic programming

Nicholas I. M. Gould, Daniel P. Robinson, Dominique Orban, 2011, Mathematical Programming Computation.

On solving trust-region and other regularised subproblems in optimization

Nicholas I. M. Gould, Daniel P. Robinson, H. Sue Thorne, 2010, Math. Program. Comput..

Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques

N. Gould, J. Scott, 1998, SIAM J. Sci. Comput..

A universal preconditioner for simulating condensed phase materials.

Noam Bernstein, Christoph Ortner, Nicholas Gould, 2016, The Journal of chemical physics.

A dual gradient-projection method for large-scale strictly convex quadratic problems

Nicholas I. M. Gould, Daniel P. Robinson, N. Gould, 2017, Comput. Optim. Appl..

A dimer-type saddle search algorithm with preconditioning and linesearch

Nicholas I. M. Gould, Christoph Ortner, D. Packwood, 2016, Math. Comput..

An Efficient Dimer Method With Preconditioning And Linesearch

N. Gould, C. Ortner, D. Packwood, 2014, 1407.2817.

An interior-point trust-funnel algorithm for nonlinear optimization

Nicholas I. M. Gould, Daniel P. Robinson, Philippe L. Toint, 2014, Math. Program..

Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems

Nicholas I. M. Gould, Jennifer A. Scott, Tyrone Rees, 2019, Comput. Optim. Appl..

Implicit-Factorization Preconditioning and Iterative Solvers for Regularized Saddle-Point Systems

Nicholas I. M. Gould, Wil H. A. Schilders, Andrew J. Wathen, 2006, SIAM J. Matrix Anal. Appl..

Exploiting negative curvature directions in linesearch methods for unconstrained optimization

S. Lucidi, P. Toint, N. Gould, 2000 .

How good are projection methods for convex feasibility problems?

Nicholas I. M. Gould, N. Gould, 2008, Comput. Optim. Appl..

A fast method for binary programming using first‐order derivatives, with application to topology optimization with buckling constraints

N. Gould, J. Scott, C. Budd, 2012 .

A numerical evaluation of HSL packages for the direct solution of large sparse, symmetric linear systems of equations

Nicholas I. M. Gould, Jennifer A. Scott, N. Gould, 2004, TOMS.

Projected Krylov Methods for Saddle-Point Systems

Nicholas I. M. Gould, Dominique Orban, Tyrone Rees, 2013, SIAM J. Matrix Anal. Appl..

Preconditioning Saddle-Point Systems with Applications in Optimization

Nicholas I. M. Gould, Martin Stoll, Andrew J. Wathen, 2010, SIAM J. Sci. Comput..

Iterative methods for ill-conditioned linear systems from optimization

Nicholas I. M. Gould, N. Gould, 2000 .

Use of the P4 and P5 Algorithms for In-Core Factorization of Sparse Matrices

Nicholas I. M. Gould, Iain S. Duff, John Reid, 1990, SIAM J. Sci. Comput..

A dimer-type saddle search algorithm with preconditioning and linesearch

N. Gould, C. Ortner, D. Packwood, 2016, Math. Comput..

Subspace-by-subspace preconditioners for structured linear systems

Nicholas I. M. Gould, Michel J. Daydé, Jérôme P. Décamps, 1999, Numer. Linear Algebra Appl..

A Filter SQP Method: Local Convergence and Numerical Results

Daniel P. Robinson, Yueling Loh, N. Gould, 2014 .

A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations

N. Gould, J. Scott, Yifan Hu, 2007, TOMS.

New crash procedures for large systems of linear constraints

Nicholas I. M. Gould, John K. Reid, J. Reid, 1989, Math. Program..

A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions

N. Gould, C. Farmer, J. Fowkes, 2012, Journal of Global Optimization.