{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T05:12:27Z","timestamp":1648530747078},"reference-count":21,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2006,1]]},"DOI":"10.1051\/ro:2006008","type":"journal-article","created":{"date-parts":[[2006,6,30]],"date-time":"2006-06-30T16:22:30Z","timestamp":1151684550000},"page":"37-52","source":"Crossref","is-referenced-by-count":4,"title":["An analytic center cutting plane algorithm for finding equilibrium points"],"prefix":"10.1051","volume":"40","author":[{"given":"Fernanda M.P.","family":"Raupp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wilfredo","family":"Sosa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2006,7,1]]},"reference":[{"key":"R1","first-page":"1707","volume":"39","author":"Antipin","year":"1999","journal-title":"Comp. Math. Math. Phys."},{"key":"R2","unstructured":"A.S. Antipin, From Optima to Equilibria, inProceedings of ISA RAS, Dynamics of Non-Homogeneous Systems. Editorial URSS-Moscow3(2000) 35\u201364."},{"key":"R3","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1023\/A:1011234525151","volume":"20","author":"Bianchi-Pini","year":"2001","journal-title":"J. Global Optim."},{"key":"R4","first-page":"123","volume":"63","author":"Blum","year":"1994","journal-title":"The Mathematics Student"},{"key":"R5","unstructured":"L.M. Bregman, The relaxation method for finding a common point of convex sets and its applications to solution of problems in convex programming.USSR Comp. Math.Math. Phys.7(1967) 200\u2013217."},{"key":"R6","first-page":"293","volume":"6","author":"Brezis","year":"1972","journal-title":"Boll. Un. Mat. Ital."},{"key":"R7","unstructured":"K. Fan, A minimax inequality and applications, inInequality III, edited by O. Shisha. Academic Press, NY (1972) 103\u2013113."},{"key":"R8","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1137\/S1052623493258635","volume":"6","author":"Goffin","year":"1996","journal-title":"SIAM J. Optim."},{"key":"R9","first-page":"131","volume":"76","author":"Goffin","year":"1997","journal-title":"Math. Program. Ser. B"},{"key":"R10","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/1034048","volume":"34","author":"Gonzaga","year":"1992","journal-title":"SIAM Rev."},{"key":"R11","first-page":"747","volume":"12","author":"Korpelevich","year":"1976","journal-title":"Matecon"},{"key":"R12","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1016\/S0362-546X(02)00154-2","volume":"52","author":"Iusem","year":"2003","journal-title":"Nonlinear Anal.-Theor."},{"key":"R13","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1080\/0233193031000120039","volume":"52","author":"Iusem","year":"2003","journal-title":"Optimization"},{"key":"R14","first-page":"149","volume":"69","author":"Nesterov","year":"1995","journal-title":"Math. Program. Ser. B"},{"key":"R15","doi-asserted-by":"crossref","first-page":"807","DOI":"10.2140\/pjm.1955.5.807","volume":"5","author":"Nikaido","year":"1955","journal-title":"Pacific J. Math."},{"key":"R16","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1023\/A:1013725219527","volume":"21","author":"Raupp","year":"2001","journal-title":"Comput. Optim. Appl."},{"key":"R17","doi-asserted-by":"crossref","unstructured":"G. Sonnevend,New algorithms in convex programming based on a notation of center and on rational extrapolations. International Series of Numerical Mathematics, Birkhauser Verlag, Basel, Switzerland84(1988) 311\u2013327.","DOI":"10.1007\/978-3-0348-9297-1_20"},{"key":"R18","unstructured":"P.M. Vaidya, A Locally Well-Behaved Potential Function and a Simple Newton-Type Method for Finding the Center of a Polytope.Progress in Mathematical Programming:Interior Point and Related Methods, edited by N. Megiddo. Springer, New York (1989) 79\u201390."},{"key":"R19","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1137\/0802002","volume":"2","author":"Ye","year":"1992","journal-title":"SIAM J. Optim."},{"key":"R20","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0025-5610(96)00075-5","volume":"78","author":"Complexity","year":"1997","journal-title":"Math. Program."},{"key":"R21","unstructured":"Y. Ye,Interior Point Algorithms: Theory and Analysis.Wiley\u2013Interscience Series in Discrete Mathematics and Optimization, John Wiley and Sons, New York (1997)."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2006008\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T18:06:53Z","timestamp":1555697213000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2006008"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,1]]},"references-count":21,"journal-issue":{"issue":"1"},"alternative-id":["ro0413"],"URL":"https:\/\/doi.org\/10.1051\/ro:2006008","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,1]]}}}