Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming (Q1029700): Difference between revisions

Revision as of 18:22, 1 July 2024

scientific article

Language	Label	Description	Also known as
English	Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming	scientific article

Statements

instance of

scholarly article

0 references

title

Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming (English)

0 references

author

Kurt M. Anstreicher

0 references

published in

Journal of Global Optimization

0 references

publication date

13 July 2009

0 references

describes a project that uses

BARON

0 references

SeDuMi

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10898-008-9372-0

0 references

cites work

On the copositive representation of binary and continuous nonconvex quadratic programs

0 references

A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations

0 references

Q4352739

0 references

Second order cone programming relaxation of nonconvex quadratic optimization problems

0 references

A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems

0 references

BARON: A general purpose global optimization software package

0 references

A reformulation-linearization technique for solving discrete and continuous nonconvex problems

0 references

Enhancing RLT relaxations via a new class of semidefinite cuts

0 references

A reformulation-convexification approach for solving nonconvex quadratic programming problems

0 references

Theory of semidefinite programming for sensor network localization

0 references

Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

0 references

Global Optimization in Geometry — Circle Packing into the Square

0 references

Semidefinite Programming

0 references

A branch-and-cut algorithm for nonconvex quadratic programs with box constraints

0 references

Handbook of semidefinite programming. Theory, algorithms, and applications

0 references

Approximating quadratic programming with bound and quadratic constraints

0 references

Identifiers

zbMATH Open document ID

1169.90425

0 references

DOI

10.1007/s10898-008-9372-0

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1029700

@@ Property / describes a project that uses @@
+SeDuMi
@@ Property / describes a project that uses: SeDuMi / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10898-008-9372-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2105880662
@@ Property / OpenAlex ID: W2105880662 / rank @@
+Normal rank
@@ Property / cites work @@
+On the copositive representation of binary and continuous nonconvex quadratic programs
+Normal rank
@@ Property / cites work @@
+A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
+Normal rank
@@ Property / cites work @@
+Q4352739
@@ Property / cites work: Q4352739 / rank @@
+Normal rank
@@ Property / cites work @@
+Second order cone programming relaxation of nonconvex quadratic optimization problems
+Normal rank
@@ Property / cites work @@
+A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
+Normal rank
@@ Property / cites work @@
+BARON: A general purpose global optimization software package
+Normal rank
@@ Property / cites work @@
+A reformulation-linearization technique for solving discrete and continuous nonconvex problems
+Normal rank
@@ Property / cites work @@
+Enhancing RLT relaxations via a new class of semidefinite cuts
+Normal rank
@@ Property / cites work @@
+A reformulation-convexification approach for solving nonconvex quadratic programming problems
+Normal rank
@@ Property / cites work @@
+Theory of semidefinite programming for sensor network localization
+Normal rank
@@ Property / cites work @@
+Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
+Normal rank
@@ Property / cites work @@
+Global Optimization in Geometry — Circle Packing into the Square
+Normal rank
@@ Property / cites work @@
+Semidefinite Programming
@@ Property / cites work: Semidefinite Programming / rank @@
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
+Normal rank
@@ Property / cites work @@
+Handbook of semidefinite programming. Theory, algorithms, and applications
+Normal rank
@@ Property / cites work @@
+Approximating quadratic programming with bound and quadratic constraints
+Normal rank