{"id":"https://openalex.org/W2097080848","doi":"https://doi.org/10.1051/ro:2006008","title":"An analytic center cutting plane algorithm for finding equilibrium points","display_name":"An analytic center cutting plane algorithm for finding equilibrium points","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2097080848","doi":"https://doi.org/10.1051/ro:2006008","mag":"2097080848"},"language":"en","primary_location":{"id":"doi:10.1051/ro:2006008","is_oa":false,"landing_page_url":"http://doi.org/10.1051/ro:2006008","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.numdam.org/item/10.1051/ro:2006008.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063882754","display_name":"Fernanda M. P. Raupp","orcid":null},"institutions":[{"id":"https://openalex.org/I4210142352","display_name":"Laborat\u00f3rio Nacional de Computa\u00e7\u00e3o Cient\u00edfica","ror":"https://ror.org/0498ekt05","country_code":"BR","type":"government","lineage":["https://openalex.org/I4210142352"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Fernanda M.P. Raupp","raw_affiliation_strings":["Laborat\u00f3rio Nacional de Computa\u00e7\u00e3o Cient\u00edfica \u2013 MCT, Av. Get\u00falio Vargas, 333, Petr\u00f3polis, RJ, CEP 25651-075, Brazil; fernanda@lncc.br"],"affiliations":[{"raw_affiliation_string":"Laborat\u00f3rio Nacional de Computa\u00e7\u00e3o Cient\u00edfica \u2013 MCT, Av. Get\u00falio Vargas, 333, Petr\u00f3polis, RJ, CEP 25651-075, Brazil; fernanda@lncc.br","institution_ids":["https://openalex.org/I4210142352"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061841099","display_name":"Wilfredo Sosa","orcid":"https://orcid.org/0000-0001-5697-5710"},"institutions":[{"id":"https://openalex.org/I62520931","display_name":"National University of Engineering","ror":"https://ror.org/006v63s16","country_code":"PE","type":"education","lineage":["https://openalex.org/I62520931"]}],"countries":["PE"],"is_corresponding":false,"raw_author_name":"Wilfredo Sosa","raw_affiliation_strings":["Instituto de Matem\u00e1tica e Ciencias Afines \u2013 Universidad Nacional de Ingenier\u00eda, Jir\u00f3n Ancash 536, Lima 1, Lima, Peru; sosa@uni.edu.pe"],"affiliations":[{"raw_affiliation_string":"Instituto de Matem\u00e1tica e Ciencias Afines \u2013 Universidad Nacional de Ingenier\u00eda, Jir\u00f3n Ancash 536, Lima 1, Lima, Peru; sosa@uni.edu.pe","institution_ids":["https://openalex.org/I62520931"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5063882754"],"corresponding_institution_ids":["https://openalex.org/I4210142352"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.15116603,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"40","issue":"1","first_page":"37","last_page":"52"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9869999885559082,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/center","display_name":"Center (category theory)","score":0.6386808156967163},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.604860782623291},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.5851356387138367},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4869893491268158},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41446900367736816},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3774237036705017},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.3367252051830292},{"id":"https://openalex.org/keywords/chemistry","display_name":"Chemistry","score":0.06727302074432373},{"id":"https://openalex.org/keywords/crystallography","display_name":"Crystallography","score":0.05500081181526184}],"concepts":[{"id":"https://openalex.org/C2779463800","wikidata":"https://www.wikidata.org/wiki/Q5062222","display_name":"Center (category theory)","level":2,"score":0.6386808156967163},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.604860782623291},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.5851356387138367},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4869893491268158},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41446900367736816},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3774237036705017},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.3367252051830292},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.06727302074432373},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.05500081181526184},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1051/ro:2006008","is_oa":false,"landing_page_url":"http://doi.org/10.1051/ro:2006008","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:numdam.org:RO_2006__40_1_37_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ro:2006008/","pdf_url":"https://www.numdam.org/item/10.1051/ro:2006008.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:numdam.org:RO_2006__40_1_37_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ro:2006008/","pdf_url":"https://www.numdam.org/item/10.1051/ro:2006008.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.4699999988079071}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2097080848.pdf","grobid_xml":"https://content.openalex.org/works/W2097080848.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W154593720","https://openalex.org/W171180563","https://openalex.org/W176327886","https://openalex.org/W1509805685","https://openalex.org/W1519983590","https://openalex.org/W1565334632","https://openalex.org/W1580873762","https://openalex.org/W1966986674","https://openalex.org/W1985880451","https://openalex.org/W1995415115","https://openalex.org/W2007269342","https://openalex.org/W2033468335","https://openalex.org/W2036622774","https://openalex.org/W2045068465","https://openalex.org/W2052236418","https://openalex.org/W2054090890","https://openalex.org/W2059499240","https://openalex.org/W2081807695","https://openalex.org/W4231459397"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2362705850","https://openalex.org/W1513565830","https://openalex.org/W2080278356","https://openalex.org/W3012113686","https://openalex.org/W2549201271","https://openalex.org/W1996239617","https://openalex.org/W4252675521","https://openalex.org/W3197304203"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2],"variant":[3],"of":[4,62],"the":[5,35,39,46,51,58,63],"analytic":[6],"center":[7],"cutting":[8],"plane":[9],"algorithm":[10],"proposed":[11,24],"by":[12,25],"Goffin":[13],"et":[14],"al.":[15],"(1996)":[16],"to":[17],"approximately":[18],"solve":[19],"equi-":[20],"librium":[21],"problems":[22,34],"as":[23,32],"Blum":[26],"and":[27,50,60],"Oettli":[28],"(1994),":[29],"which":[30],"include":[31],"particular":[33],"variational":[36],"inequalities":[37],"problem,":[38,49],"Nash":[40],"equilibria":[41],"problem":[42],"in":[43],"non-cooperative":[44],"games,":[45],"convex":[47],"minimization":[48],"fixed":[52],"point":[53],"problem.":[54],"Furthermore,":[55],"we":[56],"analyze":[57],"convergence":[59],"complexity":[61],"modified":[64],"algorithm.":[65]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}