{"id":"https://openalex.org/W1975855784","doi":"https://doi.org/10.1137/s1052623401384151","title":"A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P 0 LCPs","display_name":"A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P 0 LCPs","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W1975855784","doi":"https://doi.org/10.1137/s1052623401384151","mag":"1975855784"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623401384151","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623401384151","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/A5050493484","display_name":"Yun-Bin Zhao","orcid":"https://orcid.org/0000-0001-9285-2793"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]},{"id":"https://openalex.org/I19820366","display_name":"Chinese Academy of Sciences","ror":"https://ror.org/034t30j35","country_code":"CN","type":"government","lineage":["https://openalex.org/I19820366"]}],"countries":["CN","HK"],"is_corresponding":false,"raw_author_name":"Yun-Bin Zhao","raw_affiliation_strings":["Chinese Academy of Sciences","Chinese University of Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Chinese Academy of Sciences","institution_ids":["https://openalex.org/I19820366"]},{"raw_affiliation_string":"Chinese University of Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100745907","display_name":"Duan Li","orcid":"https://orcid.org/0000-0001-9786-6238"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Duan Li","raw_affiliation_strings":["Chinese University of Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Chinese University of Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.9014,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.90130719,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"13","issue":"4","first_page":"1195","last_page":"1221"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"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.9998000264167786,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9986000061035156,"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.8238704204559326},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.6743646860122681},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6712742447853088},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6475642323493958},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5879839658737183},{"id":"https://openalex.org/keywords/complementarity","display_name":"Complementarity (molecular biology)","score":0.5679733157157898},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5530755519866943},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5016434192657471},{"id":"https://openalex.org/keywords/linear-complementarity-problem","display_name":"Linear complementarity problem","score":0.44792625308036804},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4314414858818054},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.13552120327949524},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09196370840072632},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.08764293789863586}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8238704204559326},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.6743646860122681},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6712742447853088},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6475642323493958},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5879839658737183},{"id":"https://openalex.org/C202269582","wikidata":"https://www.wikidata.org/wiki/Q2644277","display_name":"Complementarity (molecular biology)","level":2,"score":0.5679733157157898},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5530755519866943},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5016434192657471},{"id":"https://openalex.org/C34320192","wikidata":"https://www.wikidata.org/wiki/Q783105","display_name":"Linear complementarity problem","level":3,"score":0.44792625308036804},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4314414858818054},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13552120327949524},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09196370840072632},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.08764293789863586},{"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},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s1052623401384151","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623401384151","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.546.2050","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.546.2050","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.mat.bham.ac.uk/Y.Zhao/My publication/2rev.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/f5dc76e4-40d7-4602-a096-77ba7e014c0d","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/f5dc76e4-40d7-4602-a096-77ba7e014c0d","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Li, D & Zhao, Y-B 2003, 'A globally and locally superlinearly convergent non-interior-point algorithm for P0 LCPs', SIAM Journal on Optimization, vol. 13, no. 4, pp. 1195-1221. https://doi.org/10.1137/S1052623401384151","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322942","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W46053003","https://openalex.org/W66820110","https://openalex.org/W584634945","https://openalex.org/W1538102214","https://openalex.org/W1544526981","https://openalex.org/W1570961610","https://openalex.org/W1748199557","https://openalex.org/W1967759264","https://openalex.org/W1968243198","https://openalex.org/W1975919538","https://openalex.org/W1981229337","https://openalex.org/W1985538244","https://openalex.org/W1986354788","https://openalex.org/W1989981719","https://openalex.org/W1997984350","https://openalex.org/W2000151369","https://openalex.org/W2005148680","https://openalex.org/W2008814958","https://openalex.org/W2009994578","https://openalex.org/W2012726395","https://openalex.org/W2016187009","https://openalex.org/W2018843371","https://openalex.org/W2028621706","https://openalex.org/W2029911309","https://openalex.org/W2030169236","https://openalex.org/W2033711900","https://openalex.org/W2038872086","https://openalex.org/W2044382581","https://openalex.org/W2050864977","https://openalex.org/W2051192977","https://openalex.org/W2051269616","https://openalex.org/W2065615220","https://openalex.org/W2065691568","https://openalex.org/W2067254478","https://openalex.org/W2074519406","https://openalex.org/W2076622878","https://openalex.org/W2079917093","https://openalex.org/W2094161173","https://openalex.org/W2094900096","https://openalex.org/W2108105954","https://openalex.org/W2113734366","https://openalex.org/W2117634766","https://openalex.org/W2140603012","https://openalex.org/W2185657671","https://openalex.org/W2948315098","https://openalex.org/W4240022917","https://openalex.org/W4243528076"],"related_works":["https://openalex.org/W2276648117","https://openalex.org/W2084792246","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/W2382148394"],"abstract_inverted_index":{"Based":[0],"on":[1],"the":[2,5,18,30,34,48,57,75,85,96,99,106,118],"concept":[3],"of":[4,33,88,98,105,117],"regularized":[6],"central":[7],"path,":[8],"a":[9,112],"new":[10],"non--interior-point":[11,69],"path-following":[12],"algorithm":[13,35,76,107,119],"is":[14,40,77,120],"proposed":[15],"for":[16,36],"solving":[17],"P":[19,37,80],"0":[20,25,38],"linear":[21],"complementarity":[22],"problem":[23],"(P":[24],"LCP).":[26],"The":[27,101,115],"condition":[28,51],"ensuring":[29],"global":[31,86],"convergence":[32,87,104],"LCPs":[39],"weaker":[41],"than":[42,95],"most":[43,67],"conditions":[44],"previously":[45],"used":[46],"in":[47,66],"literature.":[49],"This":[50],"can":[52,108],"be":[53,109],"satisfied":[54],"even":[55],"when":[56],"strict":[58],"feasibility":[59],"condition,":[60],"which":[61],"has":[62],"often":[63],"been":[64],"assumed":[65],"existing":[68],"algorithms,":[70],"fails":[71],"to":[72,79],"hold.":[73],"When":[74],"applied":[78],"*":[81],"and":[82],"monotone":[83],"LCPs,":[84],"this":[89],"method":[90],"requires":[91],"no":[92],"assumption":[93],"other":[94],"solvability":[97],"problem.":[100],"local":[102],"superlinear":[103],"achieved":[110],"under":[111],"nondegeneracy":[113],"assumption.":[114],"effectiveness":[116],"demonstrated":[121],"by":[122],"our":[123],"numerical":[124],"experiments.":[125]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}