Aharoni, Ron; Censor, Yair; Jiang, Zilin Finding a best approximation pair of points for two polyhedra. (English) Zbl 1409.90126 Comput. Optim. Appl. 71, No. 2, 509-523 (2018). MSC: 90C20 90C25 65K05 PDFBibTeX XMLCite \textit{R. Aharoni} et al., Comput. Optim. Appl. 71, No. 2, 509--523 (2018; Zbl 1409.90126) Full Text: DOI arXiv
Aragón Artacho, Francisco J.; Campoy, Rubén A new projection method for finding the closest point in the intersection of convex sets. (English) Zbl 1464.47035 Comput. Optim. Appl. 69, No. 1, 99-132 (2018). Reviewer: Alberto Seeger (Avignon) MSC: 47J25 47H09 47N10 90C25 PDFBibTeX XMLCite \textit{F. J. Aragón Artacho} and \textit{R. Campoy}, Comput. Optim. Appl. 69, No. 1, 99--132 (2018; Zbl 1464.47035) Full Text: DOI arXiv
Censor, Yair; Zaslavski, Alexander J. Convergence and perturbation resilience of dynamic string-averaging projection methods. (English) Zbl 1285.90079 Comput. Optim. Appl. 54, No. 1, 65-76 (2013). MSC: 90C48 PDFBibTeX XMLCite \textit{Y. Censor} and \textit{A. J. Zaslavski}, Comput. Optim. Appl. 54, No. 1, 65--76 (2013; Zbl 1285.90079) Full Text: DOI arXiv
Censor, Yair; Chen, Wei; Combettes, Patrick L.; Davidi, Ran; Herman, Gabor T. On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints. (English) Zbl 1244.90155 Comput. Optim. Appl. 51, No. 3, 1065-1088 (2012). MSC: 90C05 PDFBibTeX XMLCite \textit{Y. Censor} et al., Comput. Optim. Appl. 51, No. 3, 1065--1088 (2012; Zbl 1244.90155) Full Text: DOI arXiv HAL
Lucet, Yves; Bauschke, Heinz H.; Trienis, Mike The piecewise linear-quadratic model for computational convex analysis. (English) Zbl 1186.90089 Comput. Optim. Appl. 43, No. 1, 95-118 (2009). Reviewer: Ya-Ping Fang (Chengdu) MSC: 90C25 65D15 68Q25 PDFBibTeX XMLCite \textit{Y. Lucet} et al., Comput. Optim. Appl. 43, No. 1, 95--118 (2009; Zbl 1186.90089) Full Text: DOI Link