Paper Info
Title
Convergence of Pham Dinh---Le Thi's algorithm for the trust-region subproblem
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).
Year
DOI
Venue
2013
10.1007/s10898-011-9820-0
J. Global Optimization
Keywords
Field
DocType
pham dinh,siam j. optim,open question,trust-region subproblem,dca sequence,j. global optim,le thi,complete solution,online first,le thi et,convergence
Convergence (routing),Trust region,Mathematical optimization,Algorithm,Mathematics
Journal
Volume
Issue
ISSN
55
2
0925-5001
Citations 
PageRank 
References 
7
0.65
7
Authors
2
Name
Order
Citations
PageRank
Hoang Ngoc Tuan1101.71
Nguyen Dong Yen2495.79