Tightening a copositive relaxation for standard quadratic optimization problems

DOI10.1007/S10589-012-9522-7MaRDI QIDQ2376121zbMATH OpenOpenAlexWikidataFDO

Authors Yong Xia, Xiaoling Sun, Ruey-Lin Sheu, Duan Li

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

zbMATH Keywords

duality gapminimal vertex coversecond-order cone programsemidefinite programmingShor's relaxationstandard quadratic optimization problem

Mathematics Subject Classification ID

Quadratic programming (90C20) Semidefinite programming (90C22) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
• Copositive realxation for genera quadratic programming
• D.C. versus copositive bounds for standard QP
• On standard quadratic programs with exact and inexact doubly nonnegative relaxations
• On standard quadratic optimization problems

Cites work

• A comparison of the Delsarte and Lovász bounds
• A Convex Quadratic Characterization of the Lovász Theta Number
• A New Algorithm for Generating All the Maximal Independent Sets
• Complexity results on graphs with few cliques
• Computable representations for convex hulls of low-dimensional quadratic forms
• Copositive programming motivated bounds on the stability and the chromatic numbers
• D.C. versus copositive bounds for standard QP
• Duality gap estimation of linear equality constrained binary quadratic programming
• Geometric algorithms and combinatorial optimization
• scientific article; zbMATH DE number 3634289 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 1460605 (Why is no real title available?)
• Maxima for Graphs and a New Proof of a Theorem of Turán
• New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
• On copositive programming and standard quadratic optimization problems
• On duality gap in binary quadratic programming
• On standard quadratic optimization problems
• On the Matrix Equation X′X = A
• On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program
• On the Shannon capacity of a graph
• Semidefinite Programming
• Semidefinite programming and integer programming
• Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming

Cited in

(6)

• On standard quadratic programs with exact and inexact doubly nonnegative relaxations
• A survey of hidden convex optimization
• D.C. versus copositive bounds for standard QP
• Trust your data or not -- StQP remains StQP: community detection via robust standard quadratic optimization
• On copositive programming and standard quadratic optimization problems
• A strengthened SDP relaxation for quadratic optimization over the Stiefel manifold

This page was built for publication: Tightening a copositive relaxation for standard quadratic optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376121)