{"id":"https://openalex.org/W2023247805","doi":"https://doi.org/10.1137/100786757","title":"Generalized Semi-Infinite Programming: The Nonsmooth Symmetric Reduction Ansatz","display_name":"Generalized Semi-Infinite Programming: The Nonsmooth Symmetric Reduction Ansatz","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2023247805","doi":"https://doi.org/10.1137/100786757","mag":"2023247805"},"language":"en","primary_location":{"id":"doi:10.1137/100786757","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100786757","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/A5091650389","display_name":"Hubertus Th. Jongen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"H. TH. Jongen","raw_affiliation_strings":["jongen@rwth-aachen.de#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"jongen@rwth-aachen.de#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035961103","display_name":"Vladimir Shikhman","orcid":"https://orcid.org/0000-0002-8031-6069"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"V. Shikhman","raw_affiliation_strings":["shikhman@mathc.rwth-aachen.de#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"shikhman@mathc.rwth-aachen.de#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.294,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.86574871,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"21","issue":"1","first_page":"193","last_page":"211"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9993000030517578,"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.9993000030517578,"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.996999979019165,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.9258999824523926,"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/karush\u2013kuhn\u2013tucker-conditions","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","score":0.9707823395729065},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8093111515045166},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.678658127784729},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.6403207182884216},{"id":"https://openalex.org/keywords/ansatz","display_name":"Ansatz","score":0.6308026313781738},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.5312701463699341},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.521328866481781},{"id":"https://openalex.org/keywords/limit-point","display_name":"Limit point","score":0.5001082420349121},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4937842786312103},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4697447419166565},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.42941814661026},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3365511894226074},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.32895055413246155},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.21505874395370483},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09719705581665039}],"concepts":[{"id":"https://openalex.org/C50454189","wikidata":"https://www.wikidata.org/wiki/Q2075125","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","level":2,"score":0.9707823395729065},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8093111515045166},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.678658127784729},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6403207182884216},{"id":"https://openalex.org/C130979935","wikidata":"https://www.wikidata.org/wiki/Q568954","display_name":"Ansatz","level":2,"score":0.6308026313781738},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.5312701463699341},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.521328866481781},{"id":"https://openalex.org/C63548660","wikidata":"https://www.wikidata.org/wiki/Q858223","display_name":"Limit point","level":2,"score":0.5001082420349121},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4937842786312103},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4697447419166565},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.42941814661026},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3365511894226074},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.32895055413246155},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.21505874395370483},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09719705581665039},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/100786757","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100786757","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:dial.uclouvain.be:boreal:115752","is_oa":false,"landing_page_url":"http://hdl.handle.net/2078/115752","pdf_url":null,"source":{"id":"https://openalex.org/S4306400166","display_name":"Digital Access to Libraries","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800384882","host_organization_name":"Harris County Public Library","host_organization_lineage":["https://openalex.org/I2800384882"],"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 Optimization, Vol. 21, no. 1, p. 193-211 (2011)","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:publications.rwth-aachen.de:166586","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/record/166586","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 optimization 21(1), 193-211 (2011). doi:10.1137/100786757","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":16,"referenced_works":["https://openalex.org/W199323270","https://openalex.org/W1517074000","https://openalex.org/W1964794414","https://openalex.org/W2001317839","https://openalex.org/W2003145531","https://openalex.org/W2010560634","https://openalex.org/W2012497012","https://openalex.org/W2013786427","https://openalex.org/W2014889731","https://openalex.org/W2024065097","https://openalex.org/W2026552356","https://openalex.org/W2054461902","https://openalex.org/W2073433386","https://openalex.org/W2074161970","https://openalex.org/W2088709912","https://openalex.org/W4253418342"],"related_works":["https://openalex.org/W1642182499","https://openalex.org/W4286870264","https://openalex.org/W2279275934","https://openalex.org/W4304687059","https://openalex.org/W4242784854","https://openalex.org/W2963235221","https://openalex.org/W2889381551","https://openalex.org/W2023247805","https://openalex.org/W1984449343","https://openalex.org/W2067275683"],"abstract_inverted_index":{"The":[0,120],"feasible":[1,62],"set":[2,54,63],"M":[3],"in":[4,87,134,166,189],"generalized":[5],"semi-infinite":[6],"programming":[7],"(GSIP)":[8],"need":[9,209],"not":[10,210],"be":[11,25,58,211,219,247],"closed.":[12],"Under":[13,48,89],"the":[14,42,53,61,82,159,185,192,201,205,229,248,251],"so-called":[15,66],"symmetric":[16,44,160],"Mangasarian\u2013Fromovitz":[17],"constraint":[18],"qualification":[19],"(Sym-MFCQ),":[20],"its":[21,150],"closure":[22],"$\\overline{M}$":[23,55],"can":[24,56],"described":[26,59],"by":[27,71],"means":[28],"of":[29,34,64,76,84,94,122,253],"infinitely":[30],"many":[31,73],"inequality":[32,74],"constraints":[33,75],"maximum":[35,77],"type.":[36,78],"In":[37,137,181,215],"this":[38,135],"paper":[39],"we":[40,50,239],"introduce":[41],"nonsmooth":[43],"reduction":[45,161,232],"ansatz":[46,162],"(NSRA).":[47],"NSRA":[49,104,156,190],"prove":[51],"that":[52,103,114],"locally":[57],"as":[60,126,128,164],"a":[65,129,139,143,212,220,234,241,254],"disjunctive":[67,235],"optimization":[68,236],"problem":[69],"defined":[70],"finitely":[72],"This":[79,223],"also":[80],"shows":[81],"appearance":[83],"re-entrant":[85],"corners":[86],"$\\overline{M}$.":[88],"Sym-MFCQ":[90],"all":[91,110,115],"local":[92,144,154,199,231,242],"minimizers":[93,155],"GSIP":[95],"are":[96,118,132],"KKT":[97,111,116,124,195],"points":[98,112,117,125,196],"for":[99,250,259],"GSIP.":[100,260],"We":[101],"show":[102],"is":[105,142,191,225],"generic":[106],"and":[107,113,147,172],"stable":[108],"at":[109,204],"nondegenerate.":[119],"concept":[121],"(nondegenerate)":[123],"well":[127],"corresponding":[130],"GSIP-index":[131,151],"introduced":[133,165],"paper.":[136],"particular,":[138],"nondegenerate":[140],"KKT-point":[141],"minimizer":[145],"if":[146,149],"only":[148],"vanishes.":[152],"At":[153,194],"coincides":[157],"with":[158,183],"(SRA)":[163],"[H.":[167],"G\u00fcnzel,":[168],"H.":[169],"Th.":[170],"Jongen,":[171],"O.":[173],"Stein,":[174],"Optim.":[175],"Lett.,":[176],"2":[177],"(2008),":[178],"pp.":[179],"415\u2013424].":[180],"comparison":[182],"SRA,":[184],"main":[186],"new":[187],"issue":[188],"following:":[193],"different":[197],"from":[198],"minimizers,":[200],"Lagrange":[202],"polytope":[203],"lower":[206],"level":[207],"generically":[208],"singleton":[213],"anymore.":[214],"fact,":[216],"it":[217],"will":[218,246],"full-dimensional":[221],"simplex.":[222],"fact":[224],"crucial":[226],"to":[227,233],"provide":[228],"above-mentioned":[230],"problem.":[237],"Finally,":[238],"establish":[240],"cell-attachment":[243],"theorem":[244],"which":[245],"basis":[249],"development":[252],"global":[255],"critical":[256],"point":[257],"theory":[258]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}