Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Mirjam Dür"'
Autor:
Mirjam Dür, Franz Rendl
Publikováno v:
EURO Journal on Computational Optimization, Vol 9, Iss , Pp 100021- (2021)
A conic optimization problem is a problem involving a constraint that the optimization variable be in some closed convex cone. Prominent examples are linear programs (LP), second order cone programs (SOCP), semidefinite problems (SDP), and copositive
Externí odkaz:
https://doaj.org/article/f136d5fba5254566a11a3a59133648da
Autor:
Franz Rendl, Mirjam Dür
Publikováno v:
EURO Journal on Computational Optimization, Vol 9, Iss, Pp 100021-(2021)
A conic optimization problem is a problem involving a constraint that the optimization variable be in some closed convex cone. Prominent examples are linear programs (LP), second order cone programs (SOCP), semidefinite problems (SDP), and copositive
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5ff151d9f24545f7e4f69af67f0e1b93
http://www.sciencedirect.com/science/article/pii/S2192440621001489
http://www.sciencedirect.com/science/article/pii/S2192440621001489
Autor:
Patrick Groetzner, Mirjam Dür
A matrix A is called completely positive, if there exists an entrywise nonnegative matrix B such that A = B B T . These matrices play a major role in combinatorial and quadratic optimization. In this paper, we study the problem of finding a nonnegati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::169ccebe21c14864c8e93f9ef8a5397f
https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/76330
https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/76330
Publikováno v:
Mathematics of Operations Research, 42(1), 77-94. INFORMS
Mathematics of operations research, 42(1). INFORMS Institute for Operations Research and the Management Sciences
Mathematics of operations research, 42(1). INFORMS Institute for Operations Research and the Management Sciences
This paper is concerned with so-called generic properties of general linear conic programs. Many results have been obtained on this subject during the last two decades. For example, it is known that uniqueness, strict complementarity, and nondegenera
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::125dd5c0a28c33b2870f8f46aea78063
https://research.rug.nl/en/publications/e0c24dc3-5444-4fd9-addd-c5c9ed85b7a9
https://research.rug.nl/en/publications/e0c24dc3-5444-4fd9-addd-c5c9ed85b7a9
Publikováno v:
Linear Algebra and its Applications. 498:58-73
An SPN matrix is a matrix which is the sum of a real positive semidefinite matrix and a symmetric nonnegative one. We solve the SPN completion problem: we show that the SPN completable graphs are the graphs in which every odd cycle induces a complete
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::02fc1c28a6704677a06f9283f1fb528e
https://doi.org/10.1016/j.laa.2014.10.021
https://doi.org/10.1016/j.laa.2014.10.021
Autor:
Mirjam Dür, Stefan Bundfuss
We answer two open questions on copositive Lyapunov functions which were recently posed by M.K. Camlibel and J.M. Schumacher in the book Unsolved Problems in Mathematical Systems and Control Theory , edited by V.D. Blondel and A. Megretski [M.K. Caml
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4602b3bec1cf8e646a641d1d6ec136e1
https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/40646
https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/40646
Publikováno v:
Mathematical Methods of Operations Research, 82(2), 123-142
Mathematical methods of operations research, 82(2), 123-142. Physica-Verlag
Mathematical methods of operations research, 82(2), 123-142. Physica-Verlag
We study the order of maximizers in linear conic programming (CP) as well as stability issues related to this. We do this by taking a semi-infinite view on conic programs: a linear conic problem can be formulated as a special instance of a linear sem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::04b97b9197d2eb83e85d8556bca59bce
https://doi.org/10.1007/s00186-015-0513-1
https://doi.org/10.1007/s00186-015-0513-1
Publikováno v:
Optimization Letters. 10:433-446
We show how to separate a doubly nonnegative matrix, which is not completely positive and has a triangle-free graph, from the completely positive cone. This method can be used to compute cutting planes for semidefinite relaxations of combinatorial pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6259b9886f06fe5faffb39f6d00703d1
https://doi.org/10.1007/s11590-015-0922-3
https://doi.org/10.1007/s11590-015-0922-3
Publikováno v:
Mathematical Programming
Mathematical Programming, Springer Verlag, 2013, 140 (1), p. 31-43. ⟨10.1007/s10107-012-0625-9⟩
Mathematical Programming, 2013, 140, pp.31-43. ⟨10.1007/s10107-012-0625-9⟩
Mathematical Programming, Springer Verlag, 2013, 140 (1), p. 31-43. ⟨10.1007/s10107-012-0625-9⟩
Mathematical Programming, 2013, 140, pp.31-43. ⟨10.1007/s10107-012-0625-9⟩
International audience; We consider the problem of minimizing an indefinite quadratic form over the nonnegative orthant, or equivalently, the problem of deciding whether a symmetric matrix is copositive. We formulate the problem as a difference of co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::10c6d639f0e315ff49ab403fa8430335
https://doi.org/10.1007/s10107-012-0625-9
https://doi.org/10.1007/s10107-012-0625-9