{"id":"https://openalex.org/W1991334712","doi":"https://doi.org/10.1137/s0363012901398393","title":"Solving Semi-Infinite Optimization Problems with Interior Point Techniques","display_name":"Solving Semi-Infinite Optimization Problems with Interior Point Techniques","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W1991334712","doi":"https://doi.org/10.1137/s0363012901398393","mag":"1991334712"},"language":"en","primary_location":{"id":"doi:10.1137/s0363012901398393","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0363012901398393","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052388878","display_name":"Oliver Stein","orcid":"https://orcid.org/0000-0001-9514-6317"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Oliver Stein","raw_affiliation_strings":["[Rwth Aachen University]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[Rwth Aachen University]","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112700721","display_name":"Georg Still","orcid":null},"institutions":[{"id":"https://openalex.org/I2799411422","display_name":"Center for Discrete Mathematics and Theoretical Computer Science","ror":"https://ror.org/00k551w06","country_code":"US","type":"facility","lineage":["https://openalex.org/I102322142","https://openalex.org/I118347220","https://openalex.org/I1283103587","https://openalex.org/I1311060795","https://openalex.org/I20089843","https://openalex.org/I2799411422","https://openalex.org/I4210107353"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Georg Still","raw_affiliation_strings":["Discrete Mathematics and Mathematical Programming"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Discrete Mathematics and Mathematical Programming","institution_ids":["https://openalex.org/I2799411422"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.6414,"has_fulltext":false,"cited_by_count":106,"citation_normalized_percentile":{"value":0.96500437,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"42","issue":"3","first_page":"769","last_page":"788"},"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9984999895095825,"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.8136589527130127},{"id":"https://openalex.org/keywords/nonlinear-complementarity-problem","display_name":"Nonlinear complementarity problem","score":0.6569839119911194},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.654487669467926},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6098600029945374},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.5163291692733765},{"id":"https://openalex.org/keywords/stackelberg-competition","display_name":"Stackelberg competition","score":0.516063392162323},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.5129656195640564},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4821150302886963},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.4804398715496063},{"id":"https://openalex.org/keywords/semi-infinite-programming","display_name":"Semi-infinite programming","score":0.4673462510108948},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.44776564836502075},{"id":"https://openalex.org/keywords/vector-optimization","display_name":"Vector optimization","score":0.4306981861591339},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.42254117131233215},{"id":"https://openalex.org/keywords/mixed-complementarity-problem","display_name":"Mixed complementarity problem","score":0.3740198314189911},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.34706130623817444},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3203454315662384},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14186981320381165},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.12635838985443115}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8136589527130127},{"id":"https://openalex.org/C2778646529","wikidata":"https://www.wikidata.org/wiki/Q16948724","display_name":"Nonlinear complementarity problem","level":4,"score":0.6569839119911194},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.654487669467926},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6098600029945374},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.5163291692733765},{"id":"https://openalex.org/C199510392","wikidata":"https://www.wikidata.org/wiki/Q1184602","display_name":"Stackelberg competition","level":2,"score":0.516063392162323},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.5129656195640564},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4821150302886963},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.4804398715496063},{"id":"https://openalex.org/C2780394207","wikidata":"https://www.wikidata.org/wiki/Q7449304","display_name":"Semi-infinite programming","level":3,"score":0.4673462510108948},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.44776564836502075},{"id":"https://openalex.org/C164088818","wikidata":"https://www.wikidata.org/wiki/Q7917833","display_name":"Vector optimization","level":4,"score":0.4306981861591339},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.42254117131233215},{"id":"https://openalex.org/C77196050","wikidata":"https://www.wikidata.org/wiki/Q6883962","display_name":"Mixed complementarity problem","level":3,"score":0.3740198314189911},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.34706130623817444},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3203454315662384},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14186981320381165},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.12635838985443115},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s0363012901398393","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0363012901398393","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:ris.utwente.nl:openaire_cris_publications/b77672c7-0dce-4193-81d0-aa16eeb1d44c","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/b77672c7-0dce-4193-81d0-aa16eeb1d44c","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Stein, O & Still, G J 2003, 'Solving semi-infinite optimization problems with interior point techniques', SIAM journal on control and optimization, vol. 42, no. 3, pp. 769-788. https://doi.org/10.1137/S0363012901398393","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:publications.rwth-aachen.de:192493","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-068202%22","pdf_url":null,"source":{"id":"https://openalex.org/S4306401362","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM journal on control and optimization 42(3), 769-788 (2003). doi:10.1137/S0363012901398393","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":61,"referenced_works":["https://openalex.org/W17229534","https://openalex.org/W19186523","https://openalex.org/W69133773","https://openalex.org/W83112366","https://openalex.org/W177890044","https://openalex.org/W187211397","https://openalex.org/W187928793","https://openalex.org/W217831350","https://openalex.org/W590568853","https://openalex.org/W609623513","https://openalex.org/W1485979075","https://openalex.org/W1498635961","https://openalex.org/W1499343918","https://openalex.org/W1527408845","https://openalex.org/W1537099218","https://openalex.org/W1556819741","https://openalex.org/W1580929723","https://openalex.org/W1603490027","https://openalex.org/W1604627832","https://openalex.org/W1964794414","https://openalex.org/W1966095601","https://openalex.org/W1978492002","https://openalex.org/W1991584096","https://openalex.org/W1994325510","https://openalex.org/W1995285162","https://openalex.org/W2000402253","https://openalex.org/W2001180379","https://openalex.org/W2010560634","https://openalex.org/W2014746566","https://openalex.org/W2015308984","https://openalex.org/W2015957593","https://openalex.org/W2018508199","https://openalex.org/W2020339859","https://openalex.org/W2037678919","https://openalex.org/W2050713766","https://openalex.org/W2051269616","https://openalex.org/W2051549029","https://openalex.org/W2053653133","https://openalex.org/W2061157561","https://openalex.org/W2065691568","https://openalex.org/W2073433386","https://openalex.org/W2075887074","https://openalex.org/W2085165438","https://openalex.org/W2085841101","https://openalex.org/W2088111670","https://openalex.org/W2088550353","https://openalex.org/W2088709912","https://openalex.org/W2089581686","https://openalex.org/W2091992858","https://openalex.org/W2148624637","https://openalex.org/W2151902790","https://openalex.org/W2152882024","https://openalex.org/W2326806701","https://openalex.org/W2475678528","https://openalex.org/W2971150730","https://openalex.org/W4205551384","https://openalex.org/W4231147659","https://openalex.org/W4246495354","https://openalex.org/W4246959311","https://openalex.org/W4248437491","https://openalex.org/W4253418342"],"related_works":["https://openalex.org/W2085004531","https://openalex.org/W4294529879","https://openalex.org/W2384374169","https://openalex.org/W2376754743","https://openalex.org/W2351774575","https://openalex.org/W1553741403","https://openalex.org/W2358347443","https://openalex.org/W2146241362","https://openalex.org/W2038257044","https://openalex.org/W2039659576"],"abstract_inverted_index":{"We":[0,84],"introduce":[1],"a":[2,21,28,54,58,93],"new":[3],"numerical":[4,96],"solution":[5,69],"method":[6,17,90,116],"for":[7,47,53,128],"semi-infinite":[8,25,72,109,132],"optimization":[9,62,73,110],"problems":[10,111],"with":[11],"convex":[12],"lower":[13,49],"level":[14,50],"problems.":[15],"The":[16,68,114],"is":[18,117],"based":[19],"on":[20],"reformulation":[22],"of":[23,34,70,88,95,130],"the":[24,32,48,71,79,89,131],"problem":[26,38,63,74],"as":[27],"Stackelberg":[29],"game":[30],"and":[31,91,101,121],"use":[33],"regularized":[35],"nonlinear":[36,60],"complementarity":[37],"functions.":[39],"This":[40],"approach":[41],"leads":[42],"to":[43,65,77,82,119,138],"central":[44],"path":[45,56,80],"conditions":[46],"problems,":[51],"where":[52,105],"given":[55],"parameter":[57,81],"smooth":[59],"finite":[61],"has":[64],"be":[66],"solved.":[67,113],"then":[75],"amounts":[76],"driving":[78],"zero.":[83],"show":[85],"convergence":[86],"properties":[87],"give":[92],"number":[94],"examples":[97,124],"from":[98,102],"design":[99],"centering":[100],"robust":[103],"optimization,":[104],"actually":[106],"so-called":[107],"generalized":[108],"are":[112],"presented":[115],"easy":[118],"implement,":[120],"in":[122],"our":[123],"it":[125],"works":[126],"well":[127],"dimensions":[129],"index":[133],"set":[134],"at":[135],"least":[136],"up":[137],"150.":[139]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":6}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}