note on completely positive relaxations of quadratic problems in a multiobjective framework
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource, 12 Seiten
- Language
-
Englisch
- Bibliographic citation
-
In: Journal of global optimization(82), H. 3, S.615-626 - ISSN 1573-2916
In: Springer Science + Business Media B.V, Dordrecht [u.a.]
- Event
-
Veröffentlichung
- (where)
-
Ilmenau
- (who)
-
TU Ilmenau
- (when)
-
2021
- Creator
- DOI
-
10.1007/s10898-021-01091-2
- URN
-
urn:nbn:de:101:1-2022071803063327301768
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:36 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Eichfelder, Gabriele
- Groetzner, Patrick
- TU Ilmenau
Time of origin
- 2021
Other Objects (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