{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T15:47:24Z","timestamp":1770565644927,"version":"3.49.0"},"reference-count":76,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,3,2]],"date-time":"2018-03-02T00:00:00Z","timestamp":1519948800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"The Federal Ministry of Education and Research of Germany","award":["01IB13001"],"award-info":[{"award-number":["01IB13001"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s10589-018-9991-4","type":"journal-article","created":{"date-parts":[[2018,3,2]],"date-time":"2018-03-02T09:42:13Z","timestamp":1519983733000},"page":"737-762","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A generalized projection-based scheme for solving convex constrained optimization problems"],"prefix":"10.1007","volume":"70","author":[{"given":"Aviv","family":"Gibali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karl-Heinz","family":"K\u00fcfer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Reem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp","family":"S\u00fcss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,2]]},"reference":[{"key":"9991_CR1","doi-asserted-by":"publisher","first-page":"382","DOI":"10.4153\/CJM-1954-037-2","volume":"6","author":"S Agmon","year":"1954","unstructured":"Agmon, S.: The relaxation method for linear inequalities. Can. J. Math. 6, 382\u2013392 (1954)","journal-title":"Can. J. Math."},{"key":"9991_CR2","unstructured":"Amelunxen, D.: Geometric analysis of the condition of the convex feasibility problem. Ph. D. Dissertation, University of Paderborn (2011)"},{"key":"9991_CR3","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"HH Bauschke","year":"1996","unstructured":"Bauschke, H.H., Borwein, J.M.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38, 367\u2013426 (1996)","journal-title":"SIAM Rev."},{"key":"9991_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn. Springer, Berlin (2017)","edition":"2"},{"key":"9991_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/conm\/636\/12726","volume":"636","author":"HH Bauschke","year":"2015","unstructured":"Bauschke, H.H., Koch, V.R.: Projection methods: Swiss army knives for solving feasibility and best approximation problems with halfspaces. Contemp. Math. 636, 1\u201340 (2015)","journal-title":"Contemp. Math."},{"key":"9991_CR6","doi-asserted-by":"publisher","DOI":"10.1002\/0471787779","volume-title":"Nonlinear Programming: Theory and Algorithms","author":"MS Bazaraa","year":"2006","unstructured":"Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming: Theory and Algorithms, 3rd edn. Wiley, Hoboken (2006)","edition":"3"},{"key":"9991_CR7","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (1999)","edition":"2"},{"key":"9991_CR8","doi-asserted-by":"publisher","first-page":"3614","DOI":"10.1109\/TSP.2006.879312","volume":"54","author":"D Blatt","year":"2006","unstructured":"Blatt, D., Hero III, A.O.: Energy based sensor network source localization via projection onto convex sets (POCS). IEEE Trans. Signal Process. 54, 3614\u20133619 (2006)","journal-title":"IEEE Trans. Signal Process."},{"key":"9991_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"SP Boyd","year":"2004","unstructured":"Boyd, S.P., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"9991_CR10","unstructured":"Boyd, S., Vandenberghe, L.: Localization and Cutting-Plane Methods, Lecture Topics and Notes (2008). https:\/\/see.stanford.edu\/materials\/lsocoee364b\/05-localization_methods_notes.pdf"},{"key":"9991_CR11","unstructured":"Boyd, S., Park, J.: Subgradient Methods, Notes for EE364b, Stanford University, (2014). https:\/\/stanford.edu\/class\/ee364b\/lectures\/subgrad_method_notes.pdf"},{"key":"9991_CR12","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1137\/070689127","volume":"19","author":"D Butnariu","year":"2008","unstructured":"Butnariu, D., Censor, Y., Gurfil, P., Hadar, E.: On the behavior of subgradient projections methods for convex feasibility problems in Euclidean spaces. SIAM J. Optim. 19, 786\u2013807 (2008)","journal-title":"SIAM J. Optim."},{"key":"9991_CR13","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1109\/JSTSP.2007.910263","volume":"1","author":"D Butnariu","year":"2007","unstructured":"Butnariu, D., Davidi, R., Herman, G.T., Kazantsev, I.G.: Stable convergence behavior under summable perturbations of a class of projection methods for convex feasibility and optimization problems. IEEE J. Sel. Top. Signal Process. 1, 540\u2013547 (2007)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"9991_CR14","doi-asserted-by":"publisher","first-page":"1295","DOI":"10.1088\/0266-5611\/15\/5\/313","volume":"15","author":"C Byrne","year":"1999","unstructured":"Byrne, C.: Iterative projection onto convex sets using multiple Bregman distances. Inverse Probl. 15, 1295\u20131313 (1999)","journal-title":"Inverse Probl."},{"key":"9991_CR15","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1088\/0266-5611\/20\/1\/006","volume":"20","author":"C Byrne","year":"2004","unstructured":"Byrne, C.: A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Probl. 20, 103\u2013120 (2004)","journal-title":"Inverse Probl."},{"key":"9991_CR16","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s101070050068","volume":"85","author":"A Cegielski","year":"1999","unstructured":"Cegielski, A.: A method of projection onto an acute cone with level control in convex minimization. Math. Program. 85, 469\u2013490 (1999)","journal-title":"Math. Program."},{"key":"9991_CR17","doi-asserted-by":"publisher","first-page":"2343","DOI":"10.1080\/02331934.2014.957701","volume":"64","author":"A Cegielski","year":"2015","unstructured":"Cegielski, A., Censor, Y.: Projection methods: an annotated bibliography of books and reviews. Optimization 64, 2343\u20132358 (2015)","journal-title":"Optimization"},{"key":"9991_CR18","doi-asserted-by":"publisher","first-page":"97","DOI":"10.7151\/dmdico.1034","volume":"22","author":"A Cegielski","year":"2002","unstructured":"Cegielski, A., Dylewski, R.: Selection strategies in a projection method for convex minimization problems. Discuss. Math. Differ. Incl. Control Optim. 22, 97\u2013123 (2002)","journal-title":"Discuss. Math. Differ. Incl. Control Optim."},{"key":"9991_CR19","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1080\/0233193031000079883","volume":"52","author":"A Cegielski","year":"2003","unstructured":"Cegielski, A., Dylewski, R.: Residual selection in a projection method for convex minimization problems. Optimization 52, 211\u2013220 (2003)","journal-title":"Optimization"},{"key":"9991_CR20","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1515\/auom-2015-0046","volume":"23","author":"Y Censor","year":"2015","unstructured":"Censor, Y.: Weak and strong superiorization: Between feasibility-seeking and minimization. Analele Stiintifice ale Universitatii Ovidius Constanta-Seria Matematica 23, 41\u201354 (2015)","journal-title":"Analele Stiintifice ale Universitatii Ovidius Constanta-Seria Matematica"},{"key":"9991_CR21","unstructured":"Censor, Y.: Superiorization and Perturbation Resilience of Algorithms: A Bibliography compiled and continuously updated by Yair Censor, http:\/\/math.haifa.ac.il\/yair\/bib-superiorization-censor.html . 2 March 2017. arXiv:1506.04219 [math.OC] ([v2], 9 Mar 2017)"},{"key":"9991_CR22","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1088\/0266-5611\/4\/3\/006","volume":"4","author":"Y Censor","year":"1988","unstructured":"Censor, Y., Altschuler, M.D., Powlis, W.D.: On the use of Cimmino\u2019s simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning. Inverse Probl. 4, 607\u2013623 (1988)","journal-title":"Inverse Probl."},{"key":"9991_CR23","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1007\/s10589-011-9401-7","volume":"51","author":"Y Censor","year":"2012","unstructured":"Censor, Y., Chen, W., Combettes, P.L., Davidi, R., Herman, G.T.: On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints. Comput. Optim. Appl. 51, 1065\u20131088 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"9991_CR24","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s00245-011-9139-8","volume":"64","author":"Y Censor","year":"2011","unstructured":"Censor, Y., Chen, W., Pajoohesh, H.: Finite convergence of a subgradient projections method with expanding controls. Appl. Math. Optim. 64, 273\u2013285 (2011)","journal-title":"Appl. Math. Optim."},{"key":"9991_CR25","doi-asserted-by":"publisher","first-page":"065008","DOI":"10.1088\/0266-5611\/26\/6\/065008","volume":"26","author":"Y Censor","year":"2010","unstructured":"Censor, Y., Davidi, R., Herman, G.T.: Perturbation resilience and superiorization of iterative algorithms. Inverse Probl. 26, 065008 (2010)","journal-title":"Inverse Probl."},{"key":"9991_CR26","doi-asserted-by":"publisher","first-page":"2071","DOI":"10.1088\/0266-5611\/21\/6\/017","volume":"21","author":"Y Censor","year":"2005","unstructured":"Censor, Y., Elfving, T., Kopf, N., Bortfeld, T.: The multiple-sets split feasibility problem and its applications for inverse problems. Inverse Probl. 21, 2071\u20132084 (2005)","journal-title":"Inverse Probl."},{"key":"9991_CR27","doi-asserted-by":"crossref","unstructured":"Censor, Y., Herman, G.T., Jiang, M.: Special issue on superiorization: theory and applications. Inverse Probl. 33 (2017)","DOI":"10.1088\/1361-6420\/aa5deb"},{"key":"9991_CR28","unstructured":"Censor, Y., Lent, A.: Cyclic subgradient projections, Mathematics Publication Series, Report No 35. University of Haifa, Department of Mathematics (1981)"},{"key":"9991_CR29","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF01585107","volume":"24","author":"Y Censor","year":"1982","unstructured":"Censor, Y., Lent, A.: Cyclic subgradient projections. Math. Program. 24, 233\u2013235 (1982)","journal-title":"Math. Program."},{"key":"9991_CR30","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10107-014-0788-7","volume":"152","author":"Y Censor","year":"2015","unstructured":"Censor, Y., Reem, D.: Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods. Math. Program. (Ser. A) 152, 339\u2013380 (2015)","journal-title":"Math. Program. (Ser. A)"},{"key":"9991_CR31","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1080\/10556780310001610484","volume":"18","author":"Y Censor","year":"2003","unstructured":"Censor, Y., Tom, E.: Convergence of string-averaging projection schemes for inconsistent convex feasibility problems. Optim. Methods Softw. 18, 543\u2013554 (2003)","journal-title":"Optim. Methods Softw."},{"key":"9991_CR32","volume-title":"Parallel Optimization: Theory, Algorithms and Applications","author":"Y Censor","year":"1997","unstructured":"Censor, Y., Zenios, S.A.: Parallel Optimization: Theory, Algorithms and Applications. Oxford University Press, New York (1997)"},{"key":"9991_CR33","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/0024-3795(91)90182-V","volume":"150","author":"Y Censor","year":"1991","unstructured":"Censor, Y., Zenios, S.A.: Interval-constrained matrix balancing. Linear Algebra Appl. 150, 393\u2013421 (1991)","journal-title":"Linear Algebra Appl."},{"key":"9991_CR34","doi-asserted-by":"crossref","unstructured":"Censor, Y., Zur, Y.: Linear superiorization for infeasible linear programming. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos P. (eds.) Discrete Optimization and Operations Research. Lecture Notes in Computer Science (LNCS), vol. 9869, Springer International Publishing, pp. 15\u201324 (2016)","DOI":"10.1007\/978-3-319-44914-2_2"},{"key":"9991_CR35","doi-asserted-by":"publisher","first-page":"1808","DOI":"10.1049\/el:20031119","volume":"39","author":"AE Cetin","year":"2003","unstructured":"Cetin, A.E., Ozaktas, H., Ozaktas, H.M.: Resolution enhancement of low resolution wavefields with POCS algorithm. Electron. Lett. 39, 1808\u20131810 (2003)","journal-title":"Electron. Lett."},{"key":"9991_CR36","first-page":"326","volume":"1","author":"G Cimmino","year":"1938","unstructured":"Cimmino, G.: Calcolo approssimato per le soluzioni dei sistemi di equazioni lineari. La Ricerca Scientifica (Roma) 1, 326\u2013333 (1938)","journal-title":"La Ricerca Scientifica (Roma)"},{"key":"9991_CR37","doi-asserted-by":"publisher","first-page":"4938","DOI":"10.1118\/1.3481566","volume":"37","author":"W Chen","year":"2010","unstructured":"Chen, W., Craft, D., Madden, T.M., Zhang, K., Kooy, H.M., Herman, G.T.: A fast optimization algorithm for multi-criteria intensity modulated proton therapy planning. Med. Phys. 37, 4938\u20134945 (2010)","journal-title":"Med. Phys."},{"key":"9991_CR38","series-title":"International Series in Operations Research and Management Science, 118","volume-title":"Feasibility and Infeasibility in Optimization: Algorithms and Computational Methods","author":"JW Chinneck","year":"2008","unstructured":"Chinneck, J.W.: Feasibility and Infeasibility in Optimization: Algorithms and Computational Methods. International Series in Operations Research and Management Science, 118. Springer, New York (2008)"},{"key":"9991_CR39","unstructured":"CoinUtils package availble from https:\/\/projects.coin-or.org\/CoinUtils , 22 April 2013"},{"key":"9991_CR40","doi-asserted-by":"publisher","first-page":"1295","DOI":"10.1109\/TIP.2002.804527","volume":"11","author":"PL Combettes","year":"2002","unstructured":"Combettes, P.L., Luo, J.: An adaptive level set method for nondifferentiable constrained image recovery. IEEE Trans. Image Process. 11, 1295\u20131304 (2002)","journal-title":"IEEE Trans. Image Process."},{"key":"9991_CR41","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF01448368","volume":"17","author":"AR Pierro De","year":"1988","unstructured":"De Pierro, A.R., Iusem, A.N.: A finitely convergent \u201crow-action\u201d method for the convex feasibility problem. Appl. Math. Optim. 17, 225\u2013235 (1988)","journal-title":"Appl. Math. Optim."},{"key":"9991_CR42","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1111\/j.1475-3995.2009.00693.x","volume":"16","author":"AR Pierro De","year":"2009","unstructured":"De Pierro, A.R., Helou Neto, E.S.: From convex feasibility to convex constrained optimization using block action projection methods and underrelaxation. Int. Trans. Oper. Res. 16, 495\u2013504 (2009)","journal-title":"Int. Trans. Oper. Res."},{"key":"9991_CR43","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/BF01580439","volume":"8","author":"J Elzinga","year":"1975","unstructured":"Elzinga, J., Moore, T.G.: A central cutting plane algorithm for the convex programming problem. Math. Program. Stud. 8, 134\u2013145 (1975)","journal-title":"Math. Program. Stud."},{"key":"9991_CR44","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.1109\/TAC.1982.1103081","volume":"27","author":"M Fukushima","year":"1982","unstructured":"Fukushima, M.: A finitely convergent algorithm for convex inequalities. IEEE Trans. Autom. Control 27, 1126\u20131127 (1982)","journal-title":"IEEE Trans. Autom. Control"},{"key":"9991_CR45","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/0022-5193(70)90109-8","volume":"29","author":"R Gordon","year":"1970","unstructured":"Gordon, R., Bender, R., Herman, G.T.: Algebraic reconstruction techniques (ART) for three-dimensional electron microscopy and x-ray photography. J. Theor. Biol. 29, 471\u2013481 (1970)","journal-title":"J. Theor. Biol."},{"key":"9991_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(67)90113-9","volume":"7","author":"LG Gubin","year":"1967","unstructured":"Gubin, L.G., Polyak, B.T., Raik, E.V.: The method of projections for finding a common point of convex sets. Comput. Math. Math. Phys. 7, 1\u201324 (1967)","journal-title":"Comput. Math. Math. Phys."},{"key":"9991_CR47","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s101070050053","volume":"85","author":"J-L Goffin","year":"1999","unstructured":"Goffin, J.-L., Kiwiel, K.C.: Convergence of a simple subgradient level method. Math. Program. 85, 207\u2013211 (1999)","journal-title":"Math. Program."},{"key":"9991_CR48","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1137\/S1052623493258635","volume":"6","author":"J-L Goffin","year":"1996","unstructured":"Goffin, J.-L., Luo, Z.-Q., Ye, Y.: Complexity analysis of an interior cutting plane method for convex feasibility problems. SIAM J. Optim. 6, 638\u2013652 (1996)","journal-title":"SIAM J. Optim."},{"key":"9991_CR49","doi-asserted-by":"crossref","unstructured":"Herman, G.T.: Superiorization for image analysis. In: Combinatorial Image Analysis, Lecture Notes in Computer Science, vol. 8466, pp. 1\u20137. Springer (2014)","DOI":"10.1007\/978-3-319-07148-0_1"},{"key":"9991_CR50","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1016\/j.laa.2006.11.009","volume":"428","author":"GT Herman","year":"2008","unstructured":"Herman, G.T., Chen, W.: A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy. Linear Algebra Appl. 428, 1207\u20131217 (2008)","journal-title":"Linear Algebra Appl."},{"key":"9991_CR51","doi-asserted-by":"publisher","first-page":"5532","DOI":"10.1118\/1.4745566","volume":"39","author":"GT Herman","year":"2012","unstructured":"Herman, G.T., Gardu\u0148o, E., Davidi, R., Censor, Y.: Superiorization: an optimization heuristic for medical physics. Med. Phys. 39, 5532\u20135546 (2012)","journal-title":"Med. Phys."},{"key":"9991_CR52","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1109\/42.241889","volume":"12","author":"GT Herman","year":"1993","unstructured":"Herman, G.T., Meyer, L.: Algebraic reconstruction techniques can be made computationally efficient. IEEE Trans. Med. Imaging 12, 600\u2013609 (1993)","journal-title":"IEEE Trans. Med. Imaging"},{"key":"9991_CR53","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56468-0","volume-title":"Fundamentals of Convex Analysis","author":"J-B Hiriart-Urruty","year":"2001","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Fundamentals of Convex Analysis. Springer, Berlin (2001)"},{"key":"9991_CR54","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF02584829","volume":"18","author":"AN Iusem","year":"1987","unstructured":"Iusem, A.N., Moledo, L.: On finitely convergent iterative methods for the convex feasibility problem. Bull. Braz. Math. Soc. 18, 11\u201318 (1987)","journal-title":"Bull. Braz. Math. Soc."},{"key":"9991_CR55","first-page":"355","volume":"35","author":"S Kaczmarz","year":"1937","unstructured":"Kaczmarz, S.: Angen\u00f6herte Aufl\u00f6sung von Systemen linearer Gleichungen. Bulletin de l\u2019Acad\u00e9mie Polonaise des Sciences at Lettres A 35, 355\u2013357 (1937)","journal-title":"Bulletin de l\u2019Acad\u00e9mie Polonaise des Sciences at Lettres A"},{"key":"9991_CR56","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1137\/0108053","volume":"8","author":"JE Kelley","year":"1960","unstructured":"Kelley, J.E.: The cutting-plane method for solving convex programs. J. Soc. Ind. Appl. Math. 8, 703\u2013712 (1960)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"9991_CR57","unstructured":"Khabibullin, R.F.: On a method to find a point of a convex set. J. Sov. Math. 39, 2958\u20132963 (1987). Translated from Issledovaniya po Prikladnoi Matematike 4, 23\u201330 (1977)"},{"key":"9991_CR58","unstructured":"Khabibullin, R.F.: Generalized descent method for minimization of functionals. J. Sov. Math. 39, 2963\u20132968 (1987). Translated from Issledovaniya po Prikladnoi Matematike 4, 23\u201330 (1977)"},{"key":"9991_CR59","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF01588797","volume":"49","author":"S Kim","year":"1990","unstructured":"Kim, S., Ahn, H., Cho, S.-C.: Variable target value subgradient method. Math. Program. 49, 359\u2013369 (1990)","journal-title":"Math. Program."},{"key":"9991_CR60","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1137\/0334031","volume":"34","author":"KC Kiwiel","year":"1996","unstructured":"Kiwiel, K.C.: The efficiency of subgradient projection methods for convex optimization, part I: general level methods and part II: implementations and extensions. SIAM J. Control Optim. 34, 660\u2013697 (1996)","journal-title":"SIAM J. Control Optim."},{"key":"9991_CR61","first-page":"239","volume":"80","author":"IV Konnov","year":"1998","unstructured":"Konnov, I.V.: A combined relaxation method for variational inequalities with nonlinear constraints. Math. Program. 80, 239\u2013252 (1998)","journal-title":"Math. Program."},{"key":"9991_CR62","doi-asserted-by":"crossref","unstructured":"K\u00fcfer, K.-H., Monz, M., Scherrer, A., S\u00fcss, P., Alonso, F.V., Azizi Sultan, A.S., Bortfeld, T., Thieke, C.: Multicriteria optimization in intensity modulated radiotherapy planning. In: Handbook of Optimization in Medicine (Springer Optimization and Its Applications), vol. 26, pp. 123\u2013167 (2009)","DOI":"10.1007\/978-0-387-09770-1_5"},{"key":"9991_CR63","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1007\/BF01097078","volume":"45","author":"AN Kulikov","year":"1989","unstructured":"Kulikov, A.N., Fazylov, V.R.: A finite method to find a point in a set defined by a convex differentiable functional. J. Sov. Math. 45, 1273\u20131277 (1989)","journal-title":"J. Sov. Math."},{"key":"9991_CR64","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01585555","volume":"69","author":"C Lemar\u00e9chal","year":"1995","unstructured":"Lemar\u00e9chal, C., Nemirovskii, A., Nesterov, Y.: New variants of bundle methods. Math. Program. 69, 111\u2013147 (1995)","journal-title":"Math. Program."},{"key":"9991_CR65","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1080\/10556789908805768","volume":"11","author":"I Maros","year":"1999","unstructured":"Maros, I., M\u00e9sz\u00e1ros, Cs: A repository of convex quadratic programming problems. Optim. Methods Softw. 11, 671\u2013681 (1999)","journal-title":"Optim. Methods Softw."},{"key":"9991_CR66","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF00935547","volume":"33","author":"DQ Mayne","year":"1981","unstructured":"Mayne, D.Q., Polak, E., Heunis, A.J.: Solving nonlinear inequalities in a finite number of iterations. J. Optim. Theory Appl. 33, 207\u2013221 (1981)","journal-title":"J. Optim. Theory Appl."},{"key":"9991_CR67","doi-asserted-by":"publisher","first-page":"393","DOI":"10.4153\/CJM-1954-038-x","volume":"6","author":"TS Motzkin","year":"1954","unstructured":"Motzkin, T.S., Schoenberg, I.J.: The relaxation method for linear inequalities. Can. J. Math. 6, 393\u2013404 (1954)","journal-title":"Can. J. Math."},{"key":"9991_CR68","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10107-014-0759-z","volume":"149","author":"CHJ Pang","year":"2015","unstructured":"Pang, C.H.J.: Set intersection problems: supporting hyperplanes and quadratic programming. Math. Program. (Ser. A) 149, 329\u2013359 (2015)","journal-title":"Math. Program. (Ser. A)"},{"key":"9991_CR69","unstructured":"Pang, C.H.J.: SHDQP: an algorithm for convex set intersection problems based on supporting hyperplanes and dual quadratic programming (2013). arXiv:1307.0053"},{"key":"9991_CR70","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1109\/TAC.1979.1102047","volume":"24","author":"E Polak","year":"1979","unstructured":"Polak, E., Mayne, D.Q.: On the finite solution of nonlinear inequalities. IEEE Trans. Autom. Control 24, 443\u2013445 (1979)","journal-title":"IEEE Trans. Autom. Control"},{"key":"9991_CR71","unstructured":"Reem, D., De Pierro, A.: A new convergence analysis and perturbation resilience of some accelerated proximal forward-backward algorithms with errors. Inverse Probl. 33, 044001 (2017). arXiv:1508.05631 [math.OC], 2015 (current version: [v3], 29 Jun 2016)"},{"key":"9991_CR72","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10898-014-0202-2","volume":"61","author":"A Scherrer","year":"2015","unstructured":"Scherrer, A., Yaneva, F., Grebe, T., Kfer, K.-H.: A new mathematical approach for handling DVH criteria in IMRT planning. J. Glob. Optim. 61, 407\u2013428 (2015)","journal-title":"J. Glob. Optim."},{"key":"9991_CR73","volume-title":"Convex Analysis: An Introductory Text","author":"J Tiel van","year":"1984","unstructured":"van Tiel, J.: Convex Analysis: An Introductory Text. Wiley, Belfast (1984)"},{"key":"9991_CR74","doi-asserted-by":"publisher","first-page":"1526","DOI":"10.1109\/TPAMI.2004.95","volume":"26","author":"BJ Wyk van","year":"2004","unstructured":"van Wyk, B.J., van Wyk, M.A.: A POCS-based graph matching algorithm. IEEE Trans. Pattern Anal. Mach. Intell. 26, 1526\u20131530 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9991_CR75","doi-asserted-by":"publisher","first-page":"1858","DOI":"10.1093\/ietfec\/e91-a.8.1858","volume":"E91\u2013A","author":"M Yamagishi","year":"2008","unstructured":"Yamagishi, M., Yamada, I.: A deep monotone approximation operator based on the best quadratic lower bound of convex functions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E91\u2013A, 1858\u20131866 (2008)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"9991_CR76","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0801024","volume":"1","author":"SA Zenios","year":"1991","unstructured":"Zenios, S.A., Censor, Y.: Massively parallel row-action algorithms for some nonlinear transportation problems. SIAM J. Optim. 1, 373\u2013400 (1991)","journal-title":"SIAM J. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-018-9991-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-9991-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-9991-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,12]],"date-time":"2019-10-12T04:26:08Z","timestamp":1570854368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-018-9991-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,2]]},"references-count":76,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["9991"],"URL":"https:\/\/doi.org\/10.1007\/s10589-018-9991-4","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,2]]},"assertion":[{"value":"21 September 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}