Maximization of a Convex Quadratic Form on a Polytope: Factorization and the Chebyshev Norm Bounds

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F20%3A00507646" target="_blank" >RIV/67985807:_____/20:00507646 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-030-21803-4_12" target="_blank" >http://dx.doi.org/10.1007/978-3-030-21803-4_12</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-21803-4_12" target="_blank" >10.1007/978-3-030-21803-4_12</a>

Result language
angličtina
Original language name
Maximization of a Convex Quadratic Form on a Polytope: Factorization and the Chebyshev Norm Bounds
Original language description
Maximization of a convex quadratic form on a convex polyhedral set is an NP-hard problem. We focus on computing an upper bound based on a factorization of the quadratic form matrix and employment of the maximum vector norm. Effectivity of this approach depends on the factorization used. We discuss several choices as well as iterative methods to improve performance of a particular factorization. We carried out numerical experiments to compare various alternatives and to compare our approach with other standard approaches, including McCormick envelopes.
Czech name
—
Czech description
—

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Optimization of Complex Systems: Theory, Models, Algorithms and Applications
ISBN
978-3-030-21802-7
ISSN
—
e-ISSN
—
Number of pages
9
Pages from-to
119-127
Publisher name
Springer
Place of publication
Cham
Event location
Metz
Event date
Jul 8, 2019
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)