{"id":"https://openalex.org/W2581419493","doi":"https://doi.org/10.1080/00207160.2017.1283020","title":"An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the <b>N\u221e\u2212</b> neighbourhood of the central path","display_name":"An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the <b>N\u221e\u2212</b> neighbourhood of the central path","publication_year":2017,"publication_date":"2017-01-30","ids":{"openalex":"https://openalex.org/W2581419493","doi":"https://doi.org/10.1080/00207160.2017.1283020","mag":"2581419493"},"language":"en","primary_location":{"id":"doi:10.1080/00207160.2017.1283020","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160.2017.1283020","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039136332","display_name":"B\u200e. \u200eKheirfam","orcid":null},"institutions":[{"id":"https://openalex.org/I51301133","display_name":"Azarbaijan Shahid Madani University","ror":"https://ror.org/05pg2cw06","country_code":"IR","type":"education","lineage":["https://openalex.org/I51301133"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"B. Kheirfam","raw_affiliation_strings":["Department of Applied Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran","institution_ids":["https://openalex.org/I51301133"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5039136332"],"corresponding_institution_ids":["https://openalex.org/I51301133"],"apc_list":null,"apc_paid":null,"fwci":1.4181,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.78631423,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":"94","issue":"12","first_page":"2271","last_page":"2282"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":1.0,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9962000250816345,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.992900013923645,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7512386441230774},{"id":"https://openalex.org/keywords/linear-complementarity-problem","display_name":"Linear complementarity problem","score":0.7057016491889954},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.5945609211921692},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5524395108222961},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.5407123565673828},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.530220091342926},{"id":"https://openalex.org/keywords/complementarity","display_name":"Complementarity (molecular biology)","score":0.5202616453170776},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.44494864344596863},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43419069051742554},{"id":"https://openalex.org/keywords/ellipse","display_name":"Ellipse","score":0.41510212421417236},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36069685220718384},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.18113499879837036},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1704634726047516},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.16950708627700806}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7512386441230774},{"id":"https://openalex.org/C34320192","wikidata":"https://www.wikidata.org/wiki/Q783105","display_name":"Linear complementarity problem","level":3,"score":0.7057016491889954},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.5945609211921692},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5524395108222961},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.5407123565673828},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.530220091342926},{"id":"https://openalex.org/C202269582","wikidata":"https://www.wikidata.org/wiki/Q2644277","display_name":"Complementarity (molecular biology)","level":2,"score":0.5202616453170776},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.44494864344596863},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43419069051742554},{"id":"https://openalex.org/C74261601","wikidata":"https://www.wikidata.org/wiki/Q40112","display_name":"Ellipse","level":2,"score":0.41510212421417236},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36069685220718384},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.18113499879837036},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1704634726047516},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.16950708627700806},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207160.2017.1283020","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160.2017.1283020","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7099999785423279,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W253429297","https://openalex.org/W609648197","https://openalex.org/W1570961610","https://openalex.org/W1979376655","https://openalex.org/W1982484829","https://openalex.org/W1992596978","https://openalex.org/W2009376524","https://openalex.org/W2017573175","https://openalex.org/W2022266190","https://openalex.org/W2034177488","https://openalex.org/W2043868859","https://openalex.org/W2059388402","https://openalex.org/W2079466664","https://openalex.org/W2092565441","https://openalex.org/W2611147814"],"related_works":["https://openalex.org/W1823078487","https://openalex.org/W2276648117","https://openalex.org/W2095983929","https://openalex.org/W1758063681","https://openalex.org/W2498799440","https://openalex.org/W2034177488","https://openalex.org/W2084792246","https://openalex.org/W1548681518","https://openalex.org/W2092565441","https://openalex.org/W1536532856"],"abstract_inverted_index":{"An":[0],"arc-search":[1],"infeasible":[2],"interior":[3],"point":[4],"algorithm":[5,16,68],"is":[6,69],"proposed":[7,58,67],"for":[8,56],"solving":[9],"a":[10,18],"horizontal":[11],"linear":[12],"complementarity":[13],"problem.":[14],"The":[15],"produces":[17],"sequence":[19],"of":[20,27],"iterates":[21],"in":[22],"the":[23,28,33,36,40,46,57,66],"negative":[24],"infinity":[25],"neighbourhood":[26],"central":[29,42],"path":[30],"and":[31,50,72],"searches":[32],"solutions":[34],"along":[35],"ellipses":[37],"that":[38,65],"approximate":[39],"whole":[41],"path.":[43],"We":[44],"study":[45],"theoretical":[47],"convergence":[48],"properties":[49],"also":[51],"establish":[52],"polynomial":[53],"complexity":[54],"bound":[55],"algorithm.":[59],"Moreover,":[60],"our":[61],"numerical":[62],"results":[63],"suggest":[64],"very":[70],"efficient":[71],"competitive.":[73]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}