Nicholas I. M. Gould

发表

A primal-dual trust-region algorithm for non-convex nonlinear programming

Nicholas I. M. Gould, Dominique Orban, Andrew R. Conn, 2000, Math. Program..

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.

Methods for nonlinear constraints in optimization calculations

Nicholas I. M. Gould, Andrew R. Conn, Philippe L. Toint, 1996 .

How good are projection methods for convex feasibility problems?

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

2. Basic Concepts

Nicholas I. M. Gould, Andrew R. Conn, Philippe L. Toint, 2000 .

Second-Order Optimality and Beyond: Characterization and Evaluation Complexity in Convexly Constrained Nonlinear Optimization

Nicholas I. M. Gould, Philippe L. Toint, Coralia Cartis, 2018, Found. Comput. Math..

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.

Solving the Trust-Region Subproblem using the Lanczos Method

Nicholas I. M. Gould, Stefano Lucidi, Massimo Roma, 1999, SIAM J. Optim..

SQP Methods for Large-Scale Nonlinear Programming

Nicholas I. M. Gould, Philippe L. Toint, P. Toint, 1999, System Modelling and 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..

Trust Region Methods

Nicholas I. M. Gould, Andrew R. Conn, Philippe L. Toint, 2000, MOS-SIAM Series on Optimization.

A note about the complexity of minimizing Nesterov's smooth Chebyshev–Rosenbrock function

Nicholas I. M. Gould, Philippe L. Toint, Coralia Cartis, 2013, Optim. Methods Softw..

Universal regularization methods - varying the power, the smoothness and the accuracy

Nicholas I. M. Gould, Philippe L. Toint, Coralia Cartis, 2018, 1811.07057.

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 .

Improved second-order evaluation complexity for unconstrained nonlinear optimization using high-order regularized models pdf

Nicholas I. M. Gould, Philippe L. Toint, Coralia Cartis, 2017, ArXiv.

On Iterated-Subspace Minimization Methods for Nonlinear Optimization

Nicholas I. M. Gould, Andrew R. Conn, Philippe L. Toint, 1996 .

Evaluation complexity bounds for smooth constrained nonlinear optimisation using scaled KKT conditions, high-order models and the criticality measure $χ$ pdf

Nicholas I. M. Gould, Philippe L. Toint, Coralia Cartis, 2017, ArXiv.

On the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization

Nicholas I. M. Gould, Philippe L. Toint, Coralia Cartis, 2013, SIAM J. Optim..

Iterative methods for ill-conditioned linear systems from optimization

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

A numerical comparison between the Lancelot and Minos packages for large-scale nonlinear optimization: the complete results

Nicholas I. M. Gould, Michael A. Saunders, Philippe L. Toint, 1997 .

10. Algorithmic Extensions

Nicholas I. M. Gould, Andrew R. Conn, Philippe L. Toint, 2000 .

Preprocessing for quadratic programming

Nicholas I. M. Gould, Philippe L. Toint, P. Toint, 2004, Math. Program..

A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds

Nicholas I. M. Gould, Andrew R. Conn, Philippe L. Toint, 1997, Math. Comput..

Constraint Preconditioning for Indefinite Linear Systems

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

On the complexity of finding first-order critical points in constrained nonlinear optimization

Nicholas I. M. Gould, Philippe L. Toint, Coralia Cartis, 2014, Math. Program..

Solution of large-scale partially separable optimization problems using element-by-element preconditioners

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

Optimal Multilateral Well Placement

Nicholas I. M. Gould, Chris L. Farmer, Jaroslav Fowkes, 2010 .

Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity

Nicholas I. M. Gould, Philippe L. Toint, Coralia Cartis, 2011, Math. Program..

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.

Spectral Analysis of Saddle Point Matrices with Indefinite Leading Blocks

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

CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization

Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint, 2013, Computational Optimization and Applications.

CUTE: constrained and unconstrained testing environment

Nicholas I. M. Gould, Andrew R. Conn, Philippe L. Toint, 1995, TOMS.

MUSSELS ― A multifrontal sparse symmetric element-input linear solver

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

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-Trust-Region Method for Unconstrained Optimization

Nicholas I. M. Gould, Caroline Sainvitu, Philippe L. Toint, 2005, SIAM J. Optim..

On solving trust-region and other regularised subproblems in optimization

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

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..

Large-scale nonlinear constrained optimization

Nicholas I. M. Gould, Ph. L. Toint, Andrew R. Conn, 1992 .

On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming

