{"id":"https://openalex.org/W1986106357","doi":"https://doi.org/10.1137/s1052623494275574","title":"Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central Path","display_name":"Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central Path","publication_year":1998,"publication_date":"1998-05-01","ids":{"openalex":"https://openalex.org/W1986106357","doi":"https://doi.org/10.1137/s1052623494275574","mag":"1986106357"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623494275574","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623494275574","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","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/A5111436924","display_name":"Gongyun Zhao","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Gongyun Zhao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5111436924"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.6605,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.8989084,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"8","issue":"2","first_page":"397","last_page":"413"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"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":0.9998999834060669,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.9994999766349792,"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.9983000159263611,"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.7082013487815857},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6963585615158081},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.6223837733268738},{"id":"https://openalex.org/keywords/linear-complementarity-problem","display_name":"Linear complementarity problem","score":0.6215155720710754},{"id":"https://openalex.org/keywords/complementarity","display_name":"Complementarity (molecular biology)","score":0.5420417189598083},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5163879990577698},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.498410701751709},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.48034536838531494},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4392774999141693},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4384486973285675},{"id":"https://openalex.org/keywords/worst-case-complexity","display_name":"Worst-case complexity","score":0.4362286925315857},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.435783326625824},{"id":"https://openalex.org/keywords/average-case-complexity","display_name":"Average-case complexity","score":0.4131406843662262},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.326856791973114},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22187036275863647},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1623733937740326},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.10292863845825195}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7082013487815857},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6963585615158081},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.6223837733268738},{"id":"https://openalex.org/C34320192","wikidata":"https://www.wikidata.org/wiki/Q783105","display_name":"Linear complementarity problem","level":3,"score":0.6215155720710754},{"id":"https://openalex.org/C202269582","wikidata":"https://www.wikidata.org/wiki/Q2644277","display_name":"Complementarity (molecular biology)","level":2,"score":0.5420417189598083},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5163879990577698},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.498410701751709},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.48034536838531494},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4392774999141693},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4384486973285675},{"id":"https://openalex.org/C96563100","wikidata":"https://www.wikidata.org/wiki/Q8037118","display_name":"Worst-case complexity","level":3,"score":0.4362286925315857},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.435783326625824},{"id":"https://openalex.org/C24604422","wikidata":"https://www.wikidata.org/wiki/Q4828244","display_name":"Average-case complexity","level":3,"score":0.4131406843662262},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.326856791973114},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22187036275863647},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1623733937740326},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.10292863845825195},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s1052623494275574","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623494275574","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.55.754","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.754","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.nus.sg/~matzgy/papers/lna.ps","raw_type":"text"},{"id":"pmh:oai:scholarbank.nus.edu.sg:10635/103436","is_oa":false,"landing_page_url":"http://scholarbank.nus.edu.sg/handle/10635/103436","pdf_url":null,"source":{"id":"https://openalex.org/S7407052290","display_name":"National University of Singapore","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Scopus","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7200000286102295,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1533868172","https://openalex.org/W1570961610","https://openalex.org/W1794576667","https://openalex.org/W1973117121","https://openalex.org/W1976529189","https://openalex.org/W1979152594","https://openalex.org/W1985564371","https://openalex.org/W1992241390","https://openalex.org/W1995535418","https://openalex.org/W1996309927","https://openalex.org/W2005933292","https://openalex.org/W2005992544","https://openalex.org/W2014885585","https://openalex.org/W2031527878","https://openalex.org/W2032415977","https://openalex.org/W2043027963","https://openalex.org/W2068674826","https://openalex.org/W2165452678","https://openalex.org/W2599168675","https://openalex.org/W2734997509","https://openalex.org/W4230272019","https://openalex.org/W4243888959"],"related_works":["https://openalex.org/W2276648117","https://openalex.org/W819098253","https://openalex.org/W2350903564","https://openalex.org/W1548220668","https://openalex.org/W1988776931","https://openalex.org/W2224859476","https://openalex.org/W2378187344","https://openalex.org/W2353923837","https://openalex.org/W2765841216","https://openalex.org/W2079550254"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,51],"study":[4],"a":[5,8,22],"first-order":[6,49],"and":[7],"high-order":[9,81,87,104],"algorithm":[10],"for":[11,102,110],"solving":[12],"linear":[13],"complementarity":[14],"problems.":[15,34],"These":[16],"algorithms":[17,39,60,71,105],"are":[18],"implicitly":[19],"associated":[20],"with":[21],"large":[23],"neighborhood":[24],"whose":[25],"size":[26,43],"may":[27],"depend":[28],"on":[29,41],"the":[30,33,42,45,48,53,57,67,85,89,98],"dimension":[31],"of":[32,37,44,69,76],"The":[35],"complexity":[36,54,68,91,99],"these":[38],"depends":[40],"neighborhood.":[46],"For":[47],"algorithm,":[50],"achieve":[52],"bound":[55,101],"which":[56],"typical":[58],"large-step":[59,70],"possess.":[61],"It":[62],"is":[63,72,106],"well":[64],"known":[65],"that":[66,75,97,109],"greater":[73],"than":[74],"short-step":[77,111],"ones.":[78],"By":[79],"using":[80],"power":[82],"series":[83],"(hence":[84],"name":[86],"algorithm),":[88],"iteration":[90],"can":[92],"be":[93],"reduced.":[94],"We":[95],"show":[96],"upper":[100],"our":[103],"equal":[107],"to":[108],"algorithms.":[112]},"counts_by_year":[{"year":2012,"cited_by_count":2}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}