Mirjam Dür

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Obituary for Georg J. Still (13 November 1951–15 December 2023)	2024-10-14	Paper
Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems	2023-07-12	Paper
https://portal.mardi4nfdi.de/entity/Q5146244	2021-01-25	Paper
A factorization method for completely positive matrices	2020-04-21	Paper
Genericity Results in Linear Conic Programming—A Tour d’Horizon	2017-04-13	Paper
A copositive formulation for the stability number of infinite graphs	2016-11-25	Paper
Cutting planes for semidefinite relaxations based on triangle-free subgraphs	2016-04-29	Paper
SPN completable graphs	2016-04-18	Paper
First order solutions in conic programming	2015-11-09	Paper
Open problems in the theory of completely positive and copositive matrices	2015-10-23	Paper
Factorization and cutting planes for completely positive matrices by copositive projection	2014-02-25	Paper
Irreducible elements of the copositive cone	2014-02-19	Paper
Copositive programming via semi-infinite optimization	2014-02-03	Paper
Scaling relationship between the copositive cone and Parrilo's first level approximation	2014-01-30	Paper
Testing copositivity with the help of difference-of-convex optimization	2013-08-12	Paper
Linear-Time Complete Positivity Detection and Decomposition of Sparse Matrices	2013-01-18	Paper
An improved algorithm to test copositivity	2012-06-13	Paper
Depth-first simplicial partition for copositivity detection, with an application to MaxClique	2011-10-12	Paper
An Adaptive Linear Approximation Algorithm for Copositive Programs	2010-03-17	Paper
Packing solar cells on a roof	2009-12-02	Paper
The difference between \(5\times 5\) doubly nonnegative and completely positive matrices	2009-09-14	Paper
Copositive Lyapunov functions for switched systems over cones	2009-04-30	Paper
https://portal.mardi4nfdi.de/entity/Q3497912	2008-05-28	Paper
Algorithmic copositivity detection by simplicial partition	2008-03-14	Paper
Solving fractional problems with dynamic multistart improving hit-and-run	2008-01-25	Paper
Matching stochastic algorithms to objective function landscapes	2006-02-08	Paper
Probabilistic subproblem selection in branch-and-bound algorithms	2005-06-30	Paper
A class of problems where dual bounds beat underestimation bounds	2004-08-12	Paper
A parametric characterization of local optimality	2003-06-26	Paper
Solving sum-of-ratios fractional programs using efficient points	2002-07-30	Paper
Conditions characterizing minima of the difference of functions	2002-05-29	Paper
Dual bounding procedures lead to convergent branch-and-bound algorithms	2002-05-27	Paper
On copositive programming and standard quadratic optimization problems	2001-04-17	Paper
Necessary and sufficient global optimality conditions for convex maximization revisited	1999-04-13	Paper
Lagrange duality and partitioning techniques in nonconvex global optimization	1998-07-15	Paper

Research outcomes over time

This page was built for person: Mirjam Dür