Name
Abstract | ||
|---|---|---|
We consider the problem of maximization of a convex quadratic form on a convex polyhedral set, which is known to be NP-hard. In particular, we focus on upper bounds on the maximum value. We investigate utilization of different vector norms (estimating the Euclidean one) and different objective matrix factorizations. We arrive at some kind of duality with positive duality gap in general, but with possibly tight bounds. We discuss theoretical properties of these bounds and also extensions to generally preconditioned factors. We employ mainly the maximum vector norm since it yields efficiently computable bounds, however, we study other norms, too. Eventually, we leave many challenging open problems that arose during the research. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/s11590-020-01624-w | Optimization Letters |
Keywords | DocType | Volume |
Convex quadratic form, Concave programming, NP-hardness, Upper bound, Maximum norm, Preconditioning | Journal | 15 |
Issue | ISSN | Citations |
7 | 1862-4472 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Milan Hladík | 1 | 268 | 36.33 |
| David Hartman | 2 | 17 | 3.78 |
| Moslem Zamani | 3 | 10 | 2.96 |