note on completely positive relaxations of quadratic problems in a multiobjective framework
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource, 12 Seiten
- Sprache
-
Englisch
- Erschienen in
-
In: Journal of global optimization(82), H. 3, S.615-626 - ISSN 1573-2916
In: Springer Science + Business Media B.V, Dordrecht [u.a.]
- Ereignis
-
Veröffentlichung
- (wo)
-
Ilmenau
- (wer)
-
TU Ilmenau
- (wann)
-
2021
- Urheber
- DOI
-
10.1007/s10898-021-01091-2
- URN
-
urn:nbn:de:101:1-2022071803063327301768
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:36 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Eichfelder, Gabriele
- Groetzner, Patrick
- TU Ilmenau
Entstanden
- 2021
Ähnliche Objekte (12)
A note on completely positive relaxations of quadratic problems in a multiobjective framework
A note on completely positive relaxations of quadratic problems in a multiobjective framework
A note on completely positive relaxations of quadratic problems in a multiobjective framework
Solving Two-stage Quadratic Multiobjective Problems via Optimality and Relaxations
Using dual relaxations in multiobjective mixed-integer convex quadratic programming
Nonconvex min–max fractional quadratic problems under quadratic constraints: copositive relaxations
Convex Quadratic Programming Relaxations for Network Scheduling Problems
Convex quadratic and semidefinite programming relaxations in Scheduling
Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations
On standard quadratic programs with exact and inexact doubly nonnegative relaxations
Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints
An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
A note on completely positive relaxations of quadratic problems in a multiobjective framework
A note on completely positive relaxations of quadratic problems in a multiobjective framework
A note on completely positive relaxations of quadratic problems in a multiobjective framework
Solving Two-stage Quadratic Multiobjective Problems via Optimality and Relaxations
Using dual relaxations in multiobjective mixed-integer convex quadratic programming
Nonconvex min–max fractional quadratic problems under quadratic constraints: copositive relaxations
Convex Quadratic Programming Relaxations for Network Scheduling Problems
Convex quadratic and semidefinite programming relaxations in Scheduling
Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations
On standard quadratic programs with exact and inexact doubly nonnegative relaxations
Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints
An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
A note on completely positive relaxations of quadratic problems in a multiobjective framework
A note on completely positive relaxations of quadratic problems in a multiobjective framework
A note on completely positive relaxations of quadratic problems in a multiobjective framework
Solving Two-stage Quadratic Multiobjective Problems via Optimality and Relaxations
Using dual relaxations in multiobjective mixed-integer convex quadratic programming
Nonconvex min–max fractional quadratic problems under quadratic constraints: copositive relaxations
Convex Quadratic Programming Relaxations for Network Scheduling Problems
Convex quadratic and semidefinite programming relaxations in Scheduling
Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations
On standard quadratic programs with exact and inexact doubly nonnegative relaxations
Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints