CONVERGENCE RATE OF THE PHAM DINH-L E THI'S ALGORITHM FOR THE TRUST-REGION 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 sub-problem. In addition, we give two examples to show that, if the sufficient conditions are not satisfied, then the DCA sequences may not be linearl...
Saved in:
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Dalat University
2012-09-01
|
Series: | Tạp chí Khoa học Đại học Đà Lạt |
Subjects: | |
Online Access: | https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/212 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1832571255588388864 |
---|---|
author | Hoàng Ngọc Tuấn |
author_facet | Hoàng Ngọc Tuấn |
author_sort | Hoàng Ngọc Tuấn |
collection | DOAJ |
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 sub-problem. 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. |
format | Article |
id | doaj-art-a50ba037742c42b4b4040c5aaef5d90d |
institution | Kabale University |
issn | 0866-787X |
language | English |
publishDate | 2012-09-01 |
publisher | Dalat University |
record_format | Article |
series | Tạp chí Khoa học Đại học Đà Lạt |
spelling | doaj-art-a50ba037742c42b4b4040c5aaef5d90d2025-02-02T12:46:55ZengDalat UniversityTạp chí Khoa học Đại học Đà Lạt0866-787X2012-09-012310.37569/DalatUniversity.2.3.212(2012)CONVERGENCE RATE OF THE PHAM DINH-L E THI'S ALGORITHM FOR THE TRUST-REGION SUBPROBLEMHoàng Ngọc Tuấn0Department of Mathematics, Hanoi Pedagogical University No.2We obtain sufficient conditions for the linear convergence of the iterative sequences produced by the Pham Dinh-Le Thi Algorithm for the trust-region sub-problem. 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.https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/212Trust-region subproblemKKT pointLagrange multiplierDCA sequenceConvergence rate |
spellingShingle | Hoàng Ngọc Tuấn CONVERGENCE RATE OF THE PHAM DINH-L E THI'S ALGORITHM FOR THE TRUST-REGION SUBPROBLEM Tạp chí Khoa học Đại học Đà Lạt Trust-region subproblem KKT point Lagrange multiplier DCA sequence Convergence rate |
title | CONVERGENCE RATE OF THE PHAM DINH-L E THI'S ALGORITHM FOR THE TRUST-REGION SUBPROBLEM |
title_full | CONVERGENCE RATE OF THE PHAM DINH-L E THI'S ALGORITHM FOR THE TRUST-REGION SUBPROBLEM |
title_fullStr | CONVERGENCE RATE OF THE PHAM DINH-L E THI'S ALGORITHM FOR THE TRUST-REGION SUBPROBLEM |
title_full_unstemmed | CONVERGENCE RATE OF THE PHAM DINH-L E THI'S ALGORITHM FOR THE TRUST-REGION SUBPROBLEM |
title_short | CONVERGENCE RATE OF THE PHAM DINH-L E THI'S ALGORITHM FOR THE TRUST-REGION SUBPROBLEM |
title_sort | convergence rate of the pham dinh l e thi s algorithm for the trust region subproblem |
topic | Trust-region subproblem KKT point Lagrange multiplier DCA sequence Convergence rate |
url | https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/212 |
work_keys_str_mv | AT hoangngoctuan convergencerateofthephamdinhlethisalgorithmforthetrustregionsubproblem |