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...
Main Author: | Hoàng Ngọc Tuấn |
---|---|
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 |
Similar Items
-
Performance Analysis of Trust Region Subproblem Solvers for Limited-Memory Distributed BFGS Optimization Method
by: Guohua Gao, et al.
Published: (2021-05-01) -
Traveling salesman problem parallelization by solving clustered subproblems
by: Romanuke Vadim
Published: (2023-12-01) -
Treatment Of Errors On Shielding Finite Element Models Based On An Iterative Subproblem Approach
by: Hung Bui Duc, et al.
Published: (2022-05-01) -
On the global and linear convergence of direct extension of ADMM for 3-block separable convex minimization models
by: Huijie Sun, et al.
Published: (2016-09-01) -
A Lagrange Multiplier Method for Distributed Optimization Based on Multi-Agent Network With Private and Shared Information
by: Yan Zhao, et al.
Published: (2019-01-01)