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žené v:

Podrobná bibliografia
Vydané v:	Optimization Ročník 63; číslo 4; s. 571 - 584
Hlavní autori:	Dang, Yazheng, Gao, Yan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Philadelphia Taylor & Francis Group 01.04.2014 Taylor & Francis LLC
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!