- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1573-2916
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
New bounds for nonconvex quadratically constrained quadratic programming ; day:26 ; month:8 ; year:2022 ; pages:1-19
Journal of global optimization ; (26.8.2022), 1-19
- Creator
-
Zamani, Moslem
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10898-022-01224-1
- URN
-
urn:nbn:de:101:1-2022111309024587944644
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:25 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
- Zamani, Moslem
- SpringerLink (Online service)
Other Objects (12)
MINQ8: general definite and bound constrained indefinite quadratic programming
Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I
Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: part II
An accelerating algorithm for globally solving nonconvex quadratic programming
Nonconvex constrained optimization by a filtering branch and bound
Nonconvex constrained optimization by a filtering branch and bound
Nonconvex constrained optimization by a filtering branch and bound
A Global Optimality Criterion for Nonconvex Quadratic Programming over a Simplex
Some Heuristics and Test Problems for Nonconvex Quadratic Programming over a Simplex
Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints
Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
MINQ8: general definite and bound constrained indefinite quadratic programming
Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I
Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: part II
An accelerating algorithm for globally solving nonconvex quadratic programming
Nonconvex constrained optimization by a filtering branch and bound
Nonconvex constrained optimization by a filtering branch and bound
Nonconvex constrained optimization by a filtering branch and bound
A Global Optimality Criterion for Nonconvex Quadratic Programming over a Simplex
Some Heuristics and Test Problems for Nonconvex Quadratic Programming over a Simplex
Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints
Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
MINQ8: general definite and bound constrained indefinite quadratic programming
Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I
Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: part II
An accelerating algorithm for globally solving nonconvex quadratic programming
Nonconvex constrained optimization by a filtering branch and bound
Nonconvex constrained optimization by a filtering branch and bound
Nonconvex constrained optimization by a filtering branch and bound
A Global Optimality Criterion for Nonconvex Quadratic Programming over a Simplex
Some Heuristics and Test Problems for Nonconvex Quadratic Programming over a Simplex
Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints
Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations