Nicholas I. M. Gould

From MaRDI portal
Person:429519

Available identifiers

zbMath Open gould.nicholas-ian-markMaRDI QIDQ429519

List of research outcomes





PublicationDate of PublicationType
Approximating sparse Hessian matrices using large-scale linear least squares2024-08-02Paper
The evaluation complexity of finding high-order minimizers of nonconvex optimization2024-03-22Paper
Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation and Perspectives2022-09-02Paper
An adaptive regularization algorithm for unconstrained optimization with inexact function and derivatives values2021-11-28Paper
Strong Evaluation Complexity of An Inexact Trust-Region Algorithm for Arbitrary-Order Unconstrained Nonconvex Optimization2020-11-02Paper
WORST-CASE EVALUATION COMPLEXITY AND OPTIMALITY OF SECOND-ORDER METHODS FOR NONCONVEX SMOOTH OPTIMIZATION2020-09-22Paper
On monotonic estimates of the norm of the minimizers of regularized quadratic functions in Krylov spaces2020-08-17Paper
Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints2020-02-25Paper
Error estimates for iterative algorithms for minimizing regularized quadratic subproblems2020-01-21Paper
Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled KKT conditions and high-order models2019-11-20Paper
Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems2019-06-13Paper
The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems2018-02-05Paper
A dual gradient-projection method for large-scale strictly convex quadratic problems2017-07-28Paper
A Note on Performance Profiles for Benchmarking Software2017-06-30Paper
An interior-point trust-funnel algorithm for nonlinear optimization2017-02-03Paper
A fast method for binary programming using first-order derivatives, with application to topology optimization with buckling constraints2016-12-30Paper
Adaptive augmented Lagrangian methods: algorithms and practical numerical experience2016-06-10Paper
A Nonmonotone Filter SQP Method: Local Convergence and Numerical Results2015-10-01Paper
CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization2015-07-01Paper
On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods2015-05-27Paper
Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties2015-03-24Paper
A Filter Method with Unified Step Computation for Nonlinear Optimization2014-06-19Paper
On the complexity of finding first-order critical points in constrained nonlinear optimization2014-06-02Paper
On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization2013-12-13Paper
A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions2013-08-07Paper
Trajectory-following methods for large-scale degenerate convex quadratic programming2013-08-05Paper
A note about the complexity of minimizing Nesterov's smooth Chebyshev–Rosenbrock function2013-06-24Paper
On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization2012-08-22Paper
How good are extrapolated bi-projection methods for linear feasibility problems?2012-06-19Paper
Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization2012-05-23Paper
A second-derivative SQP method with a `trust-region-free' predictor step2012-05-04Paper
On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming2012-03-16Paper
Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity2011-12-14Paper
Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results2011-05-11Paper
Preconditioning Saddle-Point Systems with Applications in Optimization2011-03-02Paper
A Second Derivative SQP Method: Global Convergence2010-12-03Paper
A Second Derivative SQP Method: Local Convergence and Practical Issues2010-12-03Paper
Spectral Analysis of Saddle Point Matrices with Indefinite Leading Blocks2010-08-19Paper
On solving trust-region and other regularised subproblems in optimization2010-06-21Paper
A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations2008-12-21Paper
How good are projection methods for convex feasibility problems?2008-05-13Paper
Using constraint preconditioners with regularized saddle-point problems2007-08-27Paper
https://portal.mardi4nfdi.de/entity/Q53938302006-10-24Paper
https://portal.mardi4nfdi.de/entity/Q54935732006-10-23Paper
Implicit-Factorization Preconditioning and Iterative Solvers for Regularized Saddle-Point Systems2006-05-31Paper
On the Convergence of Successive Linear-Quadratic Programming Algorithms2006-05-30Paper
Sensitivity of trust-region algorithms to their parameters2006-03-09Paper
A numerical evaluation of HSL packages for the direct solution of large sparse, symmetric linear systems of equations2005-07-22Paper
GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization2005-07-21Paper
CUTEr and SifDec2005-07-21Paper
A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares2005-02-23Paper
An algorithm for nonlinear optimization using linear programming and equality constrained subproblems2005-01-03Paper
https://portal.mardi4nfdi.de/entity/Q44291322003-09-24Paper
An iterative working-set method for large-scale nonconvex quadratic programming2003-03-10Paper
Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming2003-01-05Paper
Componentwise fast convergence in the solution of full-rank systems of nonlinear equations2002-12-01Paper
On the solution of equality constrained quadratic programming problems arising in optimization2002-04-15Paper
Subspace-by-subspace preconditioners for structured linear systems2001-12-19Paper
A primal-dual trust-region algorithm for non-convex nonlinear programming2001-09-10Paper
https://portal.mardi4nfdi.de/entity/Q47625162001-07-08Paper
Superlinear convergence of primal-dual interior point algorithms for nonlinear programming2001-06-21Paper
SQP methods for large-scale nonlinear programming2001-05-06Paper
https://portal.mardi4nfdi.de/entity/Q47625112001-02-22Paper
A note on the convergence of barrier algorithms to second-order necessary points2001-02-09Paper
Constraint Preconditioning for Indefinite Linear Systems2000-10-19Paper
Trust Region Methods2000-10-10Paper
https://portal.mardi4nfdi.de/entity/Q49454182000-08-24Paper
https://portal.mardi4nfdi.de/entity/Q49454172000-06-07Paper
Solving the Trust-Region Subproblem using the Lanczos Method1999-11-24Paper
On Modified Factorizations for Large-Scale Linearly Constrained Optimization1999-11-24Paper
Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques1998-05-12Paper
https://portal.mardi4nfdi.de/entity/Q43587121998-02-25Paper
Element-by-Element Preconditioners for Large Partially Separable Optimization Problems1998-02-10Paper
A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds1991-01-01Paper
An Algorithm for Large-Scale Quadratic Programming1991-01-01Paper
New crash procedures for large systems of linear constraints1989-01-01Paper
On the Convergence of a Sequential Penalty Function Method for Constrained Minimization1989-01-01Paper
Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables1988-01-01Paper
An exact penalty function for semi-infinite programming1987-01-01Paper
On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions1986-01-01Paper
On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem1985-01-01Paper
A weighted gram-schmidt method for convex quadratic programming1984-01-01Paper
On the Location of Directions of Infinite Descent for Nonlinear Programming Algorithms1984-01-01Paper

Research outcomes over time

This page was built for person: Nicholas I. M. Gould