( en | de | ru )

 

Disambiguation of "Gould, Nick I. M."

Author of the publication

copydeleteadd this publication to your clipboard
Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region.

, , , and . SIAM J. Optimization, 6 (4): 1059-1086 (1996)

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

Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region., , , and . SIAM J. Optimization, 6 (4): 1059-1086 (1996)A concise second-order complexity analysis for unconstrained optimization using high-order regularized models., , and . Optim. Methods Softw., 35 (2): 243-256 (2020)Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints., , and . CoRR, (2018)Second-Order Optimality and Beyond: Characterization and Evaluation Complexity in Convexly Constrained Nonlinear Optimization., , and . Found. Comput. Math., 18 (5): 1073-1107 (2018)A Filter-Trust-Region Method for Unconstrained Optimization., , and . SIAM J. Optim., 16 (2): 341-357 (2005)Nonlinear programming: theory and practice., , and . Math. Program., 100 (1): 1-2 (2004)Evaluation complexity bounds for smooth constrained nonlinear optimisation using scaled KKT conditions, high-order models and the criticality measure $χ$., , and . CoRR, (2017)Use of the P4 and P5 Algorithms for In-Core Factorization of Sparse Matrices., , , and . SIAM J. Sci. Comput., 11 (5): 913-927 (1990)Preprocessing for quadratic programming., and . Math. Program., 100 (1): 95-132 (2004)Erratum to: Nonlinear programming without a penalty function or a filter., and . Math. Program., 131 (1-2): 403-404 (2012)