Search results
- 1.0507646 - ÚI 2021 RIV CH eng C - Conference Paper (international conference)
Hladík, M. - Hartman, David
Maximization of a Convex Quadratic Form on a Polytope: Factorization and the Chebyshev Norm Bounds.
Optimization of Complex Systems: Theory, Models, Algorithms and Applications. Cham: Springer, 2020 - (Le Thi, H.; Minh Le, H.; Pham Dinh, T.), s. 119-127. Advances in Intelligent Systems and Computing, 991. ISBN 978-3-030-21802-7.
[WCGO 2019: World Congress on Global Optimization /6./. Metz (FR), 08.07.2019-10.07.2019]
Institutional support: RVO:67985807
Keywords : Convex quadratic form * Relaxation * NP-hardness * Interval computation
OECD category: Pure mathematics
Permanent Link: http://hdl.handle.net/11104/0298623 - 2.0459146 - ÚI 2017 RIV CH eng C - Conference Paper (international conference)
Hartman, David - Hladík, M.
Tight Bounds on the Radius of Nonsingularity.
Scientific Computing, Computer Arithmetic, and Validated Numerics. Revised Selected Papers. Cham: Springer, 2016 - (Nehmeier, M.; Wolff von Gudenberg, J.; Tucker, W.), s. 109-115. Lecture Notes in Computer Science, 9553. ISBN 978-3-319-31768-7. ISSN 0302-9743.
[SCAN 2014. International Symposium on Scientific Computing, Computer Arithmetic, and Validated Numerics /16./. Würzburg (DE), 21.09.2014-26.09.2014]
R&D Projects: GA ČR GA13-17187S
Grant - others:GA ČR(CZ) GA13-10660S
Institutional support: RVO:67985807
Keywords : radius of nonsingularity * bounds * semidefinite programming
Subject RIV: IN - Informatics, Computer Science
Permanent Link: http://hdl.handle.net/11104/0259385File Download Size Commentary Version Access a0459146.pdf 1 150.3 KB Publisher’s postprint require