Tuan, Hoang; Yen, Nguyen - In: Journal of Global Optimization 55 (2013) 2, pp. 337-347
It is proved that any DCA sequence constructed by Pham Dinh–Le Thi’s algorithm for the trust-region subproblem (Pham Dinh and Le Thi, in SIAM J. Optim. 8:476–505, <CitationRef CitationID="CR13">1998</CitationRef>) converges to a Karush–Kuhn–Tucker point of the problem. This result provides a complete solution for one open...</citationref>
