{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,12]],"date-time":"2023-06-12T18:10:56Z","timestamp":1686593456929},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,2,16]],"date-time":"2016-02-16T00:00:00Z","timestamp":1455580800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s10479-016-2135-2","type":"journal-article","created":{"date-parts":[[2016,2,16]],"date-time":"2016-02-16T15:02:48Z","timestamp":1455634968000},"page":"587-612","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem"],"prefix":"10.1007","volume":"258","author":[{"given":"A.","family":"Ferrer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. A.","family":"Goberna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Gonz\u00e1lez-Guti\u00e9rrez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. I.","family":"Todorov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,16]]},"reference":[{"key":"2135_CR1","doi-asserted-by":"crossref","first-page":"382","DOI":"10.4153\/CJM-1954-037-2","volume":"6","author":"S Agmon","year":"1954","unstructured":"Agmon, S. (1954). The relaxation method for linear inequalities. Canadian Journal of Mathematics, 6, 382\u2013392.","journal-title":"Canadian Journal of Mathematics"},{"key":"2135_CR2","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10589-014-9667-7","volume":"60","author":"A Auslender","year":"2015","unstructured":"Auslender, A., Ferrer, A., Goberna, M. A., & L\u00f3pez, M. A. (2015). Comparative study of RPSALG algorithm for convex semi-infinite programming. Computational Optimization and Applications, 60, 59\u201387.","journal-title":"Computational Optimization and Applications"},{"key":"2135_CR3","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1023\/A:1019204407420","volume":"98","author":"AM Bagirov","year":"2000","unstructured":"Bagirov, A. M., & Rubinov, A. M. (2000). Global minimization of increasing positively homogeneous functions over the unit simplex. Annals of Operations Research, 98, 171\u2013187.","journal-title":"Annals of Operations Research"},{"key":"2135_CR4","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/978-1-4613-0279-7_13","volume-title":"Advances in convex analysis and global optimization","author":"AM Bagirov","year":"2001","unstructured":"Bagirov, A. M., & Rubinov, A. M. (2001). Modified versions of the cutting angle method. In N. Hadjisavvas & P. M. Pardalos (Eds.), Advances in convex analysis and global optimization (pp. 245\u2013268). Dordrecht: Kluwer."},{"key":"2135_CR5","volume-title":"The elements of real analysis","author":"RG Bartle","year":"1964","unstructured":"Bartle, R. G. (1964). The elements of real analysis. New York: Wiley."},{"key":"2135_CR6","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1287\/ijoc.2013.0569","volume":"26","author":"A Basu","year":"2013","unstructured":"Basu, A., De Loer, J. A., & Junod, M. (2013). On Chubanov\u2019s method for linear programming. INFORMS Journal on Computing, 26, 336\u2013350.","journal-title":"INFORMS Journal on Computing"},{"key":"2135_CR7","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1080\/02331930310001611556","volume":"52","author":"G Beliakov","year":"2003","unstructured":"Beliakov, G. (2003). Geometry and combinatorics of the cutting angle method. Optimization, 52, 379\u2013394.","journal-title":"Optimization"},{"key":"2135_CR8","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1080\/10556780410001647177","volume":"19","author":"G Beliakov","year":"2004","unstructured":"Beliakov, G. (2004). Cutting angle method. A tool for constrained global optimization. Optimization Methods and Software, 19, 137\u2013151.","journal-title":"Optimization Methods and Software"},{"key":"2135_CR9","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/0-387-26771-9_7","volume-title":"Continuous Optimization","author":"G Beliakov","year":"2005","unstructured":"Beliakov, G. (2005). A review of applications of the cutting angle method. In A. M. Rubinov & V. Jeyakumar (Eds.), Continuous Optimization (pp. 209\u2013248). New York: Springer."},{"key":"2135_CR10","first-page":"153","volume":"4","author":"G Beliakov","year":"2008","unstructured":"Beliakov, G. (2008). Extended cutting angle method of global optimization. Pacific Journal of Optimization, 4, 153\u2013176.","journal-title":"Pacific Journal of Optimization"},{"key":"2135_CR11","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10898-009-9467-2","volume":"47","author":"G Beliakov","year":"2010","unstructured":"Beliakov, G., & Ferrer, A. (2010). Bounded lower subdifferentiability optimization techniques: Applications. Journal of Global Optimization, 47, 211\u2013231.","journal-title":"Journal of Global Optimization"},{"key":"2135_CR12","doi-asserted-by":"crossref","DOI":"10.1515\/9781400831050","volume-title":"Robust optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., & Nemirovski, A. (2009). Robust optimization. Princeton: Princeton University Press."},{"issue":"1","key":"2135_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(99)00016-4","volume":"25","author":"A Ben-Tal","year":"1999","unstructured":"Ben-Tal, A., & Nemirovski, A. (1999). Robust solutions of uncertain linear programs. Operations Research Letters, 25(1), 1\u201313.","journal-title":"Operations Research Letters"},{"key":"2135_CR14","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s00454-004-2878-4","volume":"32","author":"U Betke","year":"2004","unstructured":"Betke, U. (2004). Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem. Discrete and Computational Geometry, 32, 317\u2013338.","journal-title":"Discrete and Computational Geometry"},{"key":"2135_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10957-013-0381-x","volume":"160","author":"JM Borwein","year":"2014","unstructured":"Borwein, J. M., & Tam, M. K. (2014). A cyclic Douglas\u2013Rachford iteration scheme. Journal of Optimization Theory and Applications, 160, 1\u201329.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"2135_CR16","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10107-004-0519-6","volume":"103A","author":"MJ C\u00e1novas","year":"2005","unstructured":"C\u00e1novas, M. J., L\u00f3pez, M. A., Parra, J., & Toledo, F. J. (2005). Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems. Mathematical Programming, 103A, 95\u2013126.","journal-title":"Mathematical Programming"},{"key":"2135_CR17","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF01386389","volume":"1","author":"EW Cheney","year":"1959","unstructured":"Cheney, E. W., & Goldstein, A. A. (1959). Newton method for convex programming and Tchebycheff approximation. Numerissche Mathematik, 1, 253\u2013268.","journal-title":"Numerissche Mathematik"},{"key":"2135_CR18","first-page":"155","volume-title":"Advances in imaging and electron physics","author":"PL Combettes","year":"1996","unstructured":"Combettes, P. L. (1996). The convex feasibility problem in image recovery. In P. Hawkes (Ed.), Advances in imaging and electron physics (Vol. 95, pp. 155\u2013270). New York: Academic Press."},{"key":"2135_CR19","first-page":"279","volume":"13","author":"N Dinh","year":"2006","unstructured":"Dinh, N., Goberna, M. A., & L\u00f3pez, M. A. (2006). From linear to convex systems: Consistency, Farkas Lemma and applications. Journla of Convex Analysis, 13, 279\u2013290.","journal-title":"Journla of Convex Analysis"},{"key":"2135_CR20","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E. D., & Mor\u00e9, J. J. (2002). Benchmarking optimization software with performance profiles. Mathematical Programming, 91, 201\u2013213.","journal-title":"Mathematical Programming"},{"key":"2135_CR21","volume-title":"Applied mathematics: Body and soul","author":"K Eriksson","year":"2004","unstructured":"Eriksson, K., Estep, D., & Johnson, C. (2004). Applied mathematics: Body and soul. Berlin: Springer."},{"key":"2135_CR22","unstructured":"Ferrer, A., & Miranda, E. (2013). Random test examples with known minimum for convex semi-infinite programming problems. E-prints UPC. http:\/\/hdl.handle.net\/2117\/19118 . Accessed 28 February 2015."},{"key":"2135_CR23","doi-asserted-by":"crossref","first-page":"1402","DOI":"10.1137\/130939596","volume":"24","author":"MA Goberna","year":"2014","unstructured":"Goberna, M. A., Jeyakumar, V., Li, G., & Vicente-P\u00e9rez, J. (2014). Robust solutions of uncertain multi-objective linear semi-infinite programming. SIAM Journal on Optimization, 24, 1402\u20131419.","journal-title":"SIAM Journal on Optimization"},{"key":"2135_CR24","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1016\/j.ejor.2014.10.027","volume":"242","author":"MA Goberna","year":"2015","unstructured":"Goberna, M. A., Jeyakumar, V., Li, G., & Vicente-P\u00e9rez, J. (2015). Robust solutions to multi-objective linear programs with uncertain data. European Journal of Operational Research, 242, 730\u2013743.","journal-title":"European Journal of Operational Research"},{"key":"2135_CR25","volume-title":"Linear semi-infinite optimization","author":"MA Goberna","year":"1998","unstructured":"Goberna, M. A., & L\u00f3pez, M. A. (1998). Linear semi-infinite optimization. Chichester: Wiley."},{"key":"2135_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-8044-1","volume-title":"Post-optimal analysis in linear semi-infinite optimization","author":"MA Goberna","year":"2014","unstructured":"Goberna, M. A., & L\u00f3pez, M. A. (2014). Post-optimal analysis in linear semi-infinite optimization. New York: Springer."},{"key":"2135_CR27","doi-asserted-by":"crossref","first-page":"947","DOI":"10.1080\/02331934.2011.611513","volume":"60","author":"E Gonz\u00e1lez-Guti\u00e9rrez","year":"2011","unstructured":"Gonz\u00e1lez-Guti\u00e9rrez, E., Rebollar, L. A., & Todorov, M. I. (2011a). Rate of convergence of a class of numerical methods solving linear inequality systems. Optimization, 60, 947\u2013957.","journal-title":"Optimization"},{"key":"2135_CR28","first-page":"785","volume":"64","author":"E Gonz\u00e1lez-Guti\u00e9rrez","year":"2011","unstructured":"Gonz\u00e1lez-Guti\u00e9rrez, E., Rebollar, L. A., & Todorov, M. I. (2011b). Under and over projection methods for solving linear inequality systems. Comptes Rendus de la Academie Bulgare des Sciences, 64, 785\u2013790.","journal-title":"Comptes Rendus de la Academie Bulgare des Sciences"},{"key":"2135_CR29","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/s11750-011-0234-4","volume":"20","author":"E Gonz\u00e1lez-Guti\u00e9rrez","year":"2012","unstructured":"Gonz\u00e1lez-Guti\u00e9rrez, E., Rebollar, L. A., & Todorov, M. I. (2012). Relaxation methods for solving linear inequality systems: Converging results. Top, 20, 426\u2013436.","journal-title":"Top"},{"key":"2135_CR30","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s11590-010-0244-4","volume":"6","author":"E Gonz\u00e1lez-Guti\u00e9rrez","year":"2012","unstructured":"Gonz\u00e1lez-Guti\u00e9rrez, E., & Todorov, M. I. (2012). A relaxation method for solving systems with infinitely many linear inequalities. Optimization Letters, 6, 291\u2013298.","journal-title":"Optimization Letters"},{"key":"2135_CR31","unstructured":"Gonz\u00e1lez-Guti\u00e9rrez, E., Todorov, M. I. (2014). Generalized step iteration in the relaxation method for the feasibility problem. IMPA, Rio de Janeiro, BR, Preprint serie D113\/2014. https:\/\/institucional.impa.br\/preprint\/lista.action?serie=4"},{"key":"2135_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0015-5","volume-title":"Introduction to global optimization","author":"R Horst","year":"2000","unstructured":"Horst, R., Pardalos, P., & Thoai, N. V. (2000). Introduction to global optimization (1st ed.). Dordrecht: Kluwer.","edition":"1"},{"key":"2135_CR33","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/978-1-4613-3629-7_9","volume-title":"Advances in optimization and approximation","author":"H Hu","year":"1994","unstructured":"Hu, H. (1994). A Projection method for solving infinite systems of linear inequalities. In D.-Z. Du & J. Sun (Eds.), Advances in optimization and approximation (pp. 186\u2013194). Dordrecht: Kluwer."},{"key":"2135_CR34","first-page":"43","volume":"21","author":"RG Jeroslow","year":"1979","unstructured":"Jeroslow, R. G. (1979). Some relaxation methods for linear inequalities. Cahiers du Cero, 21, 43\u201353.","journal-title":"Cahiers du Cero"},{"key":"2135_CR35","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0108053","volume":"8","author":"JE Kelley Jr","year":"1960","unstructured":"Kelley, J. E., Jr. (1960). The cutting-plane method for solving convex programs. Journal of the Society for Industrial and Applied Mathematics, 8, 703\u2013712.","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"2135_CR36","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3200-9","volume-title":"Abstract convexity and global optimization","author":"AM Rubinov","year":"2000","unstructured":"Rubinov, A. M. (2000). Abstract convexity and global optimization. Dordrecht\/Boston: Kluwer."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-016-2135-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2135-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2135-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2135-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T17:07:39Z","timestamp":1567616859000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-016-2135-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,16]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["2135"],"URL":"https:\/\/doi.org\/10.1007\/s10479-016-2135-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,16]]}}}