Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem

The usual projection methods for solving convex feasibility problem (CFP) may lead to slow convergence for some starting points due to the 'tunnelling effect', which is connected with the monotone behaviour of the sequence and the exact orthogonal projection used in algorithms. To overcome...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Optimization Ročník 63; číslo 4; s. 571 - 584
Hlavní autoři: Dang, Yazheng, Gao, Yan
Médium: Journal Article
Jazyk:angličtina
Vydáno: Philadelphia Taylor & Francis Group 01.04.2014
Taylor & Francis LLC
Témata:
Algorithms
Construction
Convergence
Convex analysis
convex feasibility problem
Feasibility
Geometry
Mathematical problems
non-monotonous technique
nonsmoothness
Numerical analysis
Optimization
Projection
Studies
subgradient
Tunnelling
ISSN:0233-1934, 1029-4945
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The usual projection methods for solving convex feasibility problem (CFP) may lead to slow convergence for some starting points due to the 'tunnelling effect', which is connected with the monotone behaviour of the sequence and the exact orthogonal projection used in algorithms. To overcome the effect, in this article, we apply the non-monotonous technique to the subgradient projection algorithm, instead of the exact orthogonal projection algorithm, to construct a non-monotonous parallel subgradient projection algorithm for solving CFP. Under some mild conditions, the convergence is shown. Preliminary numerical experiments also show that the proposed algorithm converges faster than that of the monotonous algorithm.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0233-1934
1029-4945
DOI:10.1080/02331934.2012.677447