default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMirjam Dür
Person information
- affiliation: University of Augsburg, Germany
- affiliation (former): University of Trier, Department of Mathematics, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j24]Mirjam Dür, Franz Rendl:
Conic optimization: A survey with special focus on copositive optimization and binary quadratic problems. EURO J. Comput. Optim. 9: 100021 (2021)- 2017
- [j23]Mirjam Dür, Bolor Jargalsaikhan, Georg Still:
Genericity Results in Linear Conic Programming - A Tour d'Horizon. Math. Oper. Res. 42(1): 77-94 (2017) - 2016
- [j22]Cristian Dobre, Mirjam Dür, Leonhard Frerick, Frank Vallentin:
A copositive formulation for the stability number of infinite graphs. Math. Program. 160(1-2): 65-83 (2016) - [j21]Abraham Berman, Mirjam Dür, Naomi Shaked-Monderer
, Julia Witzel:
Cutting planes for semidefinite relaxations based on triangle-free subgraphs. Optim. Lett. 10(3): 433-446 (2016) - 2015
- [j20]Mirjam Dür, Bolor Jargalsaikhan, Georg Still:
First order solutions in conic programming. Math. Methods Oper. Res. 82(2): 123-142 (2015) - 2014
- [j19]Julia Sponsel, Mirjam Dür:
Factorization and cutting planes for completely positive matrices by copositive projection. Math. Program. 143(1-2): 211-229 (2014) - 2013
- [j18]Susanne Pape, Franziska Hoffgaard, Mirjam Dür, Kay Hamacher:
Distance dependency and minimum amino acid alphabets for decoy scoring potentials. J. Comput. Chem. 34(1): 10-20 (2013) - [j17]Faizan Ahmed, Mirjam Dür, Georg Still:
Copositive Programming via Semi-Infinite Optimization. J. Optim. Theory Appl. 159(2): 322-340 (2013) - [j16]Mirjam Dür, Jean-Baptiste Hiriart-Urruty:
Testing copositivity with the help of difference-of-convex optimization. Math. Program. 140(1): 31-43 (2013) - [j15]Peter J. C. Dickinson, Mirjam Dür, Luuk Gijben, Roland Hildebrand:
Scaling relationship between the copositive cone and Parrilo's first level approximation. Optim. Lett. 7(8): 1669-1679 (2013) - 2012
- [j14]Julia Sponsel, Stefan Bundfuss, Mirjam Dür:
An improved algorithm to test copositivity. J. Glob. Optim. 52(3): 537-551 (2012) - [j13]Peter J. C. Dickinson, Mirjam Dür:
Linear-Time Complete Positivity Detection and Decomposition of Sparse Matrices. SIAM J. Matrix Anal. Appl. 33(3): 701-720 (2012) - 2011
- [j12]Julius Zilinskas, Mirjam Dür:
Depth-first simplicial partition for copositivity detection, with an application to MaxClique. Optim. Methods Softw. 26(3): 499-510 (2011) - 2009
- [j11]Stefan Bundfuss, Mirjam Dür:
Copositive Lyapunov functions for switched systems over cones. Syst. Control. Lett. 58(5): 342-345 (2009) - [j10]Stefan Bundfuss, Mirjam Dür:
An Adaptive Linear Approximation Algorithm for Copositive Programs. SIAM J. Optim. 20(1): 30-53 (2009) - 2008
- [j9]Mirjam Dür, Petra Huhn, Kathrin Klamroth, Christiane Tammer:
Special issue dedicated to the EURO Summer Institute ESI XXIV: Optimization challenges in engineering - methods, software, and applications. Math. Methods Oper. Res. 68(2): 207-210 (2008) - 2007
- [j8]Mirjam Dür, Charoenchai Khompatraporn, Zelda B. Zabinsky:
Solving fractional problems with dynamic multistart improving hit-and-run. Ann. Oper. Res. 156(1): 25-44 (2007) - [j7]Mirjam Dür, Bülent Karasözen, Tamás Terlaky, Gerhard-Wilhelm Weber:
Challenges of Continuous Optimization in Theory and Applications. Eur. J. Oper. Res. 181(3): 1065-1068 (2007) - 2005
- [j6]William Baritompa, Mirjam Dür, Eligius M. T. Hendrix, Lyle Noakes, Wayne J. Pullan, Graham R. Wood:
Matching Stochastic Algorithms to Objective Function Landscapes. J. Glob. Optim. 31(4): 579-598 (2005) - [j5]Mirjam Dür:
Book Review. Math. Methods Oper. Res. 61(3): 521-522 (2005) - 2003
- [j4]Mirjam Dür:
A parametric characterization of local optimality. Math. Methods Oper. Res. 57(1): 101-109 (2003) - 2002
- [j3]Mirjam Dür:
A class of problems where dual bounds beat underestimation bounds. J. Glob. Optim. 22(1-4): 49-57 (2002) - 2001
- [j2]Mirjam Dür:
Dual bounding procedures lead to convergent Branch-and-Bound algorithms. Math. Program. 91(1): 117-125 (2001) - 2000
- [j1]Immanuel M. Bomze, Mirjam Dür, Etienne de Klerk, Cornelis Roos, Arie J. Quist, Tamás Terlaky:
On Copositive Programming and Standard Quadratic Optimization Problems. J. Glob. Optim. 18(4): 301-320 (2000)
Informal and Other Publications
- 1996
- [i1]Mirjam Dür, Reiner Horst:
Lagrange-Duality and Partitioning Techniques in Nonconvex Global Optimization. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-38 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
