Vui lòng dùng định danh này để trích dẫn hoặc liên kết đến tài liệu này:
https://dspace.ctu.edu.vn/jspui/handle/123456789/12475
Toàn bộ biểu ghi siêu dữ liệu
Trường DC | Giá trị | Ngôn ngữ |
---|---|---|
dc.contributor.author | Nguyễn, Hiếu Thảo | - |
dc.date.accessioned | 2019-09-12T09:02:09Z | - |
dc.date.available | 2019-09-12T09:02:09Z | - |
dc.date.issued | 2018 | - |
dc.identifier.uri | http://dspace.ctu.edu.vn/jspui/handle/123456789/12475 | - |
dc.description.abstract | This paper proposes an algorithm for solving structured optimization problems, which covers both the backward–backward and the Douglas–Rachford algorithms as special cases, and analyzes its convergence. The set of fixed points of the corresponding operator is characterized in several cases. Convergence criteria of the algorithm in terms of general fixed point iterations are established. When applied to nonconvex feasibility including potentially inconsistent problems, we prove local linear convergence results under mild assumptions on regularity of individual sets and of the collection of sets. In this special case, we refine known linear convergence criteria for the Douglas–Rachford (DR) algorithm. As a consequence, for feasibility problem with one of the sets being affine, we establish criteria for linear and sublinear convergence of convex combinations of the alternating projection and the DR methods. These results seem to be new. We also demonstrate the seemingly improved numerical performance of this algorithm compared to the RAAR algorithm for both consistent and inconsistent sparse feasibility problems. | vi_VN |
dc.language.iso | en | vi_VN |
dc.relation.ispartofseries | Computational Optimization and Applications;70 .- p. 841-863 | - |
dc.subject | Almostaver agedness | vi_VN |
dc.subject | Picard iteration | vi_VN |
dc.subject | Alternating projection method | vi_VN |
dc.subject | Douglas–Rachford method | vi_VN |
dc.subject | RAAR algorithm | vi_VN |
dc.subject | Krasnoselski–Mann relaxation | vi_VN |
dc.subject | Metric subregularity | vi_VN |
dc.subject | Transversality | vi_VN |
dc.subject | Collection of sets | vi_VN |
dc.title | A convergent relaxation of the Douglas–Rachford algorithm | vi_VN |
dc.type | Article | vi_VN |
Bộ sưu tập: | Tạp chí quốc tế |
Các tập tin trong tài liệu này:
Tập tin | Mô tả | Kích thước | Định dạng | |
---|---|---|---|---|
_file_ | 650.4 kB | Adobe PDF | Xem | |
Your IP: 216.73.216.119 |
Khi sử dụng các tài liệu trong Thư viện số phải tuân thủ Luật bản quyền.