Peter J. C. Dickinson

According to our database, Peter J. C. Dickinson authored at least 12 papers between 2012 and 2021.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2021

The extreme rays of the 6˟ 6 copositive cone.

Andrey Afonin, Roland Hildebrand, Peter J. C. Dickinson

J. Glob. Optim., 2021

Generating irreducible copositive matrices using the stable set problem.

Peter J. C. Dickinson, Reinier de Zeeuw

Discret. Appl. Math., 2021

2019

A new approximation hierarchy for polynomial conic optimization.

Peter J. C. Dickinson, Janez Povh

Comput. Optim. Appl., 2019

Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches.

Immanuel M. Bomze, Jianqiang Cheng, Peter J. C. Dickinson, Abdel Lisser, Jia Liu

Comput. Manag. Sci., 2019

2017

A fresh CP look at mixed-binary QPs: new formulations and relaxations.

Immanuel M. Bomze, Jianqiang Cheng, Peter J. C. Dickinson, Abdel Lisser

Math. Program., 2017

2015

On an extension of Pólya's Positivstellensatz.

Peter J. C. Dickinson, Janez Povh

J. Glob. Optim., 2015

2014

On the exhaustivity of simplicial partitioning.

Peter J. C. Dickinson

J. Glob. Optim., 2014

On the computational complexity of membership problems for the completely positive cone and its dual.

Peter J. C. Dickinson, Luuk Gijben

Comput. Optim. Appl., 2014

2013

Erratum to: On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets.

Peter J. C. Dickinson, Gabriele Eichfelder, Janez Povh

Optim. Lett., 2013

Scaling relationship between the copositive cone and Parrilo's first level approximation.

Peter J. C. Dickinson, Mirjam Dür, Luuk Gijben, Roland Hildebrand

Optim. Lett., 2013

Moment Approximations for Set-Semidefinite Polynomials.

Peter J. C. Dickinson, Janez Povh

J. Optim. Theory Appl., 2013

2012

Linear-Time Complete Positivity Detection and Decomposition of Sparse Matrices.

Peter J. C. Dickinson, Mirjam Dür

SIAM J. Matrix Anal. Appl., 2012