Solving a class of linearly constrained indefinite quadratic problems by DC algorithms (Q1368737): Difference between revisions

Linearly constrained indefinite quadratic problems play an important role in global optimization. In this paper, the authors study DC theory and its local approach to such problems. The new algorithm, CDA, efficiently produces local optima and, sometimes, global optima. Moreover, the authors propose a decomposition branch-and-bound method for globally solving these problems. Finally, many numerical simulations are reported.