![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Jonathan Gillard 0002
Person information
- affiliation: Cardiff University, School of Mathematics, UK
Other persons with the same name
- Jonathan Gillard 0001 (aka: Jonathan H. Gillard) — University of Cambridge, Department of Radiology, UK
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j16]Jonathan Gillard
, Emily O'Riordan
, Anatoly Zhigljavsky:
Polynomial whitening for high-dimensional data. Comput. Stat. 38(3): 1427-1461 (2023) - [j15]Jonathan Gillard:
Review on the book Yaroslav D. Sergeyev, Renato De Leone (Eds.) Numerical infinities and infinitesimals in optimization. Optim. Lett. 17(2): 511-513 (2023) - [j14]Jonathan Gillard, Vincent A. Knight, Henry Wilde:
A novel initialisation based on hospital-resident assignment for the k-modes algorithm. Soft Comput. 27(14): 9441-9457 (2023) - 2022
- [i5]Jonathan Gillard, Konstantin Usevich:
Hankel low-rank approximation and completion in time series analysis and forecasting: a brief review. CoRR abs/2206.05103 (2022) - 2021
- [j13]Antanas Zilinskas
, Jonathan Gillard, Megan Scammell, Anatoly Zhigljavsky:
Multistart with early termination of descents. J. Glob. Optim. 79(2): 447-462 (2021) - 2020
- [j12]Henry Wilde
, Vincent A. Knight, Jonathan Gillard:
Evolutionary dataset optimisation: learning algorithm quality through evolution. Appl. Intell. 50(4): 1172-1191 (2020) - [j11]Henry Wilde
, Vincent A. Knight
, Jonathan W. Gillard
:
Matching: A Python library for solving matching games. J. Open Source Softw. 5(48): 2169 (2020) - [i4]Henry Wilde, Vincent A. Knight, Jonathan W. Gillard:
A novel initialisation based on hospital-resident assignment for the k-modes algorithm. CoRR abs/2002.02701 (2020)
2010 – 2019
- 2019
- [j10]Jonathan W. Gillard
:
Deterministic global optimization: an introduction to the diagonal approach. Optim. Methods Softw. 34(1): 218-219 (2019) - [i3]Vincent A. Knight, Marc Harper, Nikoleta E. Glynatsi, Jonathan W. Gillard:
Recognising and evaluating the effectiveness of extortion in the Iterated Prisoner's Dilemma. CoRR abs/1904.00973 (2019) - [i2]Henry Wilde, Vincent A. Knight, Jonathan W. Gillard:
Evolutionary Dataset Optimisation: learning algorithm quality through evolution. CoRR abs/1907.13508 (2019) - 2018
- [j9]Jonathan Gillard, Anatoly Zhigljavsky
:
Optimal estimation of direction in regression models with large number of parameters. Appl. Math. Comput. 318: 281-289 (2018) - [i1]Jonathan Gillard, Konstantin Usevich:
Structured low-rank matrix completion for forecasting in time series analysis. CoRR abs/1802.08242 (2018) - 2017
- [j8]Julie Leanne Vile, Jonathan W. Gillard, Paul R. Harper, Vincent A. Knight:
A Queueing Theoretic Approach to Set Staffing Levels in Time-Dependent Dual-Class Service Systems. Decis. Sci. 48(4): 766-794 (2017) - [c2]Jonathan Gillard, Anatoly A. Zhigljavsky
:
Global Optimization Challenges in Structured Low Rank Approximation. LION 2017: 326-330 - 2016
- [j7]Dafydd Evans, Jonathan Gillard:
Difference-based Methods for Truncating the Singular Value Decomposition. Commun. Stat. Simul. Comput. 45(3): 863-879 (2016) - [j6]Jonathan Gillard, Anatoly A. Zhigljavsky
:
Weighted norms in subspace-based methods for time series analysis. Numer. Linear Algebra Appl. 23(5): 947-967 (2016) - [p1]Gareth Davies, Jonathan Gillard, Anatoly Zhigljavsky
:
Comparative Study of Different Penalty Functions and Algorithms in Survey Calibration. Advances in Stochastic and Deterministic Global Optimization 2016: 87-127 - 2015
- [j5]Jonathan W. Gillard, Anatoly A. Zhigljavsky
:
Stochastic algorithms for solving structured low-rank matrix approximation problems. Commun. Nonlinear Sci. Numer. Simul. 21(1-3): 70-88 (2015) - 2014
- [j4]Jonathan W. Gillard, Vincent A. Knight:
Using Singular Spectrum Analysis to obtain staffing level requirements in emergency units. J. Oper. Res. Soc. 65(5): 735-746 (2014) - 2013
- [j3]Jonathan Gillard, Anatoly A. Zhigljavsky
:
Optimization challenges in the structured low rank approximation problem. J. Glob. Optim. 57(3): 733-751 (2013) - [c1]Paul R. Harper, Jonathan W. Gillard, Vincent A. Knight, Leanne Smith, Julie Leanne Vile, Janet E. Williams:
Emergency Medical Services Modelling. SIMULTECH 2013: 549-555 - 2012
- [j2]Julie Leanne Vile, Jonathan W. Gillard, Paul R. Harper, Vincent A. Knight:
Predicting ambulance demand using singular spectrum analysis. J. Oper. Res. Soc. 63(11): 1556-1565 (2012) - 2011
- [j1]Jonathan Gillard, Anatoly A. Zhigljavsky:
Analysis of Structured Low Rank Approximation as an Optimization Problem. Informatica 22(4): 489-505 (2011)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.
last updated on 2024-04-24 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint