N. Gould

发表

An iterative working-set method for large-scale nonconvex quadratic programming

P. Toint, N. Gould, 2002 .

Testing a class of methods for solving minimization problems with simple bounds on the variables

P. Toint, N. Gould, A. Conn, 1988 .

A primal-dual algorithm for minimizing a non-convex function subject to bound and linear equality constraints

P. Toint, N. Gould, A. Conn, 2000 .

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

A note on using alternative second-order models for the subproblems arising in barrier function methods for minimization

P. Toint, N. Gould, A. Conn, 1994 .

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

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

CUTE: constrained and unconstrained testing environment

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

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

Adaptive cubic overestimation methods for unconstrained optimization

P. Toint, N. Gould, C. Cartis, 2007 .

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

P. Toint, N. Gould, C. Cartis, 2008 .

Adaptive cubic overestimation methods for unconstrained optimization . Part II : worst-case iteration complexity

P. Toint, N. Gould, C. Cartis, 2007 .

Trust-region and other regularisations of linear least-squares problems

P. Toint, N. Gould, C. Cartis, 2009 .

A Linesearch Algorithm with Memory for Unconstrained Optimization

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

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

Performance of a multifrontal scheme for partially separable optimization

P. Toint, N. Gould, A. Conn, 1994 .

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.

Numerical Methods for Large-Scale Non-Convex Quadratic Programming

P. Toint, N. Gould, 2002 .

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 .

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

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

P. Toint, N. Gould, A. Conn, 1991 .

SQP Methods for Large-Scale Nonlinear Programming

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

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

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

Optimal Newton-type methods for nonconvex smooth optimization problems

P. Toint, N. Gould, C. Cartis, 2011 .

Trust Region Methods

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

Solving the Trust-Region Subproblem using the Lanczos Method

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

A note on the second-order convergence of optimization algorithms using barrier functions

P. Toint, N. Gould, 1997 .

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 adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity

P. Toint, N. Gould, C. Cartis, 2012 .

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

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

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

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

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

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

Local Convergence Properties of two Augmented Lagrangian Algorithms for Optimization with a Combinat

P. Toint, N. Gould, A. Conn, 1993 .

On Iterated-Subspace Minimization Methods for Nonlinear Optimization

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

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

Preprocessing for quadratic programming

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

WORST-CASE EVALUATION COMPLEXITY AND OPTIMALITY OF SECOND-ORDER METHODS FOR NONCONVEX SMOOTH OPTIMIZATION

Philippe L. Toint, Coralia Cartis, Nick I. M. Gould, 2017, Proceedings of the International Congress of Mathematicians (ICM 2018).

Improved worst-case evaluation complexity for potentially rank-deficient nonlinear least-Euclidean-norm problems using higher-order regularized models

P. Toint, N. Gould, C. Cartis, 2015 .

Finding a point in the relative interior of a polyhedron

N. Gould, C. Cartis, 2007 .

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 .

Methods for nonlinear constraints in optimization calculations

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

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

Global Convergence of a Non-monotone Trust-Region Filter Algorithm for Nonlinear Programming

P. Toint, N. Gould, 2006 .

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.

Evaluation Complexity Bounds for Smooth Constrained Nonlinear Optimization Using Scaled KKT Conditions and High-Order Models

P. Toint, N. Gould, C. Cartis, 2019, Approximation and Optimization.

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

Nonlinear programming: theory and practice

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

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

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

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 Interior-Point l 1 -Penalty Method for Nonlinear Optimization

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

On the Location of Directions of Infinite Descent for Nonlinear Programming Algorithms

N. Gould, A. Conn, 1984 .

A Filter-Trust-Region Method for Unconstrained Optimization

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

Improving the Decomposition of Partially Separable Functions in the Context of Large-Scale Optimization: a First Approach·

P. Toint, N. Gould, A. Conn, 1993 .

An exact penalty function for semi-infinite programming

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

Large-scale nonlinear constrained optimization

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

RAL-TR-96-042 Methods for Nonlinear Constraints inOptimization

P. Toint, N. Gould, R. Conn, 2007 .

RAL-TR-1999-055 SQP methods for large-scalenonlinear programming 1

P. Toint, N. Gould, 1999 .

Optimal Well Placement

N. Gould, C. Farmer, J. Fowkes, 2010 .

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

P. Toint, N. Gould, A. Conn, 1992 .

A Quadratic Programming Bibliography

P. Toint, N. Gould, 2012 .

B033 Optimal Well Placement

N. Gould, O. University, C. Farmer, 2022 .

RAL-TR-2009-023 On the complexity of steepest descent , Newton ’ s method and regularized Newton methods for nonconvex unconstrained optimization

P. Toint, N. Gould, C. Cartis, 2009 .

RAL-TR-1999-041 Global convergence of trust-regionSQP-lter algorithms forgeneral nonlinear

P. Toint, N. Gould, Fletcher, 2007 .

Global Convergence ofTrust-Region SQP-Filter Algorithmsfor General Nonlinear

P. Toint, N. Gould, R. Fletcher, 1999 .

6. Global Convergence of the Basic Algorithm

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

RAL-TR-2008-005 Trust-region and other regularisations of linear least-squares problems

P. Toint, N. Gould, C. Cartis, 2008 .

RAL-TR-97-054 A numerical comparison between theLANCELOT and MINOS packagesfor large-scale constrained optimizationI

P. Toint, N. Gould, A. Conn, 1997 .

RAL-TR-96-096 A primal-dual algorithm for minimizinga non-convex function subject to boundand linear equality constraintsAndrew

P. Toint, N. Gould, R. Conn, 1996 .

7. The Trust-Region Subproblem

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

8. Further Convergence Theory Issues

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

12. Projection Methods for Convex Constraints

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

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

P. Toint, N. Gould, C. Cartis, 2016, Mathematical Programming.

RAL-TR-2007-007 Adaptive cubic overestimation methods for unconstrained optimization

P. Toint, N. Gould, C. Cartis, 2022 .

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

N. Gould, C. Cartis, J. Fowkes, 2014, Journal of Global Optimization.

Numerical methods for large-scale nonlinear optimization

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

Sensitivity of trust-region algorithms to their parameters

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

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

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

Nonlinear programming without a penalty function or a filter

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

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.

Large-scale Nonlinear Constrained Optimization: a Current Survey

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

A note on exploiting structure when using slack variables

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

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 .

Local Convergence Properties of twoAugmented Lagrangian Algorithmsfor Optimizationwith a Combination of General Equalityand Linear

P. Toint, N. Gould, A. Conn, 1993 .

Complexity bounds for second-order optimality in unconstrained optimization

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

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

P. Toint, N. Gould, A. Conn, 2013 .

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

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

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

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

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

Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization

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

Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation and Perspectives

P. Toint, N. Gould, C. Cartis, 2022 .

An adaptive regularization algorithm for unconstrained optimization with inexact function and derivatives values

N. I. M. Gould, Ph. L. Toint, P. Toint, 2021, 2111.14098.

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

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

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

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

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

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

A Primal-Dual Trust-Region Algorithmfor Minimizing a Non-convex FunctionSubject to General Inequalityand Linear Equality

N. I. M. Gould, D. Orban, Ph. L. Toint, 1999 .

RAL-TR-1999-054 A primal-dual trust-region algorithm for minimizinga non-convex function subject to general inequalityand linear equality constraintsAndrew

P. Toint, N. Gould, D. Orban, 1999 .

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.

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

P. Toint, N. Gould, D. Orban, 2013, Computational Optimization and Applications.

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

An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity

P. Toint, N. Gould, C. Cartis, 2012 .

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

P. Toint, N. Gould, C. Cartis, 2017, Foundations of Computational Mathematics.

Results from a numerical evaluation of LANCELOT B

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