Abstract
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, 1998) converges to a Karush---Kuhn---Tucker point of the problem. This result provides a complete solution for one open question raised by Le Thi et al. (J. Global Optim., Online First, doi: 10.1007/s10898-011-9696-z , 2010).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
