{"id":"https://openalex.org/W2239959958","doi":"https://doi.org/10.1051/ro/2015020","title":"Complexity analysis of a weighted-full-Newton step interior-point algorithm forP\u2217(\u03ba)-LCP","display_name":"Complexity analysis of a weighted-full-Newton step interior-point algorithm forP\u2217(\u03ba)-LCP","publication_year":2015,"publication_date":"2015-06-12","ids":{"openalex":"https://openalex.org/W2239959958","doi":"https://doi.org/10.1051/ro/2015020","mag":"2239959958"},"language":"en","primary_location":{"id":"doi:10.1051/ro/2015020","is_oa":false,"landing_page_url":"http://doi.org/10.1051/ro/2015020","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"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","https://openalex.org/P4310319982"],"host_organization_lineage_names":["EDP Sciences","Science Press"],"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100338763","display_name":"Mohamed Achache","orcid":"https://orcid.org/0009-0007-4153-3371"},"institutions":[{"id":"https://openalex.org/I40193446","display_name":"University Ferhat Abbas of Setif","ror":"https://ror.org/02rzqza52","country_code":"DZ","type":"education","lineage":["https://openalex.org/I40193446"]}],"countries":["DZ"],"is_corresponding":true,"raw_author_name":"Mohamed Achache","raw_affiliation_strings":["Laboratoire de Math\u00e9matiques Fondamentales et Num\u00e9riques. Universit\u00e9 Ferhat Abbas, S\u00e9tif 1, 19000 S\u00e9tif, Alg\u00e9rie"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire de Math\u00e9matiques Fondamentales et Num\u00e9riques. Universit\u00e9 Ferhat Abbas, S\u00e9tif 1, 19000 S\u00e9tif, Alg\u00e9rie","institution_ids":["https://openalex.org/I40193446"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100338763"],"corresponding_institution_ids":["https://openalex.org/I40193446"],"apc_list":{"value":0,"currency":"EUR","value_usd":0},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.12468997,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"50","issue":"1","first_page":"131","last_page":"143"},"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9952999949455261,"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/T12661","display_name":"Iterative Methods for Nonlinear Equations","score":0.9850999712944031,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.8609981536865234},{"id":"https://openalex.org/keywords/quadratic-growth","display_name":"Quadratic growth","score":0.8133771419525146},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6871750354766846},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6778308749198914},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5598275661468506},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5309101343154907},{"id":"https://openalex.org/keywords/newtons-method-in-optimization","display_name":"Newton's method in optimization","score":0.5173375010490417},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47095924615859985},{"id":"https://openalex.org/keywords/linear-complementarity-problem","display_name":"Linear complementarity problem","score":0.4570695161819458},{"id":"https://openalex.org/keywords/complementarity","display_name":"Complementarity (molecular biology)","score":0.4134473204612732},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3572438359260559},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.27135181427001953},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24466902017593384},{"id":"https://openalex.org/keywords/local-convergence","display_name":"Local convergence","score":0.1952308714389801},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.11805883049964905},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.05952146649360657}],"concepts":[{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.8609981536865234},{"id":"https://openalex.org/C195956108","wikidata":"https://www.wikidata.org/wiki/Q7268362","display_name":"Quadratic growth","level":2,"score":0.8133771419525146},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6871750354766846},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6778308749198914},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5598275661468506},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5309101343154907},{"id":"https://openalex.org/C179127668","wikidata":"https://www.wikidata.org/wiki/Q17086396","display_name":"Newton's method in optimization","level":4,"score":0.5173375010490417},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47095924615859985},{"id":"https://openalex.org/C34320192","wikidata":"https://www.wikidata.org/wiki/Q783105","display_name":"Linear complementarity problem","level":3,"score":0.4570695161819458},{"id":"https://openalex.org/C202269582","wikidata":"https://www.wikidata.org/wiki/Q2644277","display_name":"Complementarity (molecular biology)","level":2,"score":0.4134473204612732},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3572438359260559},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.27135181427001953},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24466902017593384},{"id":"https://openalex.org/C117898588","wikidata":"https://www.wikidata.org/wiki/Q6664310","display_name":"Local convergence","level":3,"score":0.1952308714389801},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.11805883049964905},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.05952146649360657},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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":2,"locations":[{"id":"doi:10.1051/ro/2015020","is_oa":false,"landing_page_url":"http://doi.org/10.1051/ro/2015020","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"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","https://openalex.org/P4310319982"],"host_organization_lineage_names":["EDP Sciences","Science Press"],"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_2016__50_1_131_0","is_oa":false,"landing_page_url":"https://www.numdam.org/articles/10.1051/ro/2015020/","pdf_url":null,"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":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W56357078","https://openalex.org/W121082344","https://openalex.org/W1493426390","https://openalex.org/W1518039036","https://openalex.org/W1971375329","https://openalex.org/W1979376655","https://openalex.org/W1985564371","https://openalex.org/W1992726595","https://openalex.org/W2000151369","https://openalex.org/W2033871588","https://openalex.org/W2060571538","https://openalex.org/W2100364159","https://openalex.org/W2601252150","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2037790839","https://openalex.org/W2276648117","https://openalex.org/W2026496434","https://openalex.org/W2224859476","https://openalex.org/W1548681518","https://openalex.org/W1982484829","https://openalex.org/W2053561689","https://openalex.org/W1536532856","https://openalex.org/W2391752817","https://openalex.org/W2884929662"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"a":[3,42],"weighted-path-following":[4],"interior":[5,27],"point":[6,28],"algorithm":[7,22,54,67],"for":[8,40,44],"P":[9,45],"\u2217":[10,16,46],"(\u03ba":[11,17,47],")-linear":[12],"complementarity":[13],"problems":[14],"(P":[15],")-LCP)":[18],"is":[19,68],"presented.":[20],"The":[21,61],"uses":[23],"at":[24],"each":[25],"weighted":[26],"iteration":[29],"only":[30],"feasible":[31],"full-Newton":[32],"steps":[33],"and":[34],"the":[35,38,52,66,77,80],"strategy":[36],"of":[37,65,79],"central-path":[39],"getting":[41],"solution":[43],")-LCP.":[48],"We":[49],"prove":[50],"that":[51],"proposed":[53],"has":[55],"quadratically":[56],"convergent":[57],"with":[58],"polynomial":[59],"time.":[60],"complexity":[62],"bound,":[63],"namely,":[64],"obtained.":[69],"Few":[70],"numerical":[71],"tests":[72],"are":[73],"reported":[74],"to":[75],"show":[76],"efficiency":[78],"algorithm.":[81]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}