A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program (Q5038154): Difference between revisions

Latest revision as of 06:59, 30 July 2024

scientific article; zbMATH DE number 7594823

Language	Label	Description	Also known as
English	A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program	scientific article; zbMATH DE number 7594823

Statements

instance of

scholarly article

0 references

title

A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program (English)

0 references

0 references

0 references

0 references

0 references

0 references

29 September 2022

0 references

zbMATH Keywords

quadratic convex reformulation

0 references

branch-and-bound algorithm

0 references

quadratically constrained quadratic program

0 references

simultaneous diagonalization

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/02331934.2020.1865347

0 references

cites work

Convergence rate of the Pham Dinh-Le Thi algorithm for the trust-region subproblem

0 references

A new trust region method for nonsmooth nonconvex optimization

0 references

Narrowing the difficulty gap for the Celis-Dennis-Tapia problem

0 references

Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations

0 references

A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems

0 references

Globally solving nonconvex quadratic programming problems via completely positive programming

0 references

An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints

0 references

A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs

0 references

Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem

0 references

Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method

0 references

Exact quadratic convex reformulations of mixed-integer quadratically constrained problems

0 references

Global solution of non-convex quadratically constrained quadratic programs

0 references

Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints

0 references

Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations

0 references

Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint

0 references

Hidden conic quadratic representation of some nonconvex quadratic optimization problems

0 references

A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints

0 references

Simultaneous Diagonalization of Matrices and Its Applications in Quadratically Constrained Quadratic Programming

0 references

SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices

0 references

Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons

0 references

Q3009736

0 references

Lectures on Modern Convex Optimization

0 references

An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem

0 references

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

0 references

Identifiers

zbMATH Open document ID

1501.90064

0 references

DOI

10.1080/02331934.2020.1865347

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5038154

@@ Property / cites work @@
+Convergence rate of the Pham Dinh-Le Thi algorithm for the trust-region subproblem
+Normal rank
@@ Property / cites work @@
+A new trust region method for nonsmooth nonconvex optimization
+Normal rank
@@ Property / cites work @@
+Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
+Normal rank
@@ Property / cites work @@
+Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems
+Normal rank
@@ Property / cites work @@
+Globally solving nonconvex quadratic programming problems via completely positive programming
+Normal rank
@@ Property / cites work @@
+An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
+Normal rank
@@ Property / cites work @@
+A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs
+Normal rank
@@ Property / cites work @@
+Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
+Normal rank
@@ Property / cites work @@
+Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
+Normal rank
@@ Property / cites work @@
+Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
+Normal rank
@@ Property / cites work @@
+Global solution of non-convex quadratically constrained quadratic programs
+Normal rank
@@ Property / cites work @@
+Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
+Normal rank
@@ Property / cites work @@
+Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
+Normal rank
@@ Property / cites work @@
+Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint
+Normal rank
@@ Property / cites work @@
+Hidden conic quadratic representation of some nonconvex quadratic optimization problems
+Normal rank
@@ Property / cites work @@
+A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints
+Normal rank
@@ Property / cites work @@
+Simultaneous Diagonalization of Matrices and Its Applications in Quadratically Constrained Quadratic Programming
+Normal rank
@@ Property / cites work @@
+SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices
+Normal rank
@@ Property / cites work @@
+Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
+Normal rank
@@ Property / cites work @@
+Q3009736
@@ Property / cites work: Q3009736 / rank @@
+Normal rank
@@ Property / cites work @@
+Lectures on Modern Convex Optimization
@@ Property / cites work: Lectures on Modern Convex Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem
+Normal rank
@@ Property / cites work @@
+Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
+Normal rank