{"id":"https://openalex.org/W2906606693","doi":"https://doi.org/10.1080/10556788.2018.1546857","title":"Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP","display_name":"Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP","publication_year":2018,"publication_date":"2018-12-26","ids":{"openalex":"https://openalex.org/W2906606693","doi":"https://doi.org/10.1080/10556788.2018.1546857","mag":"2906606693"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2018.1546857","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2018.1546857","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"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":"Optimization Methods and Software","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/A5033947647","display_name":"Goran Le\u0161aja","orcid":"https://orcid.org/0000-0003-3840-4599"},"institutions":[{"id":"https://openalex.org/I39815113","display_name":"Georgia Southern University","ror":"https://ror.org/04agmb972","country_code":"US","type":"education","lineage":["https://openalex.org/I39815113"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Goran Lesaja","raw_affiliation_strings":["Department of Mathematical Sciences, Georgia Southern University, Statesboro, GA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Georgia Southern University, Statesboro, GA, USA","institution_ids":["https://openalex.org/I39815113"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051944217","display_name":"Florian A. Potra","orcid":null},"institutions":[{"id":"https://openalex.org/I126744593","display_name":"University of Maryland, Baltimore","ror":"https://ror.org/04rq5mt64","country_code":"US","type":"education","lineage":["https://openalex.org/I126744593"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Florian Potra","raw_affiliation_strings":["Department of Mathematics & Statistics, University of Maryland, Baltimore, MD, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics & Statistics, University of Maryland, Baltimore, MD, USA","institution_ids":["https://openalex.org/I126744593"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5033947647"],"corresponding_institution_ids":["https://openalex.org/I39815113"],"apc_list":null,"apc_paid":null,"fwci":2.3071,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.88188018,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"34","issue":"5","first_page":"1014","last_page":"1034"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9925000071525574,"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.9925000071525574,"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/T11233","display_name":"Advanced Adaptive Filtering Techniques","score":0.9804999828338623,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9790999889373779,"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/point","display_name":"Point (geometry)","score":0.6517885327339172},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.4837786853313446},{"id":"https://openalex.org/keywords/newtons-method","display_name":"Newton's method","score":0.44781920313835144},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44252049922943115},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4108770191669464},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.357088565826416},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34061646461486816},{"id":"https://openalex.org/keywords/control-theory","display_name":"Control theory (sociology)","score":0.33508414030075073},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.1428099274635315},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.0881081223487854},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07158049941062927}],"concepts":[{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.6517885327339172},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.4837786853313446},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.44781920313835144},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44252049922943115},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4108770191669464},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.357088565826416},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34061646461486816},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.33508414030075073},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.1428099274635315},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.0881081223487854},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07158049941062927},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2018.1546857","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2018.1546857","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"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":"Optimization Methods and Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W36772437","https://openalex.org/W915752609","https://openalex.org/W1570961610","https://openalex.org/W1967052271","https://openalex.org/W1970000960","https://openalex.org/W1977067945","https://openalex.org/W1993891506","https://openalex.org/W1996045511","https://openalex.org/W2021664750","https://openalex.org/W2034177488","https://openalex.org/W2035735077","https://openalex.org/W2067037813","https://openalex.org/W2072165663","https://openalex.org/W2074947226","https://openalex.org/W2086055807","https://openalex.org/W2090971138","https://openalex.org/W2092565441","https://openalex.org/W2118960201","https://openalex.org/W2148841783","https://openalex.org/W2561720919","https://openalex.org/W2948315098","https://openalex.org/W4301791716"],"related_works":["https://openalex.org/W4378529241","https://openalex.org/W2483828597","https://openalex.org/W2088213153","https://openalex.org/W2921318248","https://openalex.org/W2064842217","https://openalex.org/W2071063111","https://openalex.org/W2154951198","https://openalex.org/W25030584","https://openalex.org/W2965106131","https://openalex.org/W2962885385"],"abstract_inverted_index":{"An":[0],"adaptive":[1],"full":[2],"Newton-step":[3,41],"infeasible-interior-point":[4],"method":[5,34,82],"for":[6,20,73,101],"solving":[7],"sufficient":[8,16],"horizontal":[9,130],"linear":[10,131],"complementarity":[11,132],"problems":[12],"is":[13,35,42,58,107],"analysed":[14],"and":[15],"conditions":[17],"are":[18,71],"given":[19],"the":[21,25,33,37,40,74,84,89,92,102,105,116,119],"superlinear":[22,68],"convergence":[23,69],"of":[24,27,32,80,104,118],"sequence":[26],"iterates.":[28],"The":[29,77,109],"main":[30],"feature":[31],"that":[36,66,97,122],"parameter":[38,57],"defining":[39],"adaptively":[43],"chosen":[44],"at":[45,61],"each":[46],"iteration,":[47],"in":[48,88],"contrast":[49],"with":[50],"previous":[51],"full-Newton":[52],"step":[53],"methods":[54],"where":[55],"this":[56],"kept":[59],"fixed":[60],"all":[62],"iterations.":[63],"We":[64],"mention":[65],"no":[67],"results":[70,87],"known":[72,86],"latter":[75],"methods.":[76],"theoretical":[78],"complexity":[79],"our":[81],"matches":[83],"best":[85],"literature.":[90],"In":[91],"first":[93],"algorithm,":[94],"we":[95],"assume":[96],"an":[98],"upper":[99],"bound":[100],"handicap":[103,117],"problem":[106],"known.":[108],"second":[110],"algorithm":[111],"does":[112],"not":[113],"depend":[114],"on":[115],"problem,":[120],"so":[121],"it":[123],"can":[124],"readily":[125],"be":[126],"applied":[127],"to":[128],"any":[129],"problem.":[133]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}