{"id":"https://openalex.org/W2072446998","doi":"https://doi.org/10.1137/0806006","title":"An Efficient Newton Barrier Method for Minimizing a Sum of Euclidean Norms","display_name":"An Efficient Newton Barrier Method for Minimizing a Sum of Euclidean Norms","publication_year":1996,"publication_date":"1996-02-01","ids":{"openalex":"https://openalex.org/W2072446998","doi":"https://doi.org/10.1137/0806006","mag":"2072446998"},"language":"en","primary_location":{"id":"doi:10.1137/0806006","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0806006","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/A5063394505","display_name":"Knud D. Andersen","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Knud D. Andersen","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5063394505"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.2692,"has_fulltext":false,"cited_by_count":45,"citation_normalized_percentile":{"value":0.98140388,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"6","issue":"1","first_page":"74","last_page":"95"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9977999925613403,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9943000078201294,"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.8580901622772217},{"id":"https://openalex.org/keywords/duality-gap","display_name":"Duality gap","score":0.7085947394371033},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.6298125982284546},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.6135907173156738},{"id":"https://openalex.org/keywords/differentiable-function","display_name":"Differentiable function","score":0.573143482208252},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.5688567757606506},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.5376381278038025},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.5044428110122681},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.4354248642921448},{"id":"https://openalex.org/keywords/bellman-equation","display_name":"Bellman equation","score":0.41613635420799255},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.41433846950531006},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.41146695613861084},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38514113426208496},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3829314410686493},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38292086124420166},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.37338459491729736},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.25043147802352905}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8580901622772217},{"id":"https://openalex.org/C5274546","wikidata":"https://www.wikidata.org/wiki/Q5310264","display_name":"Duality gap","level":3,"score":0.7085947394371033},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.6298125982284546},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6135907173156738},{"id":"https://openalex.org/C202615002","wikidata":"https://www.wikidata.org/wiki/Q783507","display_name":"Differentiable function","level":2,"score":0.573143482208252},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.5688567757606506},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.5376381278038025},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.5044428110122681},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4354248642921448},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.41613635420799255},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.41433846950531006},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.41146695613861084},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38514113426208496},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3829314410686493},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38292086124420166},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.37338459491729736},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.25043147802352905},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0806006","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0806006","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":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.4000000059604645}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W52668201","https://openalex.org/W95071424","https://openalex.org/W126081593","https://openalex.org/W1573409602","https://openalex.org/W1973117121","https://openalex.org/W1979556467","https://openalex.org/W1981885118","https://openalex.org/W1986192627","https://openalex.org/W1987953347","https://openalex.org/W1995386580","https://openalex.org/W2007797219","https://openalex.org/W2019015445","https://openalex.org/W2022842990","https://openalex.org/W2048901266","https://openalex.org/W2049421260","https://openalex.org/W2078083223","https://openalex.org/W2079547145","https://openalex.org/W2086594463","https://openalex.org/W2086648616","https://openalex.org/W2086867325","https://openalex.org/W2095724795","https://openalex.org/W2326806701","https://openalex.org/W4300549156"],"related_works":["https://openalex.org/W1533868172","https://openalex.org/W1983813429","https://openalex.org/W37717830","https://openalex.org/W2089015038","https://openalex.org/W202615542","https://openalex.org/W2058475249","https://openalex.org/W1971720918","https://openalex.org/W2102482069","https://openalex.org/W2032043463","https://openalex.org/W4388292758"],"abstract_inverted_index":{"A":[0],"new":[1],"Newton":[2],"barrier":[3],"method":[4,51,99],"is":[5,30,36,48,53,74,92,114,131],"proposed":[6],"for":[7,110,122,133,142],"minimizing":[8],"a":[9,31,59,78,103],"sum":[10],"of":[11,45,97,105,128],"Euclidean":[12],"norms":[13,47],"(MSN),":[14],"$F(":[15],"x":[16,24,42],")":[17],"=":[18,20],"\\sum_{i":[19],"1}^k":[21],"\\|":[22],"A_i^T":[23],"-":[25],"b_i":[26],"\\|_2":[27],"$.":[28],"MSN":[29,73],"nonsmooth":[32],"problem":[33,80],"because":[34],"F":[35,57],"not":[37],"differentiable":[38],"at":[39],"any":[40,44],"point":[41],"where":[43],"the":[46,64,67,95,98,111,119,123,129],"zero.":[49],"The":[50],"used":[52,93],"based":[54],"on":[55],"approximating":[56],"with":[58,81,144],"smooth":[60,112],"function,":[61],"which":[62],"in":[63,88,94,118],"limit":[65],"has":[66],"same":[68],"optimal":[69,108],"value":[70],"as":[71],"F.":[72],"shown":[75],"to":[76,85,101],"have":[77],"dual":[79],"properties":[82],"very":[83],"similar":[84],"duality":[86,120],"theory":[87],"linear":[89],"programming.":[90],"This":[91],"development":[96],"and":[100,137],"give":[102],"proof":[104],"when":[106],"an":[107],"solution":[109],"approximation":[113],"$\\epsilon":[115],"$-optimal":[116],"(measured":[117],"gap)":[121],"original":[124],"problem.":[125],"An":[126],"implementation":[127],"algorithm":[130],"described":[132],"large":[134],"sparse":[135],"problems":[136,143,151],"numerical":[138],"results":[139],"are":[140],"presented":[141],"more":[145],"than":[146],"270,000":[147],"nonlinear":[148],"variables.":[149],"These":[150],"arise":[152],"from":[153],"plastic":[154],"collapse":[155],"analysis.":[156]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}