Nicholas I. M. Gould, Philippe L. Toint, Coralia Cartis, 2011, SIAM J. Optim..

An interior-point trust-funnel algorithm for nonlinear optimization

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

6. Global Convergence of the Basic Algorithm

Nicholas I. M. Gould, Andrew R. Conn, Philippe L. Toint, 2000 .

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

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

Solution of Structured Systems of Linear Equations Using Element-by-Element Preconditioners

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

A Filter Method with Unified Step Computation for Nonlinear Optimization

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

Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization

Nicholas I. M. Gould, Philippe L. Toint, Coralia Cartis, 2017, Math. Program..

A note on “On fast trust region methods for quadratic models with linear constraints”, by Michael J.D. Powell

Nicholas I. M. Gould, Philip E. Gill, Daniel Bienstock, 2015, Math. Program. Comput..

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..

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

Nicholas I. M. Gould, Philippe L. Toint, 2001, System Modelling and Optimization.

A Second Derivative SQP Method: Local Convergence and Practical Issues

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

On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems

Nicholas I. M. Gould, Philippe L. Toint, Coralia Cartis, 2010, SIAM J. Optim..

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.

SIAM Journal on Optimization

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

LANCELOT_SIMPLE: A Simple Interface for LANCELOT B

Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint, 2008 .

A numerical comparison between the LANCELOT and MINOS packages for large-scale constrained optimization

Nicholas I. M. Gould, Michael A. Saunders, Andrew R. Conn, 1997 .

Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares

Nicholas I. M. Gould, Stefania Bellavia, Benedetta Morini, 2010, SIAM J. Numer. Anal..

On the Number of Inner Iterations Per Outer Iteration of a Globally Convergent Algorithm for Optimization with General Nonlinear Inequality Constraints and Simple Bounds

Nicholas I. M. Gould, Andrew R. Conn, Philippe L. Toint, 1997, Comput. Optim. Appl..

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..

Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints

Nicholas I. M. Gould, Andrew R. Conn, Philippe L. Toint, 1996, SIAM J. Optim..

12. Projection Methods for Convex Constraints

Nicholas I. M. Gould, Andrew R. Conn, Philippe L. Toint, 2000 .

Large-scale Nonlinear Constrained Optimization: a Current Survey

Nicholas I. M. Gould, Andrew R. Conn, Philippe L. Toint, 1994 .

How good are extrapolated bi-projection methods for linear feasibility problems?

Nicholas I. M. Gould, 2012, Comput. Optim. Appl..

An Evaluation of Sparse Direct Symmetric Solvers: An Introduction and Preliminary Findings

Nicholas I. M. Gould, Jennifer A. Scott, Yifan Hu, 2004, PARA.

8. Further Convergence Theory Issues

Nicholas I. M. Gould, Andrew R. Conn, Philippe L. Toint, 2000 .

Nonlinear programming: theory and practice

Nicholas I. M. Gould, Sven Leyffer, Philippe L. Toint, 2004, Math. Program..

GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization

Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint, 2003, TOMS.

A Note on Performance Profiles for Benchmarking Software

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

Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results

Nicholas I. M. Gould, Philippe L. Toint, Coralia Cartis, 2011, Math. Program..

A Nonmonotone Filter SQP Method: Local Convergence and Numerical Results

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

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..

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..

Convergence of quasi-Newton matrices generated by the symmetric rank one update

Nicholas I. M. Gould, Andrew R. Conn, Philippe L. Toint, 1991, Math. Program..

An Introduction to Algorithms for Nonlinear Optimization

Nicholas I. M. Gould, Sven Leyffer, 2003 .

A dimer-type saddle search algorithm with preconditioning and linesearch

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

Sensitivity of trust-region algorithms to their parameters

Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint, 2005, 4OR.

How much patience do you have? A worst-case perspective on smooth nonconvex optimization

Nicholas I. M. Gould, Philippe L. Toint, Coralia Cartis, 2012 .

A note on the convergence of barrier algorithms to second-order necessary points

Nicholas I. M. Gould, Philippe L. Toint, P. Toint, 1999, Math. Program..

Erratum to: Nonlinear programming without a penalty function or a filter

Nicholas I. M. Gould, Philippe L. Toint, 2012, Math. Program..

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..

An Interior-Point l 1 -Penalty Method for Nonlinear Optimization

Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint, 2010 .

Numerical experiments with the LANCELOT package (release A) for large-scale nonlinear optimization

Nicholas I. M. Gould, Andrew R. Conn, Philippe L. Toint, 1996, Math. Program..

