A SUCCESSIVE QUADRATIC PROGRAMMING ALGORITHM FOR SDP RELAXATION OF THE BINARY QUADRATIC PROGRAMMING

DOI10.4134/BKMS.2005.42.4.837MaRDI QIDQ3369951zbMATH OpenOpenAlexFDO

Authors Xuewen Mu, Ya-Ling Zhang, Sanyang Liu

Publication date 6 February 2006

Published in Bulletin of the Korean Mathematical Society (Search for Journal in Brave)

Full work available at URL http://www.mathnet.or.kr/mathnet/kms_tex/983771.pdf

zbMATH Keywords

binary quadratic programmingrandomized methodsemidefinite programmingsuccessive quadratic programming algorithm

Mathematics Subject Classification ID

Boolean programming (90C09) Quadratic programming (90C20) Semidefinite programming (90C22) Methods of successive quadratic programming type (90C55)

Recommendations

• A successive linear programming algorithm for SDP relaxation of binary quadratic programming
• A successive quadratic programming algorithm for SDP relaxation of Max-Bisection
• Successive convex relaxation approach to bilevel quadratic optimization problems
• A new successive quadratic programming algorithm
• Relaxation and bounding algorithm based on binary mean inequality for quadratically constrained quadratic programming problems
• A successive quadratic programming algorithm with global and superlinear convergence properties
• A successive quadratic programming method for a class of constrained nonsmooth optimization problems
• scientific article; zbMATH DE number 4158404
• scientific article; zbMATH DE number 3963585
• SDP relaxations for quadratic optimization problems derived from polynomial optimization problems

Cited in

(6)

• A rank-two feasible direction algorithm for the binary quadratic programming
• Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems
• A successive linear programming algorithm for SDP relaxation of binary quadratic programming
• An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
• An entropy-regularized ADMM for binary quadratic programming
• A successive quadratic programming algorithm for SDP relaxation of Max-Bisection

This page was built for publication: A SUCCESSIVE QUADRATIC PROGRAMMING ALGORITHM FOR SDP RELAXATION OF THE BINARY QUADRATIC PROGRAMMING

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