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

DOI10.1007/S11766-007-0408-XzbMATH Open1150.90005OpenAlexW2085394420MaRDI QIDQ933068FDOQ933068

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

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

zbMATH Keywords

semidefinite programmingsuccessive quadratic programmingMax-Bisection

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
• A .699-approximation algorithm for Max-Bisection.
• Title not available (Why is that?)

Cited In (4)

• 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
• Exact SDP relaxations for quadratic programs with bipartite graph structures

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)