( en | de | ru )

 

Disambiguation of "Gould, Nicholas I. M."

Author of the publication

copydeleteadd this publication to your clipboard
A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions.

, , and . J. Glob. Optim., 56 (4): 1791-1815 (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

I M Bogenrieder

William Owen Goulden

Darren Gould

Cassandra Gould

Ulla I M Gerling

 

Other publications of authors with the same name

An algorithm for nonlinear optimization using linear programming and equality constrained subproblems., , , and . Math. Program., 100 (1): 27-48 (2004)On solving trust-region and other regularised subproblems in optimization., , and . Math. Program. Comput., 2 (1): 21-57 (2010)A weighted gram-schmidt method for convex quadratic programming., , , , and . Math. Program., 30 (2): 176-195 (1984)GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization., , and . ACM Trans. Math. Softw., 29 (4): 353-372 (2003)Improved second-order evaluation complexity for unconstrained nonlinear optimization using high-order regularized models., , and . CoRR, (2017)Adaptive augmented Lagrangian methods: algorithms and practical numerical experience., , , and . Optim. Methods Softw., 31 (1): 157-186 (2016)Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties., , and . J. Glob. Optim., 61 (3): 429-457 (2015)A Second Derivative SQP Method: Local Convergence and Practical Issues., and . SIAM J. Optimization, 20 (4): 2049-2079 (2010)On the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization., , and . SIAM J. Optimization, 23 (3): 1553-1574 (2013)Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints., , and . SIAM J. Optimization, 30 (1): 513-541 (2020)