Mirjam Dür - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 23 from 23

2021

Conic optimization: A survey with special focus on copositive optimization and binary quadratic problemsMirjam Dür, Franz Rendl. ejco, 9:100021, 2021. [doi]

2017

Genericity Results in Linear Conic Programming - A Tour d'HorizonMirjam Dür, Bolor Jargalsaikhan, Georg Still. mor, 42(1):77-94, 2017. [doi]

2016

Cutting planes for semidefinite relaxations based on triangle-free subgraphsAbraham Berman, Mirjam Dür, Naomi Shaked-Monderer, Julia Witzel. ol, 10(3):433-446, 2016. [doi]

A copositive formulation for the stability number of infinite graphsCristian Dobre, Mirjam Dür, Leonhard Frerick, Frank Vallentin. mp, 160(1-2):65-83, 2016. [doi]

2015

First order solutions in conic programmingMirjam Dür, Bolor Jargalsaikhan, Georg Still. mmor, 82(2):123-142, 2015. [doi]

2014

Factorization and cutting planes for completely positive matrices by copositive projectionJulia Sponsel, Mirjam Dür. mp, 143(1-2):211-229, 2014. [doi]

2013

2012

Linear-Time Complete Positivity Detection and Decomposition of Sparse MatricesPeter J. C. Dickinson, Mirjam Dür. siammax, 33(3):701-720, 2012. [doi]

An improved algorithm to test copositivityJulia Sponsel, Stefan Bundfuss, Mirjam Dür. jgo, 52(3):537-551, 2012. [doi]

2011

Depth-first simplicial partition for copositivity detection, with an application to MaxCliqueJulius Zilinskas, Mirjam Dür. oms, 26(3):499-510, 2011. [doi]

2009

Copositive Lyapunov functions for switched systems over conesStefan Bundfuss, Mirjam Dür. scl, 58(5):342-345, 2009. [doi]

An Adaptive Linear Approximation Algorithm for Copositive ProgramsStefan Bundfuss, Mirjam Dür. siamjo, 20(1):30-53, 2009. [doi]

2008

Special issue dedicated to the EURO Summer Institute ESI XXIV: Optimization challenges in engineering - methods, software, and applicationsMirjam Dür, Petra Huhn, Kathrin Klamroth, Christiane Tammer. mmor, 68(2):207-210, 2008. [doi]

2007

Solving fractional problems with dynamic multistart improving hit-and-runMirjam Dür, Charoenchai Khompatraporn, Zelda B. Zabinsky. anor, 156(1):25-44, 2007. [doi]

Challenges of Continuous Optimization in Theory and ApplicationsMirjam Dür, Bülent Karasözen, Tamás Terlaky, Gerhard-Wilhelm Weber. eor, 181(3):1065-1068, 2007. [doi]

2005

Book ReviewMirjam Dür. mmor, 61(3):521-522, 2005. [doi]

2003

A parametric characterization of local optimalityMirjam Dür. mmor, 57(1):101-109, 2003. [doi]

2002

A class of problems where dual bounds beat underestimation boundsMirjam Dür. jgo, 22(1-4):49-57, 2002. [doi]

2001

Dual bounding procedures lead to convergent Branch-and-Bound algorithmsMirjam Dür. mp, 91(1):117-125, 2001. [doi]

2000

On Copositive Programming and Standard Quadratic Optimization ProblemsImmanuel M. Bomze, Mirjam Dür, Etienne de Klerk, Cornelis Roos, Arie J. Quist, Tamás Terlaky. jgo, 18(4):301-320, 2000. [doi]

Sign in or sign up to see more results.

runs on WebDSL