Ridolfi, Andrea B.; Vera de Serio, Virginia N. A radius of robust feasibility for uncertain farthest Voronoi cells. (English) Zbl 1511.52019 Set-Valued Var. Anal. 31, No. 1, Paper No. 11, 17 p. (2023). MSC: 52C22 90C34 PDFBibTeX XMLCite \textit{A. B. Ridolfi} and \textit{V. N. Vera de Serio}, Set-Valued Var. Anal. 31, No. 1, Paper No. 11, 17 p. (2023; Zbl 1511.52019) Full Text: DOI
Gutman, David Huckleberry Enhanced basic procedures for the projection and rescaling algorithm. (English) Zbl 1434.90134 Optim. Lett. 13, No. 6, 1259-1267 (2019). MSC: 90C25 52B12 65K05 90C60 PDFBibTeX XMLCite \textit{D. H. Gutman}, Optim. Lett. 13, No. 6, 1259--1267 (2019; Zbl 1434.90134) Full Text: DOI arXiv
Hermer, Neal; Luke, D. Russell; Sturm, Anja Random function iterations for consistent stochastic feasibility. (English) Zbl 1411.60107 Numer. Funct. Anal. Optim. 40, No. 4, 386-420 (2019). MSC: 60J05 52A22 49J55 49J53 65K05 PDFBibTeX XMLCite \textit{N. Hermer} et al., Numer. Funct. Anal. Optim. 40, No. 4, 386--420 (2019; Zbl 1411.60107) Full Text: DOI arXiv
Artinescu, Irina Maria A comparative analysis of the convergence regions for different parallel affine projection algorithms. (English) Zbl 1438.52002 Stud. Univ. Babeș-Bolyai, Math. 63, No. 3, 401-411 (2018). MSC: 52A10 PDFBibTeX XMLCite \textit{I. M. Artinescu}, Stud. Univ. Babeș-Bolyai, Math. 63, No. 3, 401--411 (2018; Zbl 1438.52002) Full Text: DOI
Kohl, Florian; Li, Yanxi; Rauh, Johannes; Yoshida, Ruriko Semigroups – a computational approach. (English) Zbl 1437.11166 Hibi, Takayuki (ed.), The 50th anniversary of Gröbner bases. Proceedings of the 8th Mathematical Society of Japan-Seasonal Institute (MSJ-SI 2015), Osaka, Japan, July 1–10, 2015. Tokyo: Mathematical Society of Japan (MSJ). Adv. Stud. Pure Math. 77, 155-170 (2018). MSC: 11Y50 11D04 11P21 52B11 90C08 PDFBibTeX XMLCite \textit{F. Kohl} et al., Adv. Stud. Pure Math. 77, 155--170 (2018; Zbl 1437.11166) Full Text: arXiv
Bauschke, H. H.; Noll, D. On the local convergence of the Douglas-Rachford algorithm. (English) Zbl 1344.47044 Arch. Math. 102, No. 6, 589-600 (2014). MSC: 47J25 52A20 90C26 PDFBibTeX XMLCite \textit{H. H. Bauschke} and \textit{D. Noll}, Arch. Math. 102, No. 6, 589--600 (2014; Zbl 1344.47044) Full Text: DOI arXiv
Betke, Ulrich Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem. (English) Zbl 1073.90028 Discrete Comput. Geom. 32, No. 3, 317-338 (2004). Reviewer: Gabriela Cristescu (Arad) MSC: 90C25 52B55 68U05 90C27 PDFBibTeX XMLCite \textit{U. Betke}, Discrete Comput. Geom. 32, No. 3, 317--338 (2004; Zbl 1073.90028) Full Text: DOI arXiv
Bauschke, Heinz H.; Noll, Dominikus The method of forward projections. (English) Zbl 1107.90426 J. Nonlinear Convex Anal. 3, No. 2, 191-205 (2002). MSC: 90C25 52A41 65K05 PDFBibTeX XMLCite \textit{H. H. Bauschke} and \textit{D. Noll}, J. Nonlinear Convex Anal. 3, No. 2, 191--205 (2002; Zbl 1107.90426)
Bauschke, Heinz H.; Borwein, Jonathan M.; Lewis, Adrian S. The method of cyclic projections for closed convex sets in Hilbert space. (English) Zbl 0874.47029 Censor, Yair (ed.) et al., Recent developments in optimization theory and nonlinear analysis. AMS/IMU special session on optimization and nonlinear analysis, May 24–26, 1995, Jerusalem, Israel. Providence, RI: American Mathematical Society. Contemp. Math. 204, 1-38 (1997). MSC: 47H09 47N10 90C25 46N10 52A05 65F10 92C55 PDFBibTeX XMLCite \textit{H. H. Bauschke} et al., Contemp. Math. 204, 1--38 (1997; Zbl 0874.47029)
Combettes, P. L. Hilbertian convex feasibility problem: Convergence of projection methods. (English) Zbl 0872.90069 Appl. Math. Optimization 35, No. 3, 311-330 (1997). MSC: 90C25 52A41 65J05 40A05 90C48 PDFBibTeX XMLCite \textit{P. L. Combettes}, Appl. Math. Optim. 35, No. 3, 311--330 (1997; Zbl 0872.90069) Full Text: DOI
Butnariu, Dan; Censor, Yair Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces. (English) Zbl 0814.65053 J. Comput. Appl. Math. 53, No. 1, 33-42 (1994). Reviewer: J.Vaníček (Praha) MSC: 65J05 46C05 52A05 PDFBibTeX XMLCite \textit{D. Butnariu} and \textit{Y. Censor}, J. Comput. Appl. Math. 53, No. 1, 33--42 (1994; Zbl 0814.65053) Full Text: DOI
Goffin, Jean-Louis; Luo, Zhi-Quan; Ye, Yinyu On the complexity of a column generation algorithm for convex or quasiconvex feasibility problems. (English) Zbl 0818.90086 Hager, W. W. (ed.) et al., Large scale optimization. State of the art. Papers presented at the conference, held February 15-17, 1993 at the University of Florida, Gainesville, FL, USA. Dordrecht: Kluwer Academic Publishers. 182-191 (1994). MSC: 90C25 52B55 52A40 PDFBibTeX XMLCite \textit{J.-L. Goffin} et al., in: Large scale optimization. State of the art. Papers presented at the conference, held February 15-17, 1993 at the University of Florida, Gainesville, FL, USA. Dordrecht: Kluwer Academic Publishers. 182--191 (1994; Zbl 0818.90086)
García-Palomares, Ubaldo Parallel projected aggregation methods for solving the convex feasibility problem. (English) Zbl 0791.90042 SIAM J. Optim. 3, No. 4, 882-900 (1993). MSC: 90C25 52A40 65Y05 52A41 PDFBibTeX XMLCite \textit{U. García-Palomares}, SIAM J. Optim. 3, No. 4, 882--900 (1993; Zbl 0791.90042) Full Text: DOI
Kannan, Ravi Test sets for integer programs, \(\forall \exists\) sentences. (English) Zbl 0728.90062 Polyhedral combinatorics, Proc. Workshop, Morristown/NJ (USA) 1989, DIMACS, Ser. Discret. Math. Theor. Comput. Sci. 1, 39-47 (1990). Reviewer: R.Kannan MSC: 90C10 03D15 52B12 90C31 PDFBibTeX XML
Iusem, Alfredo N.; Moledo, Leonardo A finitely convergent method of simultaneous subgradient projections for the convex feasibility problem. (English) Zbl 0625.90079 Mat. Apl. Comput. 5, 169-184 (1986). MSC: 90C30 15A39 52A40 PDFBibTeX XMLCite \textit{A. N. Iusem} and \textit{L. Moledo}, Mat. Apl. Comput. 5, 169--184 (1986; Zbl 0625.90079)
Censor, Yair Iterative methods for the convex feasibility problem. (English) Zbl 0571.90068 Convexity and graph theory, Proc. Conf., Israel 1981, Ann. Discrete Math. 20, 83-91 (1984). MSC: 90C25 15A39 52A40 PDFBibTeX XML
Pierra, G. Decomposition through formalization in a product space. (English) Zbl 0523.49022 Math. Program. 28, 96-115 (1984). MSC: 49M27 52A40 90C25 52A07 49M25 49M30 65K05 PDFBibTeX XMLCite \textit{G. Pierra}, Math. Program. 28, 96--115 (1984; Zbl 0523.49022) Full Text: DOI
Aharoni, Ron; Berman, Abraham; Censor, Yair An interior points algorithm for the convex feasibility problem. (English) Zbl 0489.52005 Adv. Appl. Math. 4, 479-489 (1983). MSC: 52A20 PDFBibTeX XMLCite \textit{R. Aharoni} et al., Adv. Appl. Math. 4, 479--489 (1983; Zbl 0489.52005) Full Text: DOI