According to our database1, Mirjam Dür authored at least 24 papers between 1996 and 2017.
Legend:Book In proceedings Article PhD thesis Other
Genericity Results in Linear Conic Programming - A Tour d'Horizon.
Math. Oper. Res., 2017
Cutting planes for semidefinite relaxations based on triangle-free subgraphs.
Optimization Letters, 2016
A copositive formulation for the stability number of infinite graphs.
Math. Program., 2016
First order solutions in conic programming.
Math. Meth. of OR, 2015
Factorization and cutting planes for completely positive matrices by copositive projection.
Math. Program., 2014
Scaling relationship between the copositive cone and Parrilo's first level approximation.
Optimization Letters, 2013
Testing copositivity with the help of difference-of-convex optimization.
Math. Program., 2013
Copositive Programming via Semi-Infinite Optimization.
J. Optimization Theory and Applications, 2013
Distance dependency and minimum amino acid alphabets for decoy scoring potentials.
Journal of Computational Chemistry, 2013
Linear-Time Complete Positivity Detection and Decomposition of Sparse Matrices.
SIAM J. Matrix Analysis Applications, 2012
An improved algorithm to test copositivity.
J. Global Optimization, 2012
Depth-first simplicial partition for copositivity detection, with an application to MaxClique.
Optimization Methods and Software, 2011
An Adaptive Linear Approximation Algorithm for Copositive Programs.
SIAM Journal on Optimization, 2009
Copositive Lyapunov functions for switched systems over cones.
Systems & Control Letters, 2009
Special issue dedicated to the EURO Summer Institute ESI XXIV: Optimization challenges in engineering - methods, software, and applications.
Math. Meth. of OR, 2008
Challenges of Continuous Optimization in Theory and Applications.
European Journal of Operational Research, 2007
Solving fractional problems with dynamic multistart improving hit-and-run.
Annals OR, 2007
Math. Meth. of OR, 2005
Matching Stochastic Algorithms to Objective Function Landscapes.
J. Global Optimization, 2005
A parametric characterization of local optimality.
Math. Meth. of OR, 2003
A class of problems where dual bounds beat underestimation bounds.
J. Global Optimization, 2002
Dual bounding procedures lead to convergent Branch-and-Bound algorithms.
Math. Program., 2001
On Copositive Programming and Standard Quadratic Optimization Problems.
J. Global Optimization, 2000
Lagrange-Duality and Partitioning Techniques in Nonconvex Global Optimization
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996