default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Likely matches
- Nicholas I. M. Gould
aka: Nicholas Ian Mark Gould, Nick I. M. Gould
Scientific Computing Department, Rutherford Appleton Laboratory, UK
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 110 matches
- 2024
- Jaroslav M. Fowkes, Nicholas I. M. Gould, Jennifer A. Scott:
Approximating sparse Hessian matrices using large-scale linear least squares. Numer. Algorithms 96(4): 1675-1698 (2024) - 2023
- Jaroslav M. Fowkes, Nicholas I. M. Gould:
GALAHAD 4.0: an open source library of Fortran packages with C and Matlab interfaces for continuous optimization. J. Open Source Softw. 8(87): 4882 (2023) - 2021
- Sameera Ramasinghe, Kanchana Nisal Ranasinghe, Salman H. Khan, Nick Barnes, Stephen Gould:
Conditional Generative Modeling via Learning the Latent Space. ICLR 2021 - Sameera Ramasinghe, Moshiur R. Farazi, Salman H. Khan, Nick Barnes, Stephen Gould:
Rethinking conditional GAN training: An approach using geometrically structured latent manifolds. NeurIPS 2021: 19487-19499 - 2020
- Sameera Ramasinghe, Salman H. Khan, Nick Barnes, Stephen Gould:
Representation Learning on Unit Ball with 3D Roto-translational Equivariance. Int. J. Comput. Vis. 128(6): 1612-1634 (2020) - Coralia Cartis, Nick I. M. Gould, Philippe L. Toint:
A concise second-order complexity analysis for unconstrained optimization using high-order regularized models. Optim. Methods Softw. 35(2): 243-256 (2020) - Nicholas I. M. Gould, Valeria Simoncini:
Error estimates for iterative algorithms for minimizing regularized quadratic subproblems. Optim. Methods Softw. 35(2): 304-328 (2020) - Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints. SIAM J. Optim. 30(1): 513-541 (2020) - Sameera Ramasinghe, Salman H. Khan, Nick Barnes, Stephen Gould:
Spectral-GANs for High-Resolution 3D Point-cloud Generation. IROS 2020: 8169-8176 - Sameera Ramasinghe, Salman H. Khan, Nick Barnes, Stephen Gould:
Blended Convolution and Synthesis for Efficient Discrimination of 3D Shapes. WACV 2020: 21-31 - Sameera Ramasinghe, Kanchana Ranasinghe, Salman H. Khan, Nick Barnes, Stephen Gould:
Conditional Generative Modeling via Learning the Latent Space. CoRR abs/2010.03132 (2020) - Sameera Ramasinghe, Moshiur R. Farazi, Salman H. Khan, Nick Barnes, Stephen Gould:
How to train your conditional GAN: An approach using geometrically structured latent manifolds. CoRR abs/2011.13055 (2020) - 2019
- Nicholas I. M. Gould, Tyrone Rees, Jennifer A. Scott:
Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems. Comput. Optim. Appl. 73(1): 1-35 (2019) - Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
Optimality of orders one to three and beyond: Characterization and evaluation complexity in constrained nonconvex optimization. J. Complex. 53: 68-94 (2019) - Fabio Furini, Emiliano Traversi, Pietro Belotti, Antonio Frangioni, Ambros M. Gleixner, Nick Gould, Leo Liberti, Andrea Lodi, Ruth Misener, Hans D. Mittelmann, Nikolaos V. Sahinidis, Stefan Vigerske, Angelika Wiegele:
QPLIB: a library of quadratic programming instances. Math. Program. Comput. 11(2): 237-265 (2019) - Coralia Cartis, Nick I. M. Gould, Philippe L. Toint:
Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy. SIAM J. Optim. 29(1): 595-615 (2019) - Sameera Ramasinghe, Salman H. Khan, Nick Barnes, Stephen Gould:
Blended Convolution and Synthesis for Efficient Discrimination of 3D Shapes. CoRR abs/1908.10209 (2019) - Sameera Ramasinghe, Salman H. Khan, Nick Barnes, Stephen Gould:
Representation Learning on Unit Ball with 3D Roto-Translational Equivariance. CoRR abs/1912.01454 (2019) - Sameera Ramasinghe, Salman H. Khan, Nick Barnes, Stephen Gould:
Spectral-GANs for High-Resolution 3D Point-cloud Generation. CoRR abs/1912.01800 (2019) - 2018
- Coralia Cartis, Nick I. M. Gould, Philippe L. Toint:
Second-Order Optimality and Beyond: Characterization and Evaluation Complexity in Convexly Constrained Nonlinear Optimization. Found. Comput. Math. 18(5): 1073-1107 (2018) - Coralia Cartis, Nick I. M. Gould, Philippe L. Toint:
Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints. CoRR abs/1811.01220 (2018) - 2017
- Nicholas I. M. Gould, Daniel P. Robinson:
A dual gradient-projection method for large-scale strictly convex quadratic problems. Comput. Optim. Appl. 67(1): 1-38 (2017) - Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization. Math. Program. 161(1-2): 611-626 (2017) - Frank E. Curtis, Nicholas I. M. Gould, Daniel P. Robinson, Philippe L. Toint:
An interior-point trust-funnel algorithm for nonlinear optimization. Math. Program. 161(1-2): 73-134 (2017) - Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients. Optim. Methods Softw. 32(6): 1273-1298 (2017) - Nicholas I. M. Gould, Jennifer A. Scott:
The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems. ACM Trans. Math. Softw. 43(4): 36:1-36:35 (2017) - Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization. CoRR abs/1705.07285 (2017) - Coralia Cartis, Nick I. M. Gould, Philippe L. Toint:
Evaluation complexity bounds for smooth constrained nonlinear optimisation using scaled KKT conditions, high-order models and the criticality measure $χ$. CoRR abs/1705.04895 (2017) - Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
Improved second-order evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. CoRR abs/1708.04044 (2017) - 2016
- Nicholas I. M. Gould, Christoph Ortner, D. Packwood:
A dimer-type saddle search algorithm with preconditioning and linesearch. Math. Comput. 85(302): 2939-2966 (2016)
skipping 80 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-11-02 07:30 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint