File(s) under permanent embargo
Alternating conditional gradient method for convex feasibility problems
journal contribution
posted on 2021-01-01, 00:00 authored by Reinier Diaz MillanReinier Diaz Millan, O P Ferreira, L F PrudenteThe classical convex feasibility problem in a finite dimensional Euclidean space consists of finding a point in the intersection of two convex sets. In the present paper we are interested in two particular instances of this problem. First, we assume to know how to compute an exact projection onto one of the sets involved and the other set is compact such that the conditional gradient (CondG) method can be used for computing efficiently an inexact projection on it. Second, we assume that both sets involved are compact such that the CondG method can be used for computing efficiently inexact projections on them. We combine alternating projection method with CondG method to design a new method, which can be seen as an inexact feasible version of alternate projection method. The proposed method generates two different sequences belonging to each involved set, which converge to a point in the intersection of them whenever it is not empty. If the intersection is empty, then the sequences converge to points in the respective sets whose distance between them is equal to the distance between the sets in consideration. Numerical experiments are provided to illustrate the practical behavior of the method.
History
Journal
Computational Optimization and ApplicationsVolume
80Pagination
245 - 269Publisher
SpringerLocation
Berlin, GemanyPublisher DOI
ISSN
0926-6003eISSN
1573-2894Language
engPublication classification
C1 Refereed article in a scholarly journalUsage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC