{"id":"https://openalex.org/W2016570470","doi":"https://doi.org/10.1137/050637480","title":"Feasible and Noninterior Path\u2010Following in Constrained Minimization with Low Multiplier Regularity","display_name":"Feasible and Noninterior Path\u2010Following in Constrained Minimization with Low Multiplier Regularity","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2016570470","doi":"https://doi.org/10.1137/050637480","mag":"2016570470"},"language":"en","primary_location":{"id":"doi:10.1137/050637480","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050637480","pdf_url":null,"source":{"id":"https://openalex.org/S897311980","display_name":"SIAM Journal on Control and Optimization","issn_l":"0363-0129","issn":["0363-0129","1095-7138"],"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 Control and Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://unipub.uni-graz.at/obvugroa/content/titleinfo/133160/full.pdf","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":["Department of Mathematics and Scientific Computing, University of Graz, Heinrichstra\u00dfe 36, A-8010 Graz, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Scientific Computing, University of Graz, Heinrichstra\u00dfe 36, A-8010 Graz, Austria","institution_ids":["https://openalex.org/I15766117"]}]},{"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":["Department of Mathematics and Scientific Computing, University of Graz, Heinrichstra\u00dfe 36, A-8010 Graz, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Scientific Computing, University of Graz, Heinrichstra\u00dfe 36, A-8010 Graz, Austria","institution_ids":["https://openalex.org/I15766117"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":14.508,"has_fulltext":true,"cited_by_count":98,"citation_normalized_percentile":{"value":0.99452055,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"45","issue":"4","first_page":"1198","last_page":"1221"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9997000098228455,"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.9997000098228455,"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.9987000226974487,"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/T13855","display_name":"Aerospace Engineering and Control Systems","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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.8105258941650391},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6952897310256958},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6404597759246826},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6350566744804382},{"id":"https://openalex.org/keywords/multiplier","display_name":"Multiplier (economics)","score":0.613723635673523},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.46228814125061035},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.44967323541641235},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.4451764225959778},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16115128993988037}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8105258941650391},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6952897310256958},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6404597759246826},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6350566744804382},{"id":"https://openalex.org/C124584101","wikidata":"https://www.wikidata.org/wiki/Q1053266","display_name":"Multiplier (economics)","level":2,"score":0.613723635673523},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.46228814125061035},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.44967323541641235},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.4451764225959778},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16115128993988037},{"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/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","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/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C139719470","wikidata":"https://www.wikidata.org/wiki/Q39680","display_name":"Macroeconomics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/050637480","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050637480","pdf_url":null,"source":{"id":"https://openalex.org/S897311980","display_name":"SIAM Journal on Control and Optimization","issn_l":"0363-0129","issn":["0363-0129","1095-7138"],"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 Control and Optimization","raw_type":"journal-article"},{"id":"pmh:oai:unipub.uni-graz.at:133160","is_oa":true,"landing_page_url":"http://resolver.obvsg.at/urn:nbn:at:at-ubg:3-927","pdf_url":"https://unipub.uni-graz.at/obvugroa/content/titleinfo/133160/full.pdf","source":{"id":"https://openalex.org/S4306400359","display_name":"Unipub UB Graz (Universit\u00e4t Graz)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I15766117","host_organization_name":"University of Graz","host_organization_lineage":["https://openalex.org/I15766117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:figshare.com:article/23330477","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/Feasible_and_noninterior_path-following_in_constrained_minimization_with_low_multiplier_regularity/23330477","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:unipub.uni-graz.at:133160","is_oa":true,"landing_page_url":"http://resolver.obvsg.at/urn:nbn:at:at-ubg:3-927","pdf_url":"https://unipub.uni-graz.at/obvugroa/content/titleinfo/133160/full.pdf","source":{"id":"https://openalex.org/S4306400359","display_name":"Unipub UB Graz (Universit\u00e4t Graz)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I15766117","host_organization_name":"University of Graz","host_organization_lineage":["https://openalex.org/I15766117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2016570470.pdf","grobid_xml":"https://content.openalex.org/works/W2016570470.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W1539280904","https://openalex.org/W2002230262","https://openalex.org/W2022088322","https://openalex.org/W2026365342","https://openalex.org/W2032144293","https://openalex.org/W2064167244","https://openalex.org/W2069671092","https://openalex.org/W2070289182","https://openalex.org/W2070584352","https://openalex.org/W2073943124","https://openalex.org/W2075205943","https://openalex.org/W2086867325","https://openalex.org/W2087003257","https://openalex.org/W2138026757","https://openalex.org/W2799015047","https://openalex.org/W4230272019","https://openalex.org/W4250028192"],"related_works":["https://openalex.org/W4378529241","https://openalex.org/W2483828597","https://openalex.org/W2088213153","https://openalex.org/W2921318248","https://openalex.org/W2064842217","https://openalex.org/W2071063111","https://openalex.org/W2154951198","https://openalex.org/W25030584","https://openalex.org/W2965106131","https://openalex.org/W4300450507"],"abstract_inverted_index":{"Primal\u2010dual":[0],"path\u2010following":[1,61,84],"methods":[2],"for":[3,37,46,88],"constrained":[4,90],"minimization":[5],"problems":[6,93],"in":[7,42],"function":[8],"space":[9],"with":[10,82],"low":[11],"multiplier":[12],"regularity":[13],"are":[14,23,35,63],"introduced":[15],"and":[16,76],"analyzed.":[17],"Regularity":[18],"properties":[19],"of":[20,50,58,97],"the":[21,39,51,59,95,98],"path":[22,26,40],"proved.":[24],"The":[25,54,70],"structure":[27],"allows":[28],"us":[29],"to":[30],"define":[31],"approximating":[32],"models,":[33],"which":[34],"used":[36],"controlling":[38],"parameter":[41],"an":[43],"iterative":[44],"process":[45],"computing":[47],"a":[48,80],"solution":[49],"original":[52],"problem.":[53],"Moreau\u2013Yosida":[55],"regularized":[56],"subproblems":[57],"new":[60,99],"technique":[62],"solved":[64],"efficiently":[65],"by":[66],"semismooth":[67],"Newton":[68],"methods.":[69],"overall":[71],"algorithmic":[72],"concept":[73],"is":[74],"provided,":[75],"numerical":[77],"tests":[78],"(including":[79],"comparison":[81],"primal\u2010dual":[83],"interior":[85],"point":[86],"methods)":[87],"state":[89],"optimal":[91],"control":[92],"show":[94],"efficiency":[96],"concept.":[100]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}