On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces

DOI10.1137/070689127zbMath1161.49033arXiv0804.3647WikidataQ33681328 ScholiaQ33681328MaRDI QIDQ3629520

Yair Censor, Pini Gurfil, Dan Butnariu, Ethan Hadar

Publication date: 27 May 2009

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0804.3647

zbMATH Keywords

projection method; computational algorithms; convex feasibility problems

Mathematics Subject Classification ID

90C25: Convex programming

49M15: Newton-type methods

49M37: Numerical methods based on nonlinear programming