dc.creatorCensor, Y
dc.creatorDe Pierro, AR
dc.creatorZaknoon, M
dc.date2004
dc.dateNOV
dc.date2014-11-14T10:22:29Z
dc.date2015-11-26T16:05:47Z
dc.date2014-11-14T10:22:29Z
dc.date2015-11-26T16:05:47Z
dc.date.accessioned2018-03-28T22:54:46Z
dc.date.available2018-03-28T22:54:46Z
dc.identifierNonlinear Analysis-theory Methods & Applications. Pergamon-elsevier Science Ltd, v. 59, n. 3, n. 385, n. 405, 2004.
dc.identifier0362-546X
dc.identifierWOS:000224657000008
dc.identifier10.1016/j.na.2004.07.018
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/74619
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/74619
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/74619
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1265792
dc.descriptionWe study a steered sequential gradient algorithm which minimizes the sum of convex functions by proceeding cyclically in the directions of the negative gradients of the functions and using steered step-sizes. This algorithm is applied to the convex feasibility problem by minimizing a proximity function which measures the sum of the Bregman distances to the members of the family of convex sets. The resulting algorithm is a new steered sequential Bregman projection method which generates sequences that converge if they are bounded, regardless of whether the convex feasibility problem is or is not consistent. For orthogonal projections and affine sets the boundedness condition is always fulfilled. (C) 2004 Elsevier Ltd. All rights reserved.
dc.description59
dc.description3
dc.description385
dc.description405
dc.languageen
dc.publisherPergamon-elsevier Science Ltd
dc.publisherOxford
dc.publisherInglaterra
dc.relationNonlinear Analysis-theory Methods & Applications
dc.relationNonlinear Anal.-Theory Methods Appl.
dc.rightsfechado
dc.rightshttp://www.elsevier.com/about/open-access/open-access-policies/article-posting-policy
dc.sourceWeb of Science
dc.subjectNonexpansive-mappings
dc.subjectFixed-points
dc.subjectGradient Methods
dc.subjectApproximation
dc.subjectAlgorithms
dc.subjectSpace
dc.titleSteered sequential projections for the inconsistent convex feasibility problem
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución