{"id":"https://openalex.org/W1978554456","doi":"https://doi.org/10.1137/s1052623496305560","title":"Primal-Dual Interior Methods for Nonconvex Nonlinear Programming","display_name":"Primal-Dual Interior Methods for Nonconvex Nonlinear Programming","publication_year":1998,"publication_date":"1998-11-01","ids":{"openalex":"https://openalex.org/W1978554456","doi":"https://doi.org/10.1137/s1052623496305560","mag":"1978554456"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623496305560","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623496305560","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/A5033807851","display_name":"Anders Forsgren","orcid":"https://orcid.org/0000-0002-6252-7815"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Anders Forsgren","raw_affiliation_strings":["Department of Mathematics, Royal Institute of Technology, SE-100 44 Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Royal Institute of Technology, SE-100 44 Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003732991","display_name":"Philip E. Gill","orcid":null},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Philip E. Gill","raw_affiliation_strings":["Department of Mathematics, University of California, San Diego, La Jolla, CA 92093-0112"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of California, San Diego, La Jolla, CA 92093-0112","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5033807851"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":10.2474,"has_fulltext":false,"cited_by_count":172,"citation_normalized_percentile":{"value":0.98592169,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"8","issue":"4","first_page":"1132","last_page":"1152"},"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9969000220298767,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9800000190734863,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7588451504707336},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.6768195629119873},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6632457971572876},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.612755537033081},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.5887560844421387},{"id":"https://openalex.org/keywords/descent-direction","display_name":"Descent direction","score":0.5370883345603943},{"id":"https://openalex.org/keywords/trust-region","display_name":"Trust region","score":0.4776386320590973},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.44875913858413696},{"id":"https://openalex.org/keywords/scalar","display_name":"Scalar (mathematics)","score":0.43462368845939636},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.4147321581840515},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3571779131889343},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.23719874024391174},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21895694732666016},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17109349370002747}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7588451504707336},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.6768195629119873},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6632457971572876},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.612755537033081},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.5887560844421387},{"id":"https://openalex.org/C116149140","wikidata":"https://www.wikidata.org/wiki/Q2070951","display_name":"Descent direction","level":4,"score":0.5370883345603943},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.4776386320590973},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.44875913858413696},{"id":"https://openalex.org/C57691317","wikidata":"https://www.wikidata.org/wiki/Q1289248","display_name":"Scalar (mathematics)","level":2,"score":0.43462368845939636},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.4147321581840515},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3571779131889343},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.23719874024391174},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21895694732666016},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17109349370002747},{"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/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","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/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s1052623496305560","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623496305560","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.101.3074","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.3074","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.kth.se/~andersf/doc/siopt30556.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7300000190734863,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G2684071060","display_name":"Large-Scale Constrained Optimization","funder_award_id":"9424639","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6507447573","display_name":null,"funder_award_id":"several","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8876996369","display_name":null,"funder_award_id":"N00014","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320177","display_name":"US-UK Fulbright Commission","ror":"https://ror.org/037nbwt68"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W47264501","https://openalex.org/W1533868172","https://openalex.org/W1559779211","https://openalex.org/W1573409602","https://openalex.org/W1574856455","https://openalex.org/W1580352598","https://openalex.org/W1967810262","https://openalex.org/W1973909189","https://openalex.org/W1974153211","https://openalex.org/W1977361487","https://openalex.org/W1984488466","https://openalex.org/W1984633545","https://openalex.org/W1991682620","https://openalex.org/W1995393679","https://openalex.org/W2014746566","https://openalex.org/W2017666390","https://openalex.org/W2020804487","https://openalex.org/W2030490984","https://openalex.org/W2031392034","https://openalex.org/W2036370633","https://openalex.org/W2036622774","https://openalex.org/W2039665200","https://openalex.org/W2041684917","https://openalex.org/W2046136893","https://openalex.org/W2046222402","https://openalex.org/W2051960168","https://openalex.org/W2055028111","https://openalex.org/W2055605148","https://openalex.org/W2062523101","https://openalex.org/W2066746998","https://openalex.org/W2068484625","https://openalex.org/W2071425572","https://openalex.org/W2083431695","https://openalex.org/W2086867325","https://openalex.org/W2087974793","https://openalex.org/W2088484050","https://openalex.org/W2090523290","https://openalex.org/W2092677228","https://openalex.org/W2134847890","https://openalex.org/W2168825111","https://openalex.org/W2170451819","https://openalex.org/W3022909171","https://openalex.org/W4246224179","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2098918699","https://openalex.org/W2167631998","https://openalex.org/W3065284018","https://openalex.org/W2082035118","https://openalex.org/W2587010758","https://openalex.org/W1970914972","https://openalex.org/W125730541","https://openalex.org/W2025795821","https://openalex.org/W3216598731","https://openalex.org/W2902609575"],"abstract_inverted_index":{"Abstract.":[0],"This":[1],"paper":[2],"concerns":[3],"large-scale":[4],"general":[5],"(nonconvex)":[6],"nonlinear":[7],"programming":[8],"when":[9],"first":[10],"and":[11,17,61,104,118],"second":[12],"derivatives":[13],"of":[14,34,37,48,101,120,142],"the":[15,102,124],"objective":[16,46],"constraint":[18],"functions":[19],"are":[20],"available.":[21],"A":[22,129],"method":[23,72,130],"is":[24,27,52,66,112],"proposed":[25,84],"that":[26,57,73,83,145],"based":[28],"on":[29],"finding":[30],"an":[31,53],"approximate":[32],"solution":[33],"a":[35,42,69,78,96,140],"sequence":[36],"unconstrained":[38,50],"subproblems":[39],"parameterized":[40],"by":[41,138],"scalar":[43],"parameter.":[44],"The":[45,88],"function":[47,56,91,98],"each":[49],"subproblem":[51,65],"augmented":[54,89,125],"penalty-barrier":[55,90,126],"involves":[58],"both":[59],"primal":[60,103],"dual":[62,105],"variables.":[63,106],"Each":[64],"solved":[67],"with":[68],"modified":[70],"Newton":[71],"generates":[74],"search":[75],"directions":[76,117,119],"from":[77],"primal-dual":[79],"system":[80],"similar":[81],"to":[82,114],"for":[85,99,123,132],"interior":[86],"methods.":[87],"may":[92],"be":[93,136],"interpreted":[94],"as":[95],"merit":[97,127],"values":[100],"An":[107],"inertia-controlling":[108],"symmetric":[109],"indefinite":[110,150],"factorization":[111,144],"used":[113],"provide":[115],"descent":[116],"negative":[121],"curvature":[122],"function.":[128],"suitable":[131],"large":[133,148],"problems":[134],"can":[135],"obtained":[137],"providing":[139],"version":[141],"this":[143],"will":[146],"treat":[147],"sparse":[149],"systems.":[151]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}