Nicholas I. M. Gould

85 papers Journal 80Unranked 4

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Approximating Large-Scale Hessian Matrices Using Secant Equations. ACM Trans. Math. Softw. Jaroslav M. Fowkes, Nicholas I. M. Gould, Jennifer A. Scott
2025	J	`jnl`	Extended-Krylov-subspace methods for trust-region and norm-regularization subproblems. CoRR Hussam Al Daas, Nicholas I. M. Gould
2024	J	`jnl`	Approximating sparse Hessian matrices using large-scale linear least squares. Numer. Algorithms Jaroslav M. Fowkes, Nicholas I. M. Gould, Jennifer A. Scott
2023	J	`jnl`	GALAHAD 4.0: an open source library of Fortran packages with C and Matlab interfaces for continuous optimization. J. Open Source Softw. Jaroslav M. Fowkes, Nicholas I. M. Gould
2020	J	`jnl`	Error estimates for iterative algorithms for minimizing regularized quadratic subproblems. Optim. Methods Softw. Nicholas I. M. Gould, Valeria Simoncini
2020	J	`jnl`	Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints. SIAM J. Optim. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2019	J	`jnl`	Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems. Comput. Optim. Appl. Nicholas I. M. Gould, Tyrone Rees, Jennifer A. Scott
2019	J	`jnl`	Optimality of orders one to three and beyond: Characterization and evaluation complexity in constrained nonconvex optimization. J. Complex. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2017	J	`jnl`	A dual gradient-projection method for large-scale strictly convex quadratic problems. Comput. Optim. Appl. Nicholas I. M. Gould, Daniel P. Robinson
2017	J	`jnl`	An interior-point trust-funnel algorithm for nonlinear optimization. Math. Program. Frank E. Curtis, Nicholas I. M. Gould, Daniel P. Robinson, Philippe L. Toint
2017	J	`jnl`	Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization. Math. Program. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2017	J	`jnl`	Improved second-order evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. CoRR Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2017	J	`jnl`	Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization. CoRR Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2017	J	`jnl`	The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems. ACM Trans. Math. Softw. Nicholas I. M. Gould, Jennifer A. Scott
2017	J	`jnl`	Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients. Optim. Methods Softw. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2016	J	`jnl`	A Note on Performance Profiles for Benchmarking Software. ACM Trans. Math. Softw. Nicholas I. M. Gould, Jennifer A. Scott
2016	J	`jnl`	A dimer-type saddle search algorithm with preconditioning and linesearch. Math. Comput. Nicholas I. M. Gould, Christoph Ortner, D. Packwood
2016	J	`jnl`	Adaptive augmented Lagrangian methods: algorithms and practical numerical experience. Optim. Methods Softw. Frank E. Curtis, Nicholas I. M. Gould, Hao Jiang, Daniel P. Robinson
2015	J	`jnl`	A Nonmonotone Filter SQP Method: Local Convergence and Numerical Results. SIAM J. Optim. Nicholas I. M. Gould, Yueling Loh, Daniel P. Robinson
2015	J	`jnl`	A note on "On fast trust region methods for quadratic models with linear constraints", by Michael J.D. Powell. Math. Program. Comput. Daniel Bienstock, Philip E. Gill, Nicholas I. M. Gould
2015	J	`jnl`	Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties. J. Glob. Optim. Coralia Cartis, Jaroslav M. Fowkes, Nicholas I. M. Gould
2015	J	`jnl`	CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization. Comput. Optim. Appl. Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint
2015	J	`jnl`	On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods. SIAM J. Numer. Anal. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2014	J	`jnl`	A Filter Method with Unified Step Computation for Nonlinear Optimization. SIAM J. Optim. Nicholas I. M. Gould, Yueling Loh, Daniel P. Robinson
2014	J	`jnl`	On the complexity of finding first-order critical points in constrained nonlinear optimization. Math. Program. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2014	J	`jnl`	Projected Krylov Methods for Saddle-Point Systems. SIAM J. Matrix Anal. Appl. Nicholas I. M. Gould, Dominique Orban, Tyrone Rees
2013	J	`jnl`	A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions. J. Glob. Optim. Jaroslav M. Fowkes, Nicholas I. M. Gould, Chris L. Farmer
2013	J	`jnl`	A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function. Optim. Methods Softw. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2013	J	`jnl`	On the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization. SIAM J. Optim. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2013	J	`jnl`	Trajectory-following methods for large-scale degenerate convex quadratic programming. Math. Program. Comput. Nicholas I. M. Gould, Dominique Orban, Daniel P. Robinson
2012	J	`jnl`	Complexity bounds for second-order optimality in unconstrained optimization. J. Complex. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2012	J	`jnl`	Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization. Optim. Methods Softw. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2012	J	`jnl`	How good are extrapolated bi-projection methods for linear feasibility problems? Comput. Optim. Appl. Nicholas I. M. Gould
2012	J	`jnl`	On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization. SIAM J. Optim. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2012	J	`jnl`	Updating the regularization parameter in the adaptive cubic regularization algorithm. Comput. Optim. Appl. Nicholas I. M. Gould, Margherita Porcelli, Philippe L. Toint
2011	J	`jnl`	Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results. Math. Program. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2011	J	`jnl`	Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity. Math. Program. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2011	J	`jnl`	On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming. SIAM J. Optim. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2010	J	`jnl`	A Second Derivative SQP Method: Global Convergence. SIAM J. Optim. Nicholas I. M. Gould, Daniel P. Robinson
2010	J	`jnl`	A Second Derivative SQP Method: Local Convergence and Practical Issues. SIAM J. Optim. Nicholas I. M. Gould, Daniel P. Robinson
2010	J	`jnl`	Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares. SIAM J. Numer. Anal. Stefania Bellavia, Coralia Cartis, Nicholas I. M. Gould, Benedetta Morini, Philippe L. Toint
2010	J	`jnl`	Nonlinear programming without a penalty function or a filter. Math. Program. Nicholas I. M. Gould, Philippe L. Toint
2010	J	`jnl`	On solving trust-region and other regularised subproblems in optimization. Math. Program. Comput. Nicholas I. M. Gould, Daniel P. Robinson, H. Sue Thorne
2010	J	`jnl`	On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems. SIAM J. Optim. Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
2010	J	`jnl`	Preconditioning Saddle-Point Systems with Applications in Optimization. SIAM J. Sci. Comput. H. Sue Dollar, Nicholas I. M. Gould, Martin Stoll, Andrew J. Wathen
2009	J	`jnl`	Spectral Analysis of Saddle Point Matrices with Indefinite Leading Blocks. SIAM J. Matrix Anal. Appl. Nicholas I. M. Gould, Valeria Simoncini
2008	J	`jnl`	How good are projection methods for convex feasibility problems? Comput. Optim. Appl. Nicholas I. M. Gould
2007	J	`jnl`	A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations. ACM Trans. Math. Softw. Nicholas I. M. Gould, Jennifer A. Scott, Yifan Hu
2007	J	`jnl`	FILTRANE, a Fortran 95 filter-trust-region package for solving nonlinear least-squares and nonlinear feasibility problems. ACM Trans. Math. Softw. Nicholas I. M. Gould, Philippe L. Toint
2007	J	`jnl`	Using constraint preconditioners with regularized saddle-point problems. Comput. Optim. Appl. H. Sue Dollar, Nicholas I. M. Gould, Wil H. A. Schilders, Andy J. Wathen
2006	J	`jnl`	Implicit-Factorization Preconditioning and Iterative Solvers for Regularized Saddle-Point Systems. SIAM J. Matrix Anal. Appl. H. Sue Dollar, Nicholas I. M. Gould, Wil H. A. Schilders, Andrew J. Wathen
2005	J	`jnl`	On the Convergence of Successive Linear-Quadratic Programming Algorithms. SIAM J. Optim. Richard H. Byrd, Nicholas I. M. Gould, Jorge Nocedal, Richard A. Waltz
2005	J	`jnl`	Sensitivity of trust-region algorithms to their parameters. 4OR Nicholas I. M. Gould, Dominique Orban, Annick Sartenaer, Philippe L. Toint
2004	J	`jnl`	A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares. SIAM J. Optim. Nicholas I. M. Gould, Sven Leyffer, Philippe L. Toint
2004	J	`jnl`	A numerical evaluation of HSL packages for the direct solution of large sparse, symmetric linear systems of equations. ACM Trans. Math. Softw. Nicholas I. M. Gould, Jennifer A. Scott
2004	—	`conf`	An Evaluation of Sparse Direct Symmetric Solvers: An Introduction and Preliminary Findings. PARA Jennifer A. Scott, Yifan Hu, Nicholas I. M. Gould
2004	J	`jnl`	An algorithm for nonlinear optimization using linear programming and equality constrained subproblems. Math. Program. Richard H. Byrd, Nicholas I. M. Gould, Jorge Nocedal, Richard A. Waltz
2003	J	`jnl`	CUTEr and SifDec: A constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint
2003	J	`jnl`	GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization. ACM Trans. Math. Softw. Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint
2002	J	`jnl`	Componentwise fast convergence in the solution of full-rank systems of nonlinear equations. Math. Program. Nicholas I. M. Gould, Dominique Orban, Annick Sartenaer, Philippe L. Toint
2002	J	`jnl`	Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming. SIAM J. Optim. Roger Fletcher, Nicholas I. M. Gould, Sven Leyffer, Philippe L. Toint, Andreas Wächter
2001	—	`conf`	Global Convergence of a Hybrid Trust-Region SQP-Filter Algorithm for General Nonlinear Programming. System Modelling and Optimization Nicholas I. M. Gould, Philippe L. Toint
2001	J	`jnl`	On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization. SIAM J. Sci. Comput. Nicholas I. M. Gould, Mary E. Hribar, Jorge Nocedal
2001	J	`jnl`	Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming. SIAM J. Optim. Nicholas I. M. Gould, Dominique Orban, Annick Sartenaer, Philippe L. Toint
2000	J	`jnl`	A primal-dual trust-region algorithm for non-convex nonlinear programming. Math. Program. Andrew R. Conn, Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint
2000	J	`jnl`	Constraint Preconditioning for Indefinite Linear Systems. SIAM J. Matrix Anal. Appl. Carsten Keller, Nicholas I. M. Gould, Andrew J. Wathen
2000	—	`book`	Trust Region Methods Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint
1999	J	`jnl`	A note on the convergence of barrier algorithms to second-order necessary points. Math. Program. Nicholas I. M. Gould, Philippe L. Toint
1999	—	`conf`	SQP Methods for Large-Scale Nonlinear Programming. System Modelling and Optimization Nicholas I. M. Gould, Philippe L. Toint
1999	J	`jnl`	Solving the Trust-Region Subproblem using the Lanczos Method. SIAM J. Optim. Nicholas I. M. Gould, Stefano Lucidi, Massimo Roma, Philippe L. Toint
1999	J	`jnl`	Subspace-by-subspace preconditioners for structured linear systems. Numer. Linear Algebra Appl. Michel J. Daydé, Jérôme P. Décamps, Nicholas I. M. Gould
1998	J	`jnl`	Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques. SIAM J. Sci. Comput. Nicholas I. M. Gould, Jennifer A. Scott
1997	J	`jnl`	A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds. Math. Comput. Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint
1997	J	`jnl`	Element-by-Element Preconditioners for Large Partially Separable Optimization Problems. SIAM J. Sci. Comput. Michel J. Daydé, Jean-Yves L'Excellent, Nicholas I. M. Gould
1997	J	`jnl`	On the Number of Inner Iterations Per Outer Iteration of a Globally Convergent Algorithm for Optimization with General Nonlinear Inequality Constraints and Simple Bounds. Comput. Optim. Appl. Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint
1996	J	`jnl`	Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints. SIAM J. Optim. Andrew R. Conn, Nicholas I. M. Gould, Annick Sartenaer, Philippe L. Toint
1996	J	`jnl`	Numerical experiments with the LANCELOT package (Release A) for large-scale nonlinear optimization. Math. Program. Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint
1996	—	`conf`	Preprocessing of Sparse Unassembled Linear Systems for Efficient Solution Using Element-by-Element Preconditioners. Euro-Par, Vol. II Michel J. Daydé, Jean-Yves L'Excellent, Nicholas I. M. Gould
1995	J	`jnl`	CUTE: Constrained and Unconstrained Testing Environment. ACM Trans. Math. Softw. Ingrid Bongartz, Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint
1994	J	`jnl`	A note on exploiting structure when using slack variables. Math. Program. Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint
1991	J	`jnl`	Convergence of quasi-Newton matrices generated by the symmetric rank one update. Math. Program. Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint
1989	J	`jnl`	New crash procedures for large systems of linear constraints. Math. Program. Nicholas I. M. Gould, John K. Reid
1987	J	`jnl`	An exact penalty function for semi-infinite programming. Math. Program. Andrew R. Conn, Nicholas I. M. Gould
1985	J	`jnl`	On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem. Math. Program. Nicholas I. M. Gould
1984	J	`jnl`	A weighted gram-schmidt method for convex quadratic programming. Math. Program. Philip E. Gill, Nicholas I. M. Gould, Walter Murray, Michael A. Saunders, Margaret H. Wright