Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Asteroide Santana"'
Publikováno v:
Journal of Global Optimization. 77:227-272
We study sets defined as the intersection of a rank-one constraint with different choices of linear side constraints. We identify different conditions on the linear side constraints, under which the convex hull of the rank-one set is polyhedral or se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7a419f2839cc40eecd072e1c53d66016
https://doi.org/10.1007/s10898-019-00844-4
https://doi.org/10.1007/s10898-019-00844-4
Autor:
Asteroide Santana, Santanu S. Dey
A quadratically constrained quadratic program (QCQP) is an optimization problem in which the objective function is a quadratic function and the feasible region is defined by quadratic constraints. Solving non-convex QCQP to global optimality is a wel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c24f54d52f0b68f33f6e06e31fba8207
http://arxiv.org/abs/1812.10160
http://arxiv.org/abs/1812.10160
A bipartite bilinear program (BBP) is a quadratically constrained quadratic optimization problem where the variables can be partitioned into two sets such that fixing the variables in any one of the sets results in a linear program. We propose a new
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::02131174dd6b606e497a1698a40ac315
Autor:
Rebecca M. Mitchell, Xiangxi Gao, Asteroide Santana, Ymir Vigfusson, Lauri Mustonen, Lars Ruthotto
We provide a mathematical formulation and develop a computational framework for identifying multiple strains of microorganisms from mixed samples of DNA. Our method is applicable in public health domains where efficient identification of pathogens is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::34ad32c5116045ae4d4bddc8cf9159c0
Autor:
Asteroide Santana, Santanu S. Dey
In this paper, we study cut generating functions for conic sets. Our first main result shows that if the conic set is bounded, then cut generating functions for integer linear programs can easily be adapted to give the integer hull of the conic integ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::76e8f80227029a90800f68afbe8a9307
http://arxiv.org/abs/1606.00385
http://arxiv.org/abs/1606.00385
Autor:
Lauri Mustonen, Xiangxi Gao, Asteroide Santana, Rebecca Mitchell, Ymir Vigfusson, Lars Ruthotto
Publikováno v:
Inverse Problems; Oct2018, Vol. 34 Issue 10, p1-1, 1p