Tightening a copositive relaxation for standard quadratic optimization problems
From MaRDI portal
Publication:2376121
DOI10.1007/s10589-012-9522-7zbMath1294.90044WikidataQ57445430 ScholiaQ57445430MaRDI QIDQ2376121
Xiaoling Sun, Yong Xia, Ruey-Lin Sheu, Li, Duan
Publication date: 26 June 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-012-9522-7
semidefinite programming; duality gap; standard quadratic optimization problem; second-order cone program; minimal vertex cover; Shor's relaxation
90C22: Semidefinite programming
90C20: Quadratic programming
90C46: Optimality conditions and duality in mathematical programming
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On duality gap in binary quadratic programming
- Copositive programming motivated bounds on the stability and the chromatic numbers
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- Geometric algorithms and combinatorial optimization
- On standard quadratic optimization problems
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- D.C. versus copositive bounds for standard QP
- Computable representations for convex hulls of low-dimensional quadratic forms
- On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program
- Duality Gap Estimation of Linear Equality Constrained Binary Quadratic Programming
- On the Matrix Equation X′X = A
- A comparison of the Delsarte and Lovász bounds
- A New Algorithm for Generating All the Maximal Independent Sets
- On the Shannon capacity of a graph
- Semidefinite Programming
- Maxima for Graphs and a New Proof of a Theorem of Turán
- A Convex Quadratic Characterization of the Lovász Theta Number
- On copositive programming and standard quadratic optimization problems
