hrcak mascot   Srce   HID

Croatian Operational Research Review, Vol. 1 No. 1, 2010.

Izvorni znanstveni članak

ON THE SET-SEMIDEFINITE REPRESENTATION OF NONCONVEX QUADRATIC PROGRAMS WITH CONE CONSTRAINTS

Gabriele Eichfelder   ORCID icon orcid.org/0000-0002-1938-6316 ; Department of Mathematics, University of Erlangen-Nürnberg, Germany
Janez Povh ; Faculty of Information Studies in Novo Mesto, Slovenia

Puni tekst: engleski, pdf (1 MB) str. 26-39 preuzimanja: 188* citiraj
APA 6th Edition
Eichfelder, G. i Povh, J. (2010). ON THE SET-SEMIDEFINITE REPRESENTATION OF NONCONVEX QUADRATIC PROGRAMS WITH CONE CONSTRAINTS. Croatian Operational Research Review, 1 (1), 26-39. Preuzeto s https://hrcak.srce.hr/93435
MLA 8th Edition
Eichfelder, Gabriele i Janez Povh. "ON THE SET-SEMIDEFINITE REPRESENTATION OF NONCONVEX QUADRATIC PROGRAMS WITH CONE CONSTRAINTS." Croatian Operational Research Review, vol. 1, br. 1, 2010, str. 26-39. https://hrcak.srce.hr/93435. Citirano 16.02.2019.
Chicago 17th Edition
Eichfelder, Gabriele i Janez Povh. "ON THE SET-SEMIDEFINITE REPRESENTATION OF NONCONVEX QUADRATIC PROGRAMS WITH CONE CONSTRAINTS." Croatian Operational Research Review 1, br. 1 (2010): 26-39. https://hrcak.srce.hr/93435
Harvard
Eichfelder, G., i Povh, J. (2010). 'ON THE SET-SEMIDEFINITE REPRESENTATION OF NONCONVEX QUADRATIC PROGRAMS WITH CONE CONSTRAINTS', Croatian Operational Research Review, 1(1), str. 26-39. Preuzeto s: https://hrcak.srce.hr/93435 (Datum pristupa: 16.02.2019.)
Vancouver
Eichfelder G, Povh J. ON THE SET-SEMIDEFINITE REPRESENTATION OF NONCONVEX QUADRATIC PROGRAMS WITH CONE CONSTRAINTS. Croatian Operational Research Review [Internet]. 2010 [pristupljeno 16.02.2019.];1(1):26-39. Dostupno na: https://hrcak.srce.hr/93435
IEEE
G. Eichfelder i J. Povh, "ON THE SET-SEMIDEFINITE REPRESENTATION OF NONCONVEX QUADRATIC PROGRAMS WITH CONE CONSTRAINTS", Croatian Operational Research Review, vol.1, br. 1, str. 26-39, 2010. [Online]. Dostupno na: https://hrcak.srce.hr/93435. [Citirano: 16.02.2019.]

Sažetak
The well-known result stating that any non-convex quadratic problem over the non-negative orthant with some additional linear and binary constraints can be rewritten as linear problem over the cone of
completely positive matrices (Burer, 2009) is generalizes by replacing the non-negative orthant with arbitrary closed convex and pointed cone. This set-semidefinite representation result implies new semidefinite lower bounds for quadratic problems over the Bishop-Phelps cones, based on the Euclidian norm.

Ključne riječi
set positivity; Bishop-Phelps cones

Hrčak ID: 93435

URI
https://hrcak.srce.hr/93435

Posjeta: 325 *