A standard quadratic optimization problem (StQP) consists of finding the largest or smallest value of a (possibly indefinite) quadratic form over the standard simplex which is the intersection of a hyperplane with the positive orthant. This NP-hard problem has several immediate real-world applications like the Maximum-Clique Problem, and it also occurs in a natural way as a subproblem in quadratic programming with linear constraints. To get rid of the (sign) constraints, we propose a quartic reformulation of StQPs, which is a special case (degree four) of a homogeneous program over the unit sphere. It turns out that while KKT points are not exactly corresponding to each other, there is a one-to-one correspondence between feasible points of the StQP satisfying second-order necessary optimality conditions, to the counterparts in the quartic homogeneous formulation. We supplement this study by showing how exact penalty approaches can be used for finding local solutions satisfying second-order necessary optimality conditions to the quartic problem: we show that the level sets of the penalty function are bounded for a finite value of the penalty parameter which can be fixed in advance, thus establishing exact equivalence of the constrained quartic problem with the unconstrained penalized version.
Quartic formulation of standard quadratic optimization / Palagi, Laura; I., Bomze. - In: JOURNAL OF GLOBAL OPTIMIZATION. - ISSN 0925-5001. - STAMPA. - 32(2005), pp. 181-205. [10.1007/s10898-004-2701-z]
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
|Titolo:||Quartic formulation of standard quadratic optimization|
|Data di pubblicazione:||2005|
|Citazione:||Quartic formulation of standard quadratic optimization / Palagi, Laura; I., Bomze. - In: JOURNAL OF GLOBAL OPTIMIZATION. - ISSN 0925-5001. - STAMPA. - 32(2005), pp. 181-205. [10.1007/s10898-004-2701-z]|
|Appartiene alla tipologia:||01a Articolo in rivista|