{"id":"https://openalex.org/W2026365342","doi":"https://doi.org/10.1137/s1052623401383558","title":"The Primal-Dual Active Set Strategy as a Semismooth Newton Method","display_name":"The Primal-Dual Active Set Strategy as a Semismooth Newton Method","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2026365342","doi":"https://doi.org/10.1137/s1052623401383558","mag":"2026365342"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623401383558","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623401383558","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://hal.science/hal-01660511","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062202097","display_name":"Michael Hinterm\u00fcller","orcid":"https://orcid.org/0000-0001-9471-2479"},"institutions":[{"id":"https://openalex.org/I15766117","display_name":"University of Graz","ror":"https://ror.org/01faaaf77","country_code":"AT","type":"education","lineage":["https://openalex.org/I15766117"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"M. Hinterm\u00fcller","raw_affiliation_strings":["University of Graz"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Graz","institution_ids":["https://openalex.org/I15766117"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004826461","display_name":"Kazufumi Ito","orcid":"https://orcid.org/0000-0003-2417-2600"},"institutions":[{"id":"https://openalex.org/I137902535","display_name":"North Carolina State University","ror":"https://ror.org/04tj63d06","country_code":"US","type":"education","lineage":["https://openalex.org/I137902535"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. Ito","raw_affiliation_strings":["North Carolina State University, Raleigh#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"North Carolina State University, Raleigh#TAB#","institution_ids":["https://openalex.org/I137902535"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074607617","display_name":"Karl Kunisch","orcid":"https://orcid.org/0000-0003-1113-7355"},"institutions":[{"id":"https://openalex.org/I15766117","display_name":"University of Graz","ror":"https://ror.org/01faaaf77","country_code":"AT","type":"education","lineage":["https://openalex.org/I15766117"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"K. Kunisch","raw_affiliation_strings":["University of Graz"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Graz","institution_ids":["https://openalex.org/I15766117"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":17.2274,"has_fulltext":false,"cited_by_count":983,"citation_normalized_percentile":{"value":0.99596273,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"13","issue":"3","first_page":"865","last_page":"888"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9983999729156494,"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.9983999729156494,"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/T11236","display_name":"Control Systems and Identification","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10791","display_name":"Advanced Control Systems Optimization","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"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.7724734544754028},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.6523177623748779},{"id":"https://openalex.org/keywords/newtons-method","display_name":"Newton's method","score":0.5664825439453125},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5517213940620422},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48167693614959717},{"id":"https://openalex.org/keywords/newton-fractal","display_name":"Newton fractal","score":0.41202202439308167},{"id":"https://openalex.org/keywords/local-convergence","display_name":"Local convergence","score":0.20286741852760315},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15772762894630432},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.1561170518398285},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.06727665662765503}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7724734544754028},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.6523177623748779},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.5664825439453125},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5517213940620422},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48167693614959717},{"id":"https://openalex.org/C194342247","wikidata":"https://www.wikidata.org/wiki/Q1151001","display_name":"Newton fractal","level":4,"score":0.41202202439308167},{"id":"https://openalex.org/C117898588","wikidata":"https://www.wikidata.org/wiki/Q6664310","display_name":"Local convergence","level":3,"score":0.20286741852760315},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15772762894630432},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.1561170518398285},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.06727665662765503},{"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/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s1052623401383558","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623401383558","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:HAL:hal-01660511v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01660511","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Optimization, 2002, 13 (3), pp.865 - 888. ⟨10.1137/S1052623401383558⟩","raw_type":"Journal articles"},{"id":"pmh:oai:figshare.com:article/23352386","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/The_primal-dual_active_set_strategy_as_a_semismooth_Newton_method/23352386","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01660511v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01660511","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Optimization, 2002, 13 (3), pp.865 - 888. ⟨10.1137/S1052623401383558⟩","raw_type":"Journal articles"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1500921805","https://openalex.org/W1551360398","https://openalex.org/W1977135073","https://openalex.org/W1992688650","https://openalex.org/W2002230262","https://openalex.org/W2009257336","https://openalex.org/W2010840377","https://openalex.org/W2022585151","https://openalex.org/W2023092664","https://openalex.org/W2037179686","https://openalex.org/W2042153418","https://openalex.org/W2055183575","https://openalex.org/W2063318629","https://openalex.org/W2067547116","https://openalex.org/W2070584352","https://openalex.org/W2075205943","https://openalex.org/W2076818754","https://openalex.org/W2087003257","https://openalex.org/W2092855431","https://openalex.org/W2113734366","https://openalex.org/W2225782853","https://openalex.org/W2327148624","https://openalex.org/W4234200150"],"related_works":["https://openalex.org/W2356844075","https://openalex.org/W1980417728","https://openalex.org/W84551887","https://openalex.org/W1561729596","https://openalex.org/W2225109343","https://openalex.org/W1985487460","https://openalex.org/W2276000398","https://openalex.org/W4303856916","https://openalex.org/W2902913510","https://openalex.org/W1892423286"],"abstract_inverted_index":{"International":[0],"audience":[1]},"counts_by_year":[{"year":2026,"cited_by_count":14},{"year":2025,"cited_by_count":41},{"year":2024,"cited_by_count":44},{"year":2023,"cited_by_count":47},{"year":2022,"cited_by_count":42},{"year":2021,"cited_by_count":54},{"year":2020,"cited_by_count":50},{"year":2019,"cited_by_count":53},{"year":2018,"cited_by_count":52},{"year":2017,"cited_by_count":58},{"year":2016,"cited_by_count":43},{"year":2015,"cited_by_count":52},{"year":2014,"cited_by_count":72},{"year":2013,"cited_by_count":40},{"year":2012,"cited_by_count":49}],"updated_date":"2026-06-14T07:44:22.658603","created_date":"2025-10-10T00:00:00"}