{"id":"https://openalex.org/W2098937771","doi":"https://doi.org/10.1137/0805007","title":"A Positive Algorithm for the Nonlinear Complementarity Problem","display_name":"A Positive Algorithm for the Nonlinear Complementarity Problem","publication_year":1995,"publication_date":"1995-02-01","ids":{"openalex":"https://openalex.org/W2098937771","doi":"https://doi.org/10.1137/0805007","mag":"2098937771"},"language":"en","primary_location":{"id":"doi:10.1137/0805007","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0805007","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/A5108765688","display_name":"Renato D. C. Monteiro","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Renato D. C. Monteiro","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002789695","display_name":"Jong\u2010Shi Pang","orcid":"https://orcid.org/0000-0002-2224-6787"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jong-Shi Pang","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100453475","display_name":"Tao Wang","orcid":"https://orcid.org/0000-0002-1391-7331"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tao Wang","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5108765688"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.5889,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.97342342,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"5","issue":"1","first_page":"129","last_page":"148"},"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9966999888420105,"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.9947999715805054,"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.8511818647384644},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.7840412855148315},{"id":"https://openalex.org/keywords/orthant","display_name":"Orthant","score":0.7669416666030884},{"id":"https://openalex.org/keywords/nonlinear-complementarity-problem","display_name":"Nonlinear complementarity problem","score":0.6821057200431824},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5459427833557129},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5414770245552063},{"id":"https://openalex.org/keywords/linear-complementarity-problem","display_name":"Linear complementarity problem","score":0.5112111568450928},{"id":"https://openalex.org/keywords/descent-direction","display_name":"Descent direction","score":0.4895235300064087},{"id":"https://openalex.org/keywords/trust-region","display_name":"Trust region","score":0.48612475395202637},{"id":"https://openalex.org/keywords/complementarity-theory","display_name":"Complementarity theory","score":0.4804943799972534},{"id":"https://openalex.org/keywords/limit-point","display_name":"Limit point","score":0.473435640335083},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4582142233848572},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.45549023151397705},{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.4404032230377197},{"id":"https://openalex.org/keywords/newtons-method","display_name":"Newton's method","score":0.4278612434864044},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.42665421962738037},{"id":"https://openalex.org/keywords/newtons-method-in-optimization","display_name":"Newton's method in optimization","score":0.4229617118835449},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.4199497103691101},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.4075383245944977},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.38439974188804626},{"id":"https://openalex.org/keywords/local-convergence","display_name":"Local convergence","score":0.31336069107055664},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.19679304957389832},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.1665647029876709},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.16497918963432312},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12196123600006104}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8511818647384644},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.7840412855148315},{"id":"https://openalex.org/C2780016784","wikidata":"https://www.wikidata.org/wiki/Q2714507","display_name":"Orthant","level":2,"score":0.7669416666030884},{"id":"https://openalex.org/C2778646529","wikidata":"https://www.wikidata.org/wiki/Q16948724","display_name":"Nonlinear complementarity problem","level":4,"score":0.6821057200431824},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5459427833557129},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5414770245552063},{"id":"https://openalex.org/C34320192","wikidata":"https://www.wikidata.org/wiki/Q783105","display_name":"Linear complementarity problem","level":3,"score":0.5112111568450928},{"id":"https://openalex.org/C116149140","wikidata":"https://www.wikidata.org/wiki/Q2070951","display_name":"Descent direction","level":4,"score":0.4895235300064087},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.48612475395202637},{"id":"https://openalex.org/C85404239","wikidata":"https://www.wikidata.org/wiki/Q5156417","display_name":"Complementarity theory","level":3,"score":0.4804943799972534},{"id":"https://openalex.org/C63548660","wikidata":"https://www.wikidata.org/wiki/Q858223","display_name":"Limit point","level":2,"score":0.473435640335083},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4582142233848572},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.45549023151397705},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.4404032230377197},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.4278612434864044},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.42665421962738037},{"id":"https://openalex.org/C179127668","wikidata":"https://www.wikidata.org/wiki/Q17086396","display_name":"Newton's method in optimization","level":4,"score":0.4229617118835449},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.4199497103691101},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4075383245944977},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.38439974188804626},{"id":"https://openalex.org/C117898588","wikidata":"https://www.wikidata.org/wiki/Q6664310","display_name":"Local convergence","level":3,"score":0.31336069107055664},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.19679304957389832},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.1665647029876709},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.16497918963432312},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12196123600006104},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"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/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0805007","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0805007","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W65560571","https://openalex.org/W67212155","https://openalex.org/W1570961610","https://openalex.org/W1982356825","https://openalex.org/W2000151369","https://openalex.org/W2003570424","https://openalex.org/W2008062072","https://openalex.org/W2009885647","https://openalex.org/W2016187009","https://openalex.org/W2030490984","https://openalex.org/W2030674458","https://openalex.org/W2038872086","https://openalex.org/W2042388020","https://openalex.org/W2043868859","https://openalex.org/W2044061073","https://openalex.org/W2050864977","https://openalex.org/W2059352176","https://openalex.org/W2061027379","https://openalex.org/W2062228304","https://openalex.org/W2065909716","https://openalex.org/W2084874903","https://openalex.org/W2093246563","https://openalex.org/W2094757704","https://openalex.org/W2100935224","https://openalex.org/W2108105954","https://openalex.org/W2146241362","https://openalex.org/W2151431157","https://openalex.org/W2166161964","https://openalex.org/W3004157836","https://openalex.org/W4255866397","https://openalex.org/W4378195498"],"related_works":["https://openalex.org/W2098918699","https://openalex.org/W2081101031","https://openalex.org/W2039049002","https://openalex.org/W2808820944","https://openalex.org/W4310291161","https://openalex.org/W125730541","https://openalex.org/W2375197257","https://openalex.org/W2098937771","https://openalex.org/W1024912457","https://openalex.org/W2182029216"],"abstract_inverted_index":{"In":[0],"this":[1,33],"paper,":[2],"the":[3,8,17,46,55,60,63,66,72,90,101,138],"authors":[4],"describe":[5],"and":[6,35],"establish":[7],"convergence":[9],"of":[10,43,62,89,106,113],"a":[11,79,85,97,104,111,118,130],"new":[12,94],"iterative":[13],"method":[14,24,74],"for":[15,31,100,129,143],"solving":[16,32,110],"(nonmonotone)":[18],"nonlinear":[19],"complementarily":[20,91],"problem":[21,34],"(NCP).":[22],"The":[23,93],"utilizes":[25],"ideas":[26],"from":[27,137],"two":[28],"distinct":[29],"pproaches":[30],"combines":[36],"them":[37],"into":[38],"one":[39],"unified":[40],"framework.":[41],"One":[42],"these":[44],"is":[45,69,76,135],"infeasible-interior-point":[47],"approach":[48,68],"that":[49,134],"computes":[50],"an":[51,146],"approximate":[52],"solution":[53],"to":[54,84],"NCP":[56],"by":[57,71,109],"staying":[58],"in":[59,117,145],"interior":[61],"nonnegative":[64],"orthant;":[65],"other":[67],"typified":[70],"NE/SQP":[73,139],"which":[75],"based":[77],"on":[78],"generalized":[80],"Gauss\u2013Newton":[81],"scheme":[82],"applied":[83],"constrained":[86],"nonsmooth-equations":[87],"formulation":[88],"problem.":[92],"method,":[95],"called":[96],"positive":[98,107],"algorithm":[99],"NCP,":[102],"generates":[103],"sequence":[105,112],"vectors":[108],"linear":[114],"equations":[115],"(as":[116],"typical":[119],"interior-point":[120,147],"method)":[121],"whose":[122],"solutions":[123],"(if":[124],"nonzero)":[125],"provide":[126],"descent":[127],"directions":[128],"certain":[131],"merit":[132],"function":[133,141],"derived":[136],"iteration":[140],"modified":[142],"use":[144],"context.":[148]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}