The University of Southampton
University of Southampton Institutional Repository

A gradient projection method for solving split equality and split feasibility problems in Hilbert spaces

A gradient projection method for solving split equality and split feasibility problems in Hilbert spaces
A gradient projection method for solving split equality and split feasibility problems in Hilbert spaces
In this paper, we first study in a Hilbertian framework the weak convergence of a general Gradient Projection Algorithm for minimizing a convex function of class over a convex constraint set. The way of selecting the stepsizes corresponds to the one used by López et al. for the particular case of the Split Feasibility Problem. This choice allows us to avoid the computation of operator norms. Afterwards, a relaxed version of the Gradient Projection Algorithm is considered where the feasible set is approximated by half-spaces making the projections explicit. Finally, to get the strong convergence, each step of the general Gradient Projection Method is combined with a viscosity step. This is done by adapting Halpern’s algorithm to our problem. The general scheme is then applied to the Split Equality Problem, and also to the Split Feasibility Problem.
0233-1934
2321-2341
Vuong, Phan Tu
52577e5d-ebe9-4a43-b5e7-68aa06cfdcaf
Strodiot, Jean Jacques
31543686-3a24-46f8-87f7-0c3af6b86c98
Nguyen, Van Hien
04d3ee42-be73-46df-8709-4c3d0ece2158
Vuong, Phan Tu
52577e5d-ebe9-4a43-b5e7-68aa06cfdcaf
Strodiot, Jean Jacques
31543686-3a24-46f8-87f7-0c3af6b86c98
Nguyen, Van Hien
04d3ee42-be73-46df-8709-4c3d0ece2158

Vuong, Phan Tu, Strodiot, Jean Jacques and Nguyen, Van Hien (2015) A gradient projection method for solving split equality and split feasibility problems in Hilbert spaces. Optimization, 64 (11), 2321-2341. (doi:10.1080/02331934.2014.967237).

Record type: Article

Abstract

In this paper, we first study in a Hilbertian framework the weak convergence of a general Gradient Projection Algorithm for minimizing a convex function of class over a convex constraint set. The way of selecting the stepsizes corresponds to the one used by López et al. for the particular case of the Split Feasibility Problem. This choice allows us to avoid the computation of operator norms. Afterwards, a relaxed version of the Gradient Projection Algorithm is considered where the feasible set is approximated by half-spaces making the projections explicit. Finally, to get the strong convergence, each step of the general Gradient Projection Method is combined with a viscosity step. This is done by adapting Halpern’s algorithm to our problem. The general scheme is then applied to the Split Equality Problem, and also to the Split Feasibility Problem.

This record has no associated files available for download.

More information

Accepted/In Press date: 9 September 2014
e-pub ahead of print date: 9 October 2014
Published date: 2 November 2015

Identifiers

Local EPrints ID: 434642
URI: http://eprints.soton.ac.uk/id/eprint/434642
ISSN: 0233-1934
PURE UUID: 9d29bc0e-f836-44ce-afbf-b5746cda16db
ORCID for Phan Tu Vuong: ORCID iD orcid.org/0000-0002-1474-994X

Catalogue record

Date deposited: 04 Oct 2019 16:30
Last modified: 16 Mar 2024 04:42

Export record

Altmetrics

Contributors

Author: Phan Tu Vuong ORCID iD
Author: Jean Jacques Strodiot
Author: Van Hien Nguyen

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×