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...

Full description

Saved in:

Bibliographic Details
Published in:	Optimization Vol. 63; no. 4; pp. 571 - 584
Main Authors:	Dang, Yazheng, Gao, Yan
Format:	Journal Article
Language:	English
Published:	Philadelphia Taylor & Francis Group 01.04.2014 Taylor & Francis LLC
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!