All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Maximization of a convex quadratic form on a polytope: Factorization and the Chebyshev norm bounds

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F20%3A10419279" target="_blank" >RIV/00216208:11320/20:10419279 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1007/978-3-030-21803-4_12" target="_blank" >https://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>

Alternative languages

  • 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

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    50201 - Economic Theory

Result continuities

  • Project

    <a href="/en/project/GA18-04735S" target="_blank" >GA18-04735S: Novel approaches for relaxation and approximation techniques in deterministic global optimization</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2020

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    Optimization of Complex Systems: Theory, Models, Algorithms and Applications

  • ISBN

    978-3-030-21803-4

  • ISSN

    2194-5357

  • e-ISSN

  • Number of pages

    9

  • Pages from-to

    119-127

  • Publisher name

    Springer

  • Place of publication

    Cham

  • Event location

    Metz, France

  • Event date

    Jul 8, 2019

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article