Mirjam Dür
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Mirjam Dür has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Cristian Dobre
Biometris, Wageningen University and Research Center
2 shared publications - Frank Vallentin
Universität zu Köln, Germany
2 shared publications - Leonhard Frerick
Department of Mathematics, Trier University, Trier, Germany
2 shared publications - Abraham Berman
Department of Mathematics, Technion – Israel Institute of Technology, Haifa, Israel
1 shared publication - Faizan Ahmed
University of Twente
1 shared publication - Georg Still
Department of Mathematics, University of Twente, Enschede, The Netherlands
1 shared publication
Latest Publications
- 9 January 2016
- Published by Springer Nature in Mathematical Programming
- Vol. 160 (1-2) , 65-83
A copositive formulation for the stability number of infinite graphs
- 9 January 2016
- Published by Springer Nature in Mathematical Programming
- Vol. 160 (1-2) , 65-83
A copositive formulation for the stability number of infinite graphs
- Open Access
A copositive formulation for the stability number of infinite graphs
In the last decade, copositive formulations have been proposed for a variety of combinatorial optimization problems, for example the stability number (independence number). In this paper, we generalize this approach to infinite graphs and show that the stability number of an infinite graph is the optimal solution of some infinite-dimensional copositive program. For this we develop a duality theory between the primal convex cone of copositive kernels and the dual convex cone of completely positive measures. We determine the extreme rays of the latter cone, and we illustrate this theory with the help of the kissing number problem.
Open AccessA copositive formulation for the stability number of infinite graphs
In the last decade, copositive formulations have been proposed for a variety of combinatorial optimization problems, for example the stability number (independence number). In this paper, we generalize this approach to infinite graphs and show that the stability number of an infinite graph is the optimal solution of some infinite-dimensional copositive program. For this we develop a duality theory between the primal convex cone of copositive kernels and the dual convex cone of completely positive measures. We determine the extreme rays of the latter cone, and we illustrate this theory with the help of the kissing number problem.
- 6 August 2015
- Published by Springer Nature in Optimization Letters
- Vol. 10 (3) , 433-446
Cutting planes for semidefinite relaxations based on triangle-free subgraphs
- 6 August 2015
- Published by Springer Nature in Optimization Letters
- Vol. 10 (3) , 433-446
Cutting planes for semidefinite relaxations based on triangle-free subgraphs
- 8 June 2013
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 159 (2) , 322-340
Copositive Programming via Semi-Infinite Optimization
- 8 June 2013
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 159 (2) , 322-340
Copositive Programming via Semi-Infinite Optimization
- 5 February 2013
- Published by Springer Nature in Mathematical Programming
- Vol. 140 (1) , 31-43
Testing copositivity with the help of difference-of-convex optimization
- 5 February 2013
- Published by Springer Nature in Mathematical Programming
- Vol. 140 (1) , 31-43
Testing copositivity with the help of difference-of-convex optimization
- 27 October 2012
- Published by Springer Nature in Mathematical Programming
- Vol. 143 (1-2) , 211-229
Factorization and cutting planes for completely positive matrices by copositive projection
- 27 October 2012
- Published by Springer Nature in Mathematical Programming
- Vol. 143 (1-2) , 211-229
Factorization and cutting planes for completely positive matrices by copositive projection
- 21 July 2012
- Published by Springer Nature in Optimization Letters
- Vol. 7 (8) , 1669-1679
Scaling relationship between the copositive cone and Parrilo’s first level approximation
- 21 July 2012
- Published by Springer Nature in Optimization Letters
- Vol. 7 (8) , 1669-1679
Scaling relationship between the copositive cone and Parrilo’s first level approximation