A new accelerated self-adaptive projection algorithm for multiple output split feasibility problems

View at publisher Summarise with VIRAT
Authors: Trần Văn Thắng
Cited by: 0
References: 44

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

This paper presents an accelerated self-adaptive projection algorithm designed to solve a class of split convex feasibility problem involving several output sets within real Hilbert spaces. The proposed approach relies on the projection method for the associated variational inequalities and incorporates self-adaptive step sizes, that do not require knowledge of the norms of the shift operators and have positive lower bounds. We establish the convergence of the sequences produced by the method. Additionally, numerical experiments have been conducted to evaluate the performance of the proposed methods in comparison with several recently developed algorithms.

Fields of Study & Subjects

Optimization and Variational Analysis Sparse and Compressive Sensing Techniques Contact Mechanics and Variational Inequalities

Publication details

Journal / source
Optimization
Pages
1–21
Publication date
25 March 2026
Language
EN