{"id":"https://openalex.org/W1974159169","doi":"https://doi.org/10.1137/s1052623402400641","title":"A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs","display_name":"A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W1974159169","doi":"https://doi.org/10.1137/s1052623402400641","mag":"1974159169"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623402400641","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623402400641","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":true,"oa_status":"green","oa_url":"https://espace.curtin.edu.au/bitstream/20.500.11937/91442/3/91266.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100461515","display_name":"Xinwei Liu","orcid":"https://orcid.org/0000-0002-9829-3395"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Xinwei Liu","raw_affiliation_strings":["National University of Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National University of Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100618850","display_name":"Jie Sun","orcid":"https://orcid.org/0000-0001-5611-1672"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Jie Sun","raw_affiliation_strings":["National University of Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National University of Singapore","institution_ids":["https://openalex.org/I165932596"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I165932596"],"apc_list":null,"apc_paid":null,"fwci":3.9902,"has_fulltext":true,"cited_by_count":37,"citation_normalized_percentile":{"value":0.92787286,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"14","issue":"4","first_page":"1163","last_page":"1186"},"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.9962000250816345,"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.9940999746322632,"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/mathematics","display_name":"Mathematics","score":0.7753893136978149},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.7690902352333069},{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.7643897533416748},{"id":"https://openalex.org/keywords/limit-point","display_name":"Limit point","score":0.7444990873336792},{"id":"https://openalex.org/keywords/descent-direction","display_name":"Descent direction","score":0.6386618614196777},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.5711222290992737},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5565913915634155},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5407677888870239},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5292693376541138},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5233263969421387},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5171458125114441},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.498584508895874},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4907749593257904},{"id":"https://openalex.org/keywords/stationary-point","display_name":"Stationary point","score":0.4779781699180603},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.45650821924209595},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.417207270860672},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.2288326621055603},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19014015793800354},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1566465198993683},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.1549946665763855}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7753893136978149},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.7690902352333069},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.7643897533416748},{"id":"https://openalex.org/C63548660","wikidata":"https://www.wikidata.org/wiki/Q858223","display_name":"Limit point","level":2,"score":0.7444990873336792},{"id":"https://openalex.org/C116149140","wikidata":"https://www.wikidata.org/wiki/Q2070951","display_name":"Descent direction","level":4,"score":0.6386618614196777},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.5711222290992737},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5565913915634155},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5407677888870239},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5292693376541138},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5233263969421387},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5171458125114441},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.498584508895874},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4907749593257904},{"id":"https://openalex.org/C189237950","wikidata":"https://www.wikidata.org/wiki/Q2500758","display_name":"Stationary point","level":2,"score":0.4779781699180603},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.45650821924209595},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.417207270860672},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.2288326621055603},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19014015793800354},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1566465198993683},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.1549946665763855},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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/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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"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/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s1052623402400641","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623402400641","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:espace.curtin.edu.au:20.500.11937/91442","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11937/91442","pdf_url":"https://espace.curtin.edu.au/bitstream/20.500.11937/91442/3/91266.pdf","source":{"id":"https://openalex.org/S4306401790","display_name":"eSpace (Curtin University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205640436","host_organization_name":"Curtin University","host_organization_lineage":["https://openalex.org/I205640436"],"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":"Journal Article"},{"id":"pmh:oai:scholarbank.nus.edu.sg:10635/44231","is_oa":false,"landing_page_url":"http://scholarbank.nus.edu.sg/handle/10635/44231","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.195.1369","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.195.1369","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.bschool.nus.edu.sg/depart/ds/sunjiehomepage/downloads/publications/mip-rr2.pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:espace.curtin.edu.au:20.500.11937/91442","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11937/91442","pdf_url":"https://espace.curtin.edu.au/bitstream/20.500.11937/91442/3/91266.pdf","source":{"id":"https://openalex.org/S4306401790","display_name":"eSpace (Curtin University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205640436","host_organization_name":"Curtin University","host_organization_lineage":["https://openalex.org/I205640436"],"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":"Journal Article"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.4099999964237213,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320698","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1974159169.pdf","grobid_xml":"https://content.openalex.org/works/W1974159169.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W2572016","https://openalex.org/W170686111","https://openalex.org/W1508335918","https://openalex.org/W1588059640","https://openalex.org/W1748199557","https://openalex.org/W1971536112","https://openalex.org/W1976831027","https://openalex.org/W1978554456","https://openalex.org/W1989033306","https://openalex.org/W1991182684","https://openalex.org/W1994469568","https://openalex.org/W1994635453","https://openalex.org/W1999356624","https://openalex.org/W2005865517","https://openalex.org/W2006311627","https://openalex.org/W2010511518","https://openalex.org/W2014746566","https://openalex.org/W2021207880","https://openalex.org/W2041684917","https://openalex.org/W2056868378","https://openalex.org/W2058194880","https://openalex.org/W2066710237","https://openalex.org/W2067649866","https://openalex.org/W2083431695","https://openalex.org/W2091644521","https://openalex.org/W2092677228","https://openalex.org/W2127959492","https://openalex.org/W4240022917","https://openalex.org/W4254755288"],"related_works":["https://openalex.org/W1986602928","https://openalex.org/W2168617555","https://openalex.org/W2117094612","https://openalex.org/W1990909561","https://openalex.org/W125730541","https://openalex.org/W4364382936","https://openalex.org/W4311325154","https://openalex.org/W4312314247","https://openalex.org/W1969207618","https://openalex.org/W1974159169"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,79,84,113,128,134,138,142],"primal-dual":[3],"interior-point":[4,180],"algorithm":[5,15,111,155],"for":[6,96,121,160,172],"solving":[7],"optimization":[8],"problems":[9],"with":[10],"nonlinear":[11],"inequality":[12],"constraints.":[13,149],"The":[14,41],"has":[16,127],"some":[17,122,161],"of":[18,22,69,105,141,147,175],"the":[19,46,57,63,70,106,110,125,145,148,154,157,165,176,186],"theoretical":[20],"properties":[21,34],"trust":[23],"region":[24],"methods,":[25],"but":[26],"works":[27],"entirely":[28],"by":[29,109,168],"line":[30,178],"search.":[31],"Global":[32],"convergence":[33],"are":[35,66],"derived":[36],"without":[37],"assuming":[38],"regularity":[39],"conditions.":[40],"penalty":[42],"parameter":[43,99],"$\\rho$":[44,93,118],"in":[45,56,83],"merit":[47,72],"function":[48,143],"is":[49,89,94,112,119,132],"updated":[50,71],"adaptively":[51],"and":[52,170],"plays":[53],"two":[54],"roles":[55],"algorithm.":[58],"First,":[59],"it":[60,75],"guarantees":[61],"that":[62,91,153],"search":[64,81],"directions":[65,68],"descent":[67],"function.":[73],"Second,":[74],"helps":[76],"to":[77,184],"determine":[78],"suitable":[80],"direction":[82],"decomposed":[85],"SQP":[86],"step.":[87],"It":[88],"shown":[90],"if":[92,117],"bounded":[95],"each":[97],"barrier":[98],"$\\mu$,":[100,123],"then":[101,124],"every":[102],"limit":[103,129],"point":[104,130,136,140],"sequence":[107,126],"generated":[108],"Karush--Kuhn--Tucker":[114],"point,":[115],"whereas":[116],"unbounded":[120],"which":[131,173],"either":[133],"Fritz--John":[135],"or":[137],"stationary":[139],"measuring":[144],"violation":[146],"Numerical":[150],"results":[151,159],"confirm":[152],"produces":[156],"correct":[158],"hard":[162],"problems,":[163],"including":[164],"example":[166],"provided":[167],"W\u00e4chter":[169],"Biegler,":[171],"many":[174],"existing":[177],"search--based":[179],"methods":[181],"have":[182],"failed":[183],"find":[185],"right":[187],"answers.":[188]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}