- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1029-242X
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
An accelerating algorithm for globally solving nonconvex quadratic programming ; volume:2018 ; number:1 ; day:16 ; month:7 ; year:2018 ; pages:1-16 ; date:12.2018
Journal of inequalities and applications ; 2018, Heft 1 (16.7.2018), 1-16, 12.2018
- Classification
-
Mathematik
- Creator
-
Ge, Li
- Contributor
-
Liu, Sanyang
SpringerLink (Online service)
- DOI
-
10.1186/s13660-018-1764-1
- URN
-
urn:nbn:de:101:1-2018092122291181703710
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:23 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
- Ge, Li
- Liu, Sanyang
- SpringerLink (Online service)
Other Objects (12)
A coordinate ascent method for solving semidefinite relaxations of non-convex quadratic integer programs
Nonconvex min–max fractional quadratic problems under quadratic constraints: copositive relaxations
New bounds for nonconvex quadratically constrained quadratic programming
A range division and contraction approach for nonconvex quadratic program with quadratic constraints
Advancements in Piecewise Linear Techniques for Non-Convex Quadratic Programs
Solving quadratic equations in many variables
Solving nonconvex planar location problems by finite dominating sets
A Global Optimality Criterion for Nonconvex Quadratic Programming over a Simplex
Multiscale techniques for solving quadratic eigenvalue problems
Some Heuristics and Test Problems for Nonconvex Quadratic Programming over a Simplex
An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
Nonconvex all-quadratic global optimization problems : solution methods, application and related topics
A coordinate ascent method for solving semidefinite relaxations of non-convex quadratic integer programs
Nonconvex min–max fractional quadratic problems under quadratic constraints: copositive relaxations
New bounds for nonconvex quadratically constrained quadratic programming
A range division and contraction approach for nonconvex quadratic program with quadratic constraints
Advancements in Piecewise Linear Techniques for Non-Convex Quadratic Programs
Solving quadratic equations in many variables
Solving nonconvex planar location problems by finite dominating sets
A Global Optimality Criterion for Nonconvex Quadratic Programming over a Simplex
Multiscale techniques for solving quadratic eigenvalue problems
Some Heuristics and Test Problems for Nonconvex Quadratic Programming over a Simplex
An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
Nonconvex all-quadratic global optimization problems : solution methods, application and related topics
A coordinate ascent method for solving semidefinite relaxations of non-convex quadratic integer programs
Nonconvex min–max fractional quadratic problems under quadratic constraints: copositive relaxations
New bounds for nonconvex quadratically constrained quadratic programming
A range division and contraction approach for nonconvex quadratic program with quadratic constraints
Advancements in Piecewise Linear Techniques for Non-Convex Quadratic Programs
Solving quadratic equations in many variables
Solving nonconvex planar location problems by finite dominating sets
A Global Optimality Criterion for Nonconvex Quadratic Programming over a Simplex
Multiscale techniques for solving quadratic eigenvalue problems
Some Heuristics and Test Problems for Nonconvex Quadratic Programming over a Simplex
An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs