Convergence rate of the Pham Dinh- Le thi's algorithm for the trust-regio n subproblem
We obtain sufficient conditions for the linear convergence of the iterative sequences produced by the Pham Dinh-Le Thi Algorithm for the trust-region subproblem. In addition, we give two examples to show that, if the sufficient conditions are not satisfied, then the DCA sequences may not be linea...
Đã lưu trong:
Tác giả chính: | |
---|---|
Định dạng: | Bài viết |
Ngôn ngữ: | English |
Được phát hành: |
2014
|
Những chủ đề: | |
Truy cập trực tuyến: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/37441 |
Các nhãn: |
Thêm thẻ
Không có thẻ, Là người đầu tiên thẻ bản ghi này!
|
Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
---|
id |
oai:scholar.dlu.edu.vn:DLU123456789-37441 |
---|---|
record_format |
dspace |
spelling |
oai:scholar.dlu.edu.vn:DLU123456789-374412023-10-27T14:41:54Z Convergence rate of the Pham Dinh- Le thi's algorithm for the trust-regio n subproblem Hoàng, Ngọc Tuấn Trust-region subproblem KKT point We obtain sufficient conditions for the linear convergence of the iterative sequences produced by the Pham Dinh-Le Thi Algorithm for the trust-region subproblem. In addition, we give two examples to show that, if the sufficient conditions are not satisfied, then the DCA sequences may not be linearly convergent. Mathematics Subject Classification. 65K05, 65KIO, 90C20, 90C26, 90C30. 2014-05-29T08:37:25Z 2014-05-29T08:37:25Z 2013 Article https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/37441 en Tạp chí Khoa học Đại học Đà Lạt, số 3b;tr. 89-95 application/pdf |
institution |
Thư viện Trường Đại học Đà Lạt |
collection |
Thư viện số |
language |
English |
topic |
Trust-region subproblem KKT point |
spellingShingle |
Trust-region subproblem KKT point Hoàng, Ngọc Tuấn Convergence rate of the Pham Dinh- Le thi's algorithm for the trust-regio n subproblem |
description |
We obtain sufficient conditions for the linear convergence of the iterative
sequences produced by the Pham Dinh-Le Thi Algorithm for the trust-region subproblem.
In addition, we give two examples to show that, if the sufficient conditions
are not satisfied, then the DCA sequences may not be linearly convergent.
Mathematics Subject Classification. 65K05, 65KIO, 90C20, 90C26, 90C30. |
format |
Article |
author |
Hoàng, Ngọc Tuấn |
author_facet |
Hoàng, Ngọc Tuấn |
author_sort |
Hoàng, Ngọc Tuấn |
title |
Convergence rate of the Pham Dinh- Le thi's algorithm for the trust-regio n subproblem |
title_short |
Convergence rate of the Pham Dinh- Le thi's algorithm for the trust-regio n subproblem |
title_full |
Convergence rate of the Pham Dinh- Le thi's algorithm for the trust-regio n subproblem |
title_fullStr |
Convergence rate of the Pham Dinh- Le thi's algorithm for the trust-regio n subproblem |
title_full_unstemmed |
Convergence rate of the Pham Dinh- Le thi's algorithm for the trust-regio n subproblem |
title_sort |
convergence rate of the pham dinh- le thi's algorithm for the trust-regio n subproblem |
publishDate |
2014 |
url |
https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/37441 |
_version_ |
1819820128225722368 |