{"id":"https://openalex.org/W2054461902","doi":"https://doi.org/10.1137/090775294","title":"General Semi-Infinite Programming: Symmetric Mangasarian\u2013Fromovitz Constraint Qualification and the Closure of the Feasible Set","display_name":"General Semi-Infinite Programming: Symmetric Mangasarian\u2013Fromovitz Constraint Qualification and the Closure of the Feasible Set","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2054461902","doi":"https://doi.org/10.1137/090775294","mag":"2054461902"},"language":"en","primary_location":{"id":"doi:10.1137/090775294","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090775294","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/A5029745043","display_name":"Francisco Guerra-V\u00e1zquez","orcid":"https://orcid.org/0000-0001-5648-7231"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"F. Guerra-V\u00e1zquez","raw_affiliation_strings":["francisco.guerra@udlap.mx#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"francisco.guerra@udlap.mx#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091650389","display_name":"Hubertus Th. Jongen","orcid":null},"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":"H. Th. Jongen","raw_affiliation_strings":["jongen@rwth-aachen.de and shikhman@mathc.rwth-aachen.de#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"jongen@rwth-aachen.de and shikhman@mathc.rwth-aachen.de#TAB#","institution_ids":["https://openalex.org/I887968799"]}]},{"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":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.4354,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.92294324,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"20","issue":"5","first_page":"2487","last_page":"2503"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9975000023841858,"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"}},"topics":[{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9975000023841858,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9965000152587891,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9502000212669373,"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.9167345762252808},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7518364191055298},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.7311785817146301},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6914639472961426},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.5605801343917847},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.4961152970790863},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45388397574424744},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.43022987246513367},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39386075735092163},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34251999855041504},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.13245010375976562},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09045639634132385},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08854088187217712}],"concepts":[{"id":"https://openalex.org/C50454189","wikidata":"https://www.wikidata.org/wiki/Q2075125","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","level":2,"score":0.9167345762252808},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7518364191055298},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.7311785817146301},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6914639472961426},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.5605801343917847},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.4961152970790863},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45388397574424744},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.43022987246513367},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39386075735092163},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34251999855041504},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13245010375976562},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09045639634132385},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08854088187217712},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/090775294","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090775294","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:115745","is_oa":false,"landing_page_url":"http://hdl.handle.net/2078/115745","pdf_url":null,"source":{"id":"https://openalex.org/S4306401974","display_name":"DIAL (Catholic University of Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"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. 20, no. 5, p. 2487-2503 (2010)","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:publications.rwth-aachen.de:183921","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-060482%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 optimization 20(5), 2487-2503 (2010). doi:10.1137/090775294","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W199323270","https://openalex.org/W1517074000","https://openalex.org/W2003145531","https://openalex.org/W2012497012","https://openalex.org/W2013786427","https://openalex.org/W2014889731","https://openalex.org/W2475678528","https://openalex.org/W4253418342"],"related_works":["https://openalex.org/W2061220204","https://openalex.org/W2188904465","https://openalex.org/W3001217416","https://openalex.org/W3008128154","https://openalex.org/W2115007255","https://openalex.org/W2793969674","https://openalex.org/W2357402179","https://openalex.org/W2362635706","https://openalex.org/W2085816591","https://openalex.org/W3164687984"],"abstract_inverted_index":{"The":[0,30,79],"feasible":[1],"set":[2],"M":[3,104],"in":[4],"general":[5],"semi-infinite":[6,46],"programming":[7,47],"(GSIP)":[8],"need":[9],"not":[10],"be":[11,84],"closed.":[12],"This":[13],"fact":[14],"is":[15,32,81,105],"well":[16],"known.":[17],"We":[18,107,116],"introduce":[19,108],"a":[20,33,66,70],"natural":[21,63],"constraint":[22,27],"qualification,":[23],"called":[24],"symmetric":[25],"Mangasarian\u2013Fromovitz":[26],"qualification":[28],"(Sym-MFCQ).":[29],"Sym-MFCQ":[31,54,80],"nontrivial":[34],"extension":[35],"of":[36,45,72,77,90,100,103,112],"the":[37,42,53,55,73,91,95,98,101,125],"well-known":[38],"(extended)":[39],"MFCQ":[40],"for":[41],"special":[43],"case":[44],"(SIP)":[48],"and":[49,61,75,86],"disjunctive":[50],"programming.":[51],"Under":[52],"closure":[56,102],"$\\overline{M}$":[57],"has":[58],"an":[59,109],"easy":[60],"also":[62],"description.":[64],"As":[65],"consequence,":[67],"we":[68],"get":[69],"description":[71],"interior":[74],"boundary":[76],"M.":[78],"shown":[82],"to":[83],"generic":[85],"stable":[87],"under":[88,124],"$C^1$-perturbations":[89],"defining":[92],"functions.":[93],"For":[94],"latter":[96],"stability":[97],"consideration":[99],"essential.":[106],"appropriate":[110],"notion":[111],"Karush\u2013Kuhn\u2013Tucker":[113],"(KKT)":[114],"points.":[115],"show":[117],"that":[118],"local":[119],"minimizers":[120],"are":[121],"KKT":[122],"points":[123],"Sym-MFCQ.":[126]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2018,"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":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}