Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems (Q5501200): Difference between revisions

Latest revision as of 15:21, 10 July 2024

scientific article; zbMATH DE number 6468815

Language	Label	Description	Also known as
English	Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems	scientific article; zbMATH DE number 6468815

Statements

instance of

scholarly article

0 references

title

Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems (English)

0 references

zbMATH Open document ID

0 references

0 references

0 references

SIAM Journal on Optimization

0 references

publication date

3 August 2015

0 references

full work available at URL

https://semanticscholar.org/paper/21df1106f50b79e31696e26139e982cfa42ca22b

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

copositive matrices

0 references

nonconvex optimization

0 references

polynomial optimization

0 references

quadratically constrained problem

0 references

global optimality condition

0 references

approximation hierarchies

0 references

describes a project that uses

QuadProgBB

0 references

MaRDI profile type

MaRDI publication profile

0 references

OpenAlex ID

W2131712693

0 references

cites work

Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition

0 references

Q2928409

0 references

On conic QPCCs, conic QCQPs and completely positive programs

0 references

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

0 references

Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints

0 references

A Frank--Wolfe type theorem for convex polynomial programs

0 references

Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems

0 references

Copositive optimization -- recent developments and applications

0 references

A fresh CP look at mixed-binary QPs: new formulations and relaxations

0 references

A note on Burer's copositive representation of mixed-binary QPs

0 references

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

0 references

New Lower Bounds and Asymptotics for the cp-Rank

0 references

Algorithmic copositivity detection by simplicial partition

0 references

An Adaptive Linear Approximation Algorithm for Copositive Programs

0 references

On the copositive representation of binary and continuous nonconvex quadratic programs

0 references

Copositive Programming

0 references

Faster, but weaker, relaxations for quadratically constrained quadratic programs

0 references

Globally solving nonconvex quadratic programming problems via completely positive programming

0 references

An improved characterisation of the interior of the completely positive cone

0 references

On the computational complexity of membership problems for the completely positive cone and its dual

0 references

Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem

0 references

Partial Lagrangian relaxation for general quadratic programming

0 references

Semidefinite programming relaxation for nonconvex quadratic programs

0 references

Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization

0 references

Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization

0 references

Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization

0 references

A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems

0 references

Global Optimization with Polynomials and the Problem of Moments

0 references

KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems

0 references

On extensions of the Frank-Wolfe theorems

0 references

On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods

0 references

Some NP-complete problems in quadratic and nonlinear programming

0 references

Q4517108

0 references

A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming

0 references

New results on the cp-rank and related properties of co(mpletely )positive matrices

0 references

Q3802887

0 references

On the complexity of approximating a KKT point of quadratic programming

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5501200

@@ Property / cites work @@
+Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
+Normal rank
@@ Property / cites work @@
+Q2928409
@@ Property / cites work: Q2928409 / rank @@
+Normal rank
@@ Property / cites work @@
+On conic QPCCs, conic QCQPs and completely positive programs
+Normal rank
@@ Property / cites work @@
+Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
+Normal rank
@@ Property / cites work @@
+Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
+Normal rank
@@ Property / cites work @@
+A Frank--Wolfe type theorem for convex polynomial programs
+Normal rank
@@ Property / cites work @@
+Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
+Normal rank
@@ Property / cites work @@
+Copositive optimization -- recent developments and applications
+Normal rank
@@ Property / cites work @@
+A fresh CP look at mixed-binary QPs: new formulations and relaxations
+Normal rank
@@ Property / cites work @@
+A note on Burer's copositive representation of mixed-binary QPs
+Normal rank
@@ Property / cites work @@
+Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
+Normal rank
@@ Property / cites work @@
+New Lower Bounds and Asymptotics for the cp-Rank
@@ Property / cites work: New Lower Bounds and Asymptotics for the cp-Rank / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic copositivity detection by simplicial partition
+Normal rank
@@ Property / cites work @@
+An Adaptive Linear Approximation Algorithm for Copositive Programs
+Normal rank
@@ Property / cites work @@
+On the copositive representation of binary and continuous nonconvex quadratic programs
+Normal rank
@@ Property / cites work @@
+Copositive Programming
@@ Property / cites work: Copositive Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Faster, but weaker, relaxations for quadratically constrained quadratic programs
+Normal rank
@@ Property / cites work @@
+Globally solving nonconvex quadratic programming problems via completely positive programming
+Normal rank
@@ Property / cites work @@
+An improved characterisation of the interior of the completely positive cone
+Normal rank
@@ Property / cites work @@
+On the computational complexity of membership problems for the completely positive cone and its dual
+Normal rank
@@ Property / cites work @@
+Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
+Normal rank
@@ Property / cites work @@
+Partial Lagrangian relaxation for general quadratic programming
+Normal rank
@@ Property / cites work @@
+Semidefinite programming relaxation for nonconvex quadratic programs
+Normal rank
@@ Property / cites work @@
+Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
+Normal rank
@@ Property / cites work @@
+Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization
+Normal rank
@@ Property / cites work @@
+Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
+Normal rank
@@ Property / cites work @@
+A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
+Normal rank
@@ Property / cites work @@
+Global Optimization with Polynomials and the Problem of Moments
+Normal rank
@@ Property / cites work @@
+KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems
+Normal rank
@@ Property / cites work @@
+On extensions of the Frank-Wolfe theorems
@@ Property / cites work: On extensions of the Frank-Wolfe theorems / rank @@
+Normal rank
@@ Property / cites work @@
+On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
+Normal rank
@@ Property / cites work @@
+Some NP-complete problems in quadratic and nonlinear programming
+Normal rank
@@ Property / cites work @@
+Q4517108
@@ Property / cites work: Q4517108 / rank @@
+Normal rank
@@ Property / cites work @@
+A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
+Normal rank
@@ Property / cites work @@
+New results on the cp-rank and related properties of co(mpletely )positive matrices
+Normal rank
@@ Property / cites work @@
+Q3802887
@@ Property / cites work: Q3802887 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of approximating a KKT point of quadratic programming
+Normal rank