scientific article; zbMATH DE number 6310870

MaRDI QIDQ4980087zbMATH OpenFDO

Authors Wenlong Fu, Junchen Zhai, Tingsong Du

Publication date 30 June 2014

zbMATH Keywords

box constraintbranch and bound algorithmnonconvex quadratic programming

Mathematics Subject Classification ID

Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs
• A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
• A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
• An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
• A branch and bound algorithm for nonconvex quadratic programming with quadratic constraints
• A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems
• scientific article; zbMATH DE number 7366738
• Branch-and-bound decomposition approach for solving quasiconvex-concave programs
• Decomposition methods for solving nonconvex quadratic programs via branch and bound
• A new algorithm for the general quadratic programming problems with box constraints

Cited in

(11)

• A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
• A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems
• An optimal D.C. decomposition algorithm for quadratic program with a single quadratic constraint
• A branch and bound algorithm for nonconvex quadratic programming with quadratic constraints
• scientific article; zbMATH DE number 1795733 (Why is no real title available?)
• A branch and bound algorithm for a class of non-convex programming problems
• An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
• A new algorithm for the general quadratic programming problems with box constraints
• DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs
• Decomposition methods for solving nonconvex quadratic programs via branch and bound
• A new bound-and-reduce approach of nonconvex quadratic programming problems

This page was built for publication:

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