A successive quadratic programming algorithm for SDP relaxation of Max-Bisection

DOI10.1007/S11766-007-0408-XMaRDI QIDQ933068zbMATH OpenOpenAlexFDO

Authors Xuewen Mu, Ya-Ling Zhang, Sanyang Liu

Publication date 6 August 2008

Published in Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11766-007-0408-x

zbMATH Keywords

semidefinite programmingsuccessive quadratic programmingMax-Bisection

Mathematics Subject Classification ID

Methods of successive quadratic programming type (90C55) Semidefinite programming (90C22)

Recommendations

• A SUCCESSIVE QUADRATIC PROGRAMMING ALGORITHM FOR SDP RELAXATION OF THE BINARY QUADRATIC PROGRAMMING
• A successive linear programming algorithm for SDP relaxation of binary quadratic programming
• Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems
• A projected gradient algorithm for solving the maxcut SDP relaxation
• scientific article; zbMATH DE number 5209784

Cites work

• scientific article; zbMATH DE number 53965 (Why is no real title available?)
• scientific article; zbMATH DE number 5060354 (Why is no real title available?)
• A .699-approximation algorithm for Max-Bisection.
• An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design

Cited in

(4)

• Exact SDP relaxations for quadratic programs with bipartite graph structures
• A successive linear programming algorithm for SDP relaxation of binary quadratic programming
• A SUCCESSIVE QUADRATIC PROGRAMMING ALGORITHM FOR SDP RELAXATION OF THE BINARY QUADRATIC PROGRAMMING
• Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems

Describes a project that uses

Uses Software

• SDPpack

This page was built for publication: A successive quadratic programming algorithm for SDP relaxation of Max-Bisection

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