Mirjam Dür
Mirjam Dür
Professor of Mathematical Optimization, University of Augsburg, Germany
Ingen verifierad e-postadress - Startsida
Titel
Citeras av
Citeras av
År
Copositive programming–a survey
M Dür
Recent Advances in Optimization and its Applications in Engineering, 3-20, 2010
2112010
On copositive programming and standard quadratic optimization problems
IM Bomze, M Dür, E De Klerk, C Roos, AJ Quist, T Terlaky
Journal of Global Optimization 18 (4), 301-320, 2000
1862000
An adaptive linear approximation algorithm for copositive programs
S Bundfuss, M Dür
SIAM Journal on Optimization 20 (1), 30-53, 2010
802010
Algorithmic copositivity detection by simplicial partition
S Bundfuss, M Dür
Linear Algebra and its Applications 428 (7), 1511-1523, 2008
762008
Interior points of the completely positive cone
M Dür, G Still
Electronic Journal of Linear Algebra 17, 48-53, 2008
512008
Solving sum-of-ratios fractional programs using efficient points
M Dür, R Horst, NV Thoai
Optimization 49, 447-466, 2001
502001
The difference between 5× 5 doubly nonnegative and completely positive matrices
S Burer, KM Anstreicher, M Dür
Linear Algebra and its Applications 431 (9), 1539-1552, 2009
442009
Necessary and sufficient global optimality conditions for convex maximization revisited
M Dür, R Horst, M Locatelli
Journal of Mathematical Analysis and Applications 217 (2), 637-649, 1998
431998
Lagrange duality and partitioning techniques in nonconvex global optimization
M Dür, R Horst
Journal of Optimization Theory and Applications 95 (2), 347-369, 1997
361997
Open problems in the theory of completely positive and copositive matrices
A Berman, M Dur, N Shaked-Monderer
Electronic Journal of Linear Algebra 29 (1), 46-58, 2015
342015
Irreducible elements of the copositive cone
PJC Dickinson, M Dür, L Gijben, R Hildebrand
Linear Algebra and its Applications 439, 1605-1626, 2013
322013
Copositive Lyapunov functions for switched systems over cones
S Bundfuss, M Dür
Systems & Control Letters 58 (5), 342-345, 2009
322009
An improved algorithm to test copositivity
J Sponsel, S Bundfuss, M Dür
Journal of Global Optimization 52, 537-551, 2012
292012
Depth-first simplicial partition for copositivity detection, with an application to MaxClique
J Žilinskas, M Dür
Optimization Methods and Software 26 (3), 499-510, 2011
262011
Dual bounding procedures lead to convergent Branch–and–Bound algorithms
M Dür
Mathematical programming 91 (1), 117-125, 2001
222001
Linear-time complete positivity detection and decomposition of sparse matrices
PJC Dickinson, M Dür
SIAM Journal on Matrix Analysis and Applications 33 (3), 701-720, 2012
202012
Genericity results in linear conic programming - a tour d’horizon
M Dür, B Jargalsaikhan, G Still
Mathematics of Operations Research 42 (2), 77-94, 2017
192017
A parametric characterization of local optimality
M Dür
Mathematical Methods of Operations Research 57 (1), 101-109, 2003
182003
A class of problems where dual bounds beat underestimation bounds
M Dür
Journal of Global Optimization 22 (1-4), 49-57, 2002
172002
Copositive Programming via Semi-Infinite Optimization
F Ahmed, M Dür, G Still
Journal of Optimization Theory and Applications 159, 322-340, 2013
162013
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20