A Hybrid Gradient-Projection Algorithm for Averaged Mappings in Hilbert Spaces

It is well known that the gradient-projection algorithm (GPA) is very useful in solving constrained convex minimization problems. In this paper, we combine a general iterative method with the gradient-projection algorithm to propose a hybrid gradient-projection algorithm and prove that the sequence...

Full description

Saved in:
Bibliographic Details
Main Authors: Ming Tian, Min-Min Li
Format: Article
Language:English
Published: Wiley 2012-01-01
Series:Journal of Applied Mathematics
Online Access:http://dx.doi.org/10.1155/2012/782960
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1849414335418335232
author Ming Tian
Min-Min Li
author_facet Ming Tian
Min-Min Li
author_sort Ming Tian
collection DOAJ
description It is well known that the gradient-projection algorithm (GPA) is very useful in solving constrained convex minimization problems. In this paper, we combine a general iterative method with the gradient-projection algorithm to propose a hybrid gradient-projection algorithm and prove that the sequence generated by the hybrid gradient-projection algorithm converges in norm to a minimizer of constrained convex minimization problems which solves a variational inequality.
format Article
id doaj-art-6daab64f06a74f62b3c8bb950a8d42c9
institution Kabale University
issn 1110-757X
1687-0042
language English
publishDate 2012-01-01
publisher Wiley
record_format Article
series Journal of Applied Mathematics
spelling doaj-art-6daab64f06a74f62b3c8bb950a8d42c92025-08-20T03:33:52ZengWileyJournal of Applied Mathematics1110-757X1687-00422012-01-01201210.1155/2012/782960782960A Hybrid Gradient-Projection Algorithm for Averaged Mappings in Hilbert SpacesMing Tian0Min-Min Li1College of Science, Civil Aviation University of China, Tianjin 300300, ChinaCollege of Science, Civil Aviation University of China, Tianjin 300300, ChinaIt is well known that the gradient-projection algorithm (GPA) is very useful in solving constrained convex minimization problems. In this paper, we combine a general iterative method with the gradient-projection algorithm to propose a hybrid gradient-projection algorithm and prove that the sequence generated by the hybrid gradient-projection algorithm converges in norm to a minimizer of constrained convex minimization problems which solves a variational inequality.http://dx.doi.org/10.1155/2012/782960
spellingShingle Ming Tian
Min-Min Li
A Hybrid Gradient-Projection Algorithm for Averaged Mappings in Hilbert Spaces
Journal of Applied Mathematics
title A Hybrid Gradient-Projection Algorithm for Averaged Mappings in Hilbert Spaces
title_full A Hybrid Gradient-Projection Algorithm for Averaged Mappings in Hilbert Spaces
title_fullStr A Hybrid Gradient-Projection Algorithm for Averaged Mappings in Hilbert Spaces
title_full_unstemmed A Hybrid Gradient-Projection Algorithm for Averaged Mappings in Hilbert Spaces
title_short A Hybrid Gradient-Projection Algorithm for Averaged Mappings in Hilbert Spaces
title_sort hybrid gradient projection algorithm for averaged mappings in hilbert spaces
url http://dx.doi.org/10.1155/2012/782960
work_keys_str_mv AT mingtian ahybridgradientprojectionalgorithmforaveragedmappingsinhilbertspaces
AT minminli ahybridgradientprojectionalgorithmforaveragedmappingsinhilbertspaces
AT mingtian hybridgradientprojectionalgorithmforaveragedmappingsinhilbertspaces
AT minminli hybridgradientprojectionalgorithmforaveragedmappingsinhilbertspaces