A branch and bound algorithm for solving a class of D-C programming

DOI10.1016/j.amc.2004.06.016zbMath1076.65055MaRDI QIDQ1780534

Cheng-Xian Xu, Honggang Xue

Publication date: 13 June 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2004.06.016

zbMATH Keywords

numerical examples; branch and bound algorithm; \(\omega\)-subdivision; DC programming; largest distance bisection; normal rectangular subdivision

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C30: Nonlinear programming

90C55: Methods of successive quadratic programming type

Related Items

Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience, A branch and reduce approach for solving a class of low rank d.c. programs, Mean-variance portfolio optimal problem under concave transaction cost

Cites Work

• Unnamed Item
• Optimization on low rank nonconvex structures
• Introduction to global optimization
• Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
• An Algorithm for Separable Nonconvex Programming Problems
• Convex analysis and global optimization
• Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints