Mirjam Dür

According to our database, Mirjam Dür authored at least 25 papers between 1996 and 2021.

Collaborative distances:

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

2021

Conic optimization: A survey with special focus on copositive optimization and binary quadratic problems.

Mirjam Dür, Franz Rendl

EURO J. Comput. Optim., 2021

2017

Genericity Results in Linear Conic Programming - A Tour d'Horizon.

Mirjam Dür, Bolor Jargalsaikhan, Georg Still

Math. Oper. Res., 2017

2016

Cutting planes for semidefinite relaxations based on triangle-free subgraphs.

Abraham Berman, Mirjam Dür, Naomi Shaked-Monderer, Julia Witzel

Optim. Lett., 2016

A copositive formulation for the stability number of infinite graphs.

Cristian Dobre, Mirjam Dür, Leonhard Frerick, Frank Vallentin

Math. Program., 2016

2015

First order solutions in conic programming.

Mirjam Dür, Bolor Jargalsaikhan, Georg Still

Math. Methods Oper. Res., 2015

2014

Factorization and cutting planes for completely positive matrices by copositive projection.

Julia Sponsel, Mirjam Dür

Math. Program., 2014

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

Testing copositivity with the help of difference-of-convex optimization.

Mirjam Dür, Jean-Baptiste Hiriart-Urruty

Math. Program., 2013

Copositive Programming via Semi-Infinite Optimization.

Faizan Ahmed, Mirjam Dür, Georg Still

J. Optim. Theory Appl., 2013

Distance dependency and minimum amino acid alphabets for decoy scoring potentials.

Susanne Pape, Franziska Hoffgaard, Mirjam Dür, Kay Hamacher

J. Comput. Chem., 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

An improved algorithm to test copositivity.

Julia Sponsel, Stefan Bundfuss, Mirjam Dür

J. Glob. Optim., 2012

2011

Depth-first simplicial partition for copositivity detection, with an application to MaxClique.

Julius Zilinskas, Mirjam Dür

Optim. Methods Softw., 2011

2009

An Adaptive Linear Approximation Algorithm for Copositive Programs.

Stefan Bundfuss, Mirjam Dür

SIAM J. Optim., 2009

Copositive Lyapunov functions for switched systems over cones.

Stefan Bundfuss, Mirjam Dür

Syst. Control. Lett., 2009

2008

Special issue dedicated to the EURO Summer Institute ESI XXIV: Optimization challenges in engineering - methods, software, and applications.

Mirjam Dür, Petra Huhn, Kathrin Klamroth, Christiane Tammer

Math. Methods Oper. Res., 2008

2007

Challenges of Continuous Optimization in Theory and Applications.

Mirjam Dür, Bülent Karasözen, Tamás Terlaky, Gerhard-Wilhelm Weber

Eur. J. Oper. Res., 2007

Solving fractional problems with dynamic multistart improving hit-and-run.

Mirjam Dür, Charoenchai Khompatraporn, Zelda B. Zabinsky

Ann. Oper. Res., 2007

2005

Book Review.

Mirjam Dür

Math. Methods Oper. Res., 2005

Matching Stochastic Algorithms to Objective Function Landscapes.

William Baritompa, Mirjam Dür, Eligius M. T. Hendrix, Lyle Noakes, Wayne J. Pullan, Graham R. Wood

J. Glob. Optim., 2005

2003

A parametric characterization of local optimality.

Mirjam Dür

Math. Methods Oper. Res., 2003

2002

A class of problems where dual bounds beat underestimation bounds.

Mirjam Dür

J. Glob. Optim., 2002

2001

Dual bounding procedures lead to convergent Branch-and-Bound algorithms.

Mirjam Dür

Math. Program., 2001

2000

On Copositive Programming and Standard Quadratic Optimization Problems.

Immanuel M. Bomze, Mirjam Dür, Etienne de Klerk, Cornelis Roos, Arie J. Quist, Tamás Terlaky

J. Glob. Optim., 2000

1996

Lagrange-Duality and Partitioning Techniques in Nonconvex Global Optimization

Mirjam Dür, Reiner Horst

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996