Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Werner Schachinger"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 25:2, Iss Combinatorics (2023)
The analysis of strings of $n$ random variables with geometric distribution has recently attracted renewed interest: Archibald et al. consider the number of distinct adjacent pairs in geometrically distributed words. They obtain the asymptotic ($n\ri
Externí odkaz:
https://doaj.org/article/8a6347e4fe1a4b369bd2ecfed0dcdcb5
Autor:
Werner Schachinger
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 4, Iss 2 (2001)
We propose martingale central limit theorems as an tool to prove asymptotic normality of the costs of certain recursive algorithms which are subjected to random input data. The recursive algorithms that we have in mind are such that if input data of
Externí odkaz:
https://doaj.org/article/7f69c8c2f0864d3296b3460fd7ed11db
Autor:
Werner Schachinger
Publikováno v:
The Electronic Journal of Linear Algebra. 36:519-541
Let $p_n$ denote the maximal cp-rank attained by completely positive $n\times n$ matrices. Only lower and upper bounds for $p_n$ are known, when $n\ge6$, but it is known that $p_n=\frac{n^2}2\big(1+o(1)\big)$, and the difference of the current best u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6652ab67e2e2c2a1cd1c71dee1ab1b44
https://doi.org/10.13001/ela.2020.5323
https://doi.org/10.13001/ela.2020.5323
Publikováno v:
Economic Theory. 71:305-315
Some finite and symmetric two-player games have no (pure or mixed) symmetric Nash equilibrium when played by partly morally motivated players.The reason is that the “right thing to do” may be not to randomize. We analyze this issue both under com
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d3f14ff59154e4c13be1d6d23a6e2be2
https://doi.org/10.1007/s00199-020-01246-4
https://doi.org/10.1007/s00199-020-01246-4
Publikováno v:
Mathematics of Operations Research. 43:651-674
In a Standard Quadratic Optimization Problem (StQP), a possibly indefinite quadratic form (the simplest nonlinear function) is extremized over the standard simplex, the simplest polytope. Despite this simplicity, the nonconvex instances of this probl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3a7ed652f532a7a0af2e40f39704573b
https://doi.org/10.1287/moor.2017.0877
https://doi.org/10.1287/moor.2017.0877
Autor:
Immanuel M. Bomze, Werner Schachinger
As is well known, equilibrium analysis of evolutionary partnership games can be done by studying a so-called standard quadratic optimization problem, where a possibly indefinite quadratic form is maximized over the standard (probability) simplex. Des
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e32378b6c659a93559e1ee4ff9de1bef
https://hdl.handle.net/11353/10.1074741
https://hdl.handle.net/11353/10.1074741
Publikováno v:
SIAM Journal on Optimization
SIAM Journal on Optimization, Society for Industrial and Applied Mathematics, 2019, 29, pp.2100-2127. ⟨10.1137/18M1215682⟩
Siam Journal on Optimization, 29(3), 2100-2127. Society for Industrial and Applied Mathematics Publications
SIAM Journal on Optimization, 2019, 29, pp.2100-2127. ⟨10.1137/18M1215682⟩
SIAM Journal on Optimization, Society for Industrial and Applied Mathematics, 2019, 29, pp.2100-2127. ⟨10.1137/18M1215682⟩
Siam Journal on Optimization, 29(3), 2100-2127. Society for Industrial and Applied Mathematics Publications
SIAM Journal on Optimization, 2019, 29, pp.2100-2127. ⟨10.1137/18M1215682⟩
In this paper, we propose an interior-point method for linearly constrained optimization problems (possibly nonconvex). The method - which we call the Hessian barrier algorithm (HBA) - combines a forward Euler discretization of Hessian Riemannian gra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4b629d15e830b24d0f27147b3119fb88
http://arxiv.org/abs/1809.09449
http://arxiv.org/abs/1809.09449
Publikováno v:
Transportation Research Procedia. 11:515-530
Past experiences show that data of the official Austrian freight transport statistics are often underestimated. Therefore, a methodology was developed, merging existing independent road freight transport data to a consistent and valid road freight ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5904136bea88317ca7c180167e126013
https://doi.org/10.1016/j.trpro.2015.12.043
https://doi.org/10.1016/j.trpro.2015.12.043
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 36:20-37
Let $p_n$ denote the largest possible cp-rank of an $n\times n$ completely positive matrix. This matrix parameter has its significance both in theory and applications, as it sheds light on the geometry and structure of the solution set of hard optimi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::969a7d812d874de42375a59aa92cef8a
https://doi.org/10.1137/140973207
https://doi.org/10.1137/140973207
Publikováno v:
Linear Algebra and its Applications. 459:208-221
We study n × n completely positive matrices M on the boundary of the completely positive cone, namely those orthogonal to a copositive matrix S which generates a quadratic form with finitely many zeroes in the standard simplex. Constructing particul
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6655107044ab193a383401d0908fee80
https://doi.org/10.1016/j.laa.2014.06.025
https://doi.org/10.1016/j.laa.2014.06.025