Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained quadratic optimization problems
From MaRDI portal
(Redirected from Publication:5501200)
Recommendations
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
- Copositive realxation for genera quadratic programming
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- Simplified copositive and Lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables
- Lagrangian-conic relaxations. I: A unified framework and its applications to quadratic optimization problems
Cites work
- A Frank--Wolfe type theorem for convex polynomial programs
- A fresh CP look at mixed-binary QPs: new formulations and relaxations
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- A note on Burer's copositive representation of mixed-binary QPs
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Algorithmic copositivity detection by simplicial partition
- Alternative theorems for quadratic inequality systems and global quadratic optimization
- An adaptive linear approximation algorithm for copositive programs
- An improved characterisation of the interior of the completely positive cone
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
- Copositive optimization -- recent developments and applications
- Copositive programming
- Faster, but weaker, relaxations for quadratically constrained quadratic programs
- Global optimization with polynomials and the problem of moments
- Globally solving nonconvex quadratic programming problems via completely positive programming
- scientific article; zbMATH DE number 4070633 (Why is no real title available?)
- scientific article; zbMATH DE number 1534299 (Why is no real title available?)
- KKT solution and conic relaxation for solving quadratically constrained quadratic programming problems
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
- New lower bounds and asymptotics for the cp-rank
- New results on the cp-rank and related properties of co(mpletely) positive matrices
- On conic QPCCs, conic QCQPs and completely positive programs
- On extensions of the Frank-Wolfe theorems
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
- On the complexity of approximating a KKT point of quadratic programming
- On the computational complexity of membership problems for the completely positive cone and its dual
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Partial Lagrangian relaxation for general quadratic programming
- Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
- Semidefinite programming relaxation for nonconvex quadratic programs
- Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Simplified copositive and Lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables
- Some NP-complete problems in quadratic and nonlinear programming
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
Cited in
(27)- A fresh CP look at mixed-binary QPs: new formulations and relaxations
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
- Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma
- A new algorithm for concave quadratic programming
- Strong duality for general quadratic programs with quadratic equality constraints
- Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0-1 optimization problems with linear constraints
- Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality
- Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- Interplay of non-convex quadratically constrained problems with adjustable robust optimization
- New bounds for nonconvex quadratically constrained quadratic programming
- Conic formulation of QPCCs applied to truly sparse QPs
- Lagrangian quadratic bounds in polynomial nonconvex and Boolean models with superfluous constraints
- Copositivity for second-order optimality conditions in general smooth optimization problems
- Simplified copositive and Lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables
- Kronecker product constraints with an application to the two-trust-region subproblem
- Exactness conditions for an SDP relaxation of the extended trust region problem
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- Lagrangian-conic relaxations. I: A unified framework and its applications to quadratic optimization problems
- Optimization under uncertainty and risk: quadratic and copositive approaches
- (Global) optimization: historical notes and recent developments
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- Generating extreme copositive matrices near matrices obtained from COP-irreducible graphs
- Nonconvex homogeneous optimization: a general framework and optimality conditions of first and second-order
- Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
This page was built for publication: Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained quadratic optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501200)