On the Convergence of Successive Linear-Quadratic Programming Algorithms

Nicholas I. M. Gould, Jorge Nocedal, Richard H. Byrd, 2005, 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..

Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming

Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint, 2000, SIAM J. Optim..

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

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

Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region

Nicholas I. M. Gould, Andrew R. Conn, Philippe L. Toint, 1996, SIAM J. Optim..

7. The Trust-Region Subproblem

Nicholas I. M. Gould, Andrew R. Conn, Philippe L. Toint, 2000 .

Complexity bounds for second-order optimality in unconstrained optimization

Nicholas I. M. Gould, Philippe L. Toint, Coralia Cartis, 2012, J. Complex..

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..

On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods

Nicholas I. M. Gould, Philippe L. Toint, Coralia Cartis, 2015, SIAM J. Numer. Anal..

A note on exploiting structure when using slack variables

Nicholas I. M. Gould, Andrew R. Conn, Philippe L. Toint, 1994, Math. Program..

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..

On Modified Factorizations for Large-Scale Linearly Constrained Optimization

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

On the Convergence of Successive Linear Programming Algorithms

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

Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints

Nicholas I. M. Gould, Philippe L. Toint, Coralia Cartis, 2018, SIAM J. Optim..

Projected Krylov Methods for Saddle-Point Systems

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

Global Convergence of two Augmented Lagrangian Algorithms for Optimization with a Combination of Gen

Nicholas I. M. Gould, Andrew R. Conn, Philippe L. Toint, 1993 .

New crash procedures for large systems of linear constraints

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

Lancelot: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A)

Nicholas I. M. Gould, Andrew R. Conn, Philippe L. Toint, 1992 .

Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients

Nicholas I. M. Gould, Philippe L. Toint, Coralia Cartis, 2017, Optim. Methods Softw..

A weighted gram-schmidt method for convex quadratic programming

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

Nonlinear programming without a penalty function or a filter

Nicholas I. M. Gould, Philippe L. Toint, P. Toint, 2010, Math. Program..

On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization

Nicholas I. M. Gould, Philippe L. Toint, Coralia Cartis, 2012, SIAM J. Optim..

Global Convergence of a Class of Trust Region Algorithms for Optimization Using Inexact Projections on Convex Constraints

Nicholas I. M. Gould, Andrew R. Conn, Philippe L. Toint, 1993, SIAM J. Optim..

Error estimates for iterative algorithms for minimizing regularized quadratic subproblems

Nicholas I. M. Gould, Valeria Simoncini, 2020, Optim. Methods Softw..

An exact penalty function for semi-infinite programming

Nicholas I. M. Gould, Andrew R. Conn, N. Gould, 1987, Math. Program..

Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization

Nicholas I. M. Gould, Philippe L. Toint, Coralia Cartis, 2012, Optim. Methods Softw..

Parallel Algorithms for Structured Systems of Linear Equations

Nicholas I. M. Gould, Patrick R. Amestoy, Jean-Yves L'Excellent, 1994 .

CUTEr and SifDec: A constrained and unconstrained testing environment, revisited

Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint, 2003, TOMS.

Preconditioning Saddle-Point Systems with Applications in Optimization

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

Results from a numerical evaluation of LANCELOT B

Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint, 2002 .

Using constraint preconditioners with regularized saddle-point problems

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

Componentwise fast convergence in the solution of full-rank systems of nonlinear equations

Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint, 2002, Math. Program..

Adaptive augmented Lagrangian methods: algorithms and practical numerical experience

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

A Second Derivative SQP Method: Global Convergence

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

FILTRANE, a Fortran 95 filter-trust-region package for solving nonlinear least-squares and nonlinear feasibility problems

Nicholas I. M. Gould, Philippe L. Toint, P. Toint, 2007, TOMS.

Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization

Nicholas I. M. Gould, Philippe L. Toint, Coralia Cartis, 2017, J. Complex..

Updating the regularization parameter in the adaptive cubic regularization algorithm

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

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

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

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 .

Numerical methods for large-scale nonlinear optimization

Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint, 2005, Acta Numerica.

SOLVING THE TRUST-REGION SUBPROBLEM USING THE

Nicholas I. M. Gould, Stefano Lucidi, Massimo Roma, 1999 .

Proceedings of the 12th European Conference on the Mathematics of Oil Recovery, Oxford

Nicholas I. M. Gould, Chris L. Farmer, Jaroslav Fowkes, 2010 .