default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter J. C. Dickinson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j12]Peter J. C. Dickinson
, Reinier de Zeeuw:
Generating irreducible copositive matrices using the stable set problem. Discret. Appl. Math. 296: 103-117 (2021)- [j11]Andrey Afonin, Roland Hildebrand, Peter J. C. Dickinson:
The extreme rays of the 6˟ 6 copositive cone. J. Glob. Optim. 79(1): 153-190 (2021) - 2019
- [j10]Immanuel M. Bomze, Jianqiang Cheng, Peter J. C. Dickinson, Abdel Lisser, Jia Liu:
Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches. Comput. Manag. Sci. 16(4): 593-619 (2019) - [j9]Peter J. C. Dickinson, Janez Povh:
A new approximation hierarchy for polynomial conic optimization. Comput. Optim. Appl. 73(1): 37-67 (2019) - 2017
- [j8]Immanuel M. Bomze, Jianqiang Cheng, Peter J. C. Dickinson, Abdel Lisser:
A fresh CP look at mixed-binary QPs: new formulations and relaxations. Math. Program. 166(1-2): 159-184 (2017) - 2015
- [j7]Peter J. C. Dickinson, Janez Povh:
On an extension of Pólya's Positivstellensatz. J. Glob. Optim. 61(4): 615-625 (2015) - 2014
- [j6]Peter J. C. Dickinson, Luuk Gijben:
On the computational complexity of membership problems for the completely positive cone and its dual. Comput. Optim. Appl. 57(2): 403-415 (2014) - [j5]Peter J. C. Dickinson:
On the exhaustivity of simplicial partitioning. J. Glob. Optim. 58(1): 189-203 (2014) - 2013
- [j4]Peter J. C. Dickinson, Janez Povh:
Moment Approximations for Set-Semidefinite Polynomials. J. Optim. Theory Appl. 159(1): 57-68 (2013) - [j3]Peter J. C. Dickinson, Gabriele Eichfelder, Janez Povh:
Erratum to: On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets. Optim. Lett. 7(6): 1387-1397 (2013) - [j2]Peter J. C. Dickinson, Mirjam Dür, Luuk Gijben, Roland Hildebrand:
Scaling relationship between the copositive cone and Parrilo's first level approximation. Optim. Lett. 7(8): 1669-1679 (2013) - 2012
- [j1]Peter J. C. Dickinson, Mirjam Dür:
Linear-Time Complete Positivity Detection and Decomposition of Sparse Matrices. SIAM J. Matrix Anal. Appl. 33(3): 701-720 (2012)
Coauthor Index
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 23:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
