{"id":"https://openalex.org/W2194452017","doi":"https://doi.org/10.1137/140982143","title":"Feasible Method for Semi-Infinite Programs","display_name":"Feasible Method for Semi-Infinite Programs","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2194452017","doi":"https://doi.org/10.1137/140982143","mag":"2194452017"},"language":"en","primary_location":{"id":"doi:10.1137/140982143","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140982143","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/A5051940788","display_name":"Shuxiong Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shuxiong Wang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5107835542","display_name":"Ya-xiang Yuan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yaxiang Yuan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.10268562,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"25","issue":"4","first_page":"2537","last_page":"2560"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"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.9998000264167786,"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.9993000030517578,"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.996999979019165,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8281761407852173},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6377997994422913},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.59911048412323},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5404603481292725},{"id":"https://openalex.org/keywords/karush\u2013kuhn\u2013tucker-conditions","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","score":0.5287026166915894},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.49493521451950073},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47606486082077026},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.44427961111068726},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3345550298690796},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22120460867881775},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08549106121063232}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8281761407852173},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6377997994422913},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.59911048412323},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5404603481292725},{"id":"https://openalex.org/C50454189","wikidata":"https://www.wikidata.org/wiki/Q2075125","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","level":2,"score":0.5287026166915894},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.49493521451950073},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47606486082077026},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.44427961111068726},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3345550298690796},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22120460867881775},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08549106121063232},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/140982143","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140982143","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W8495306","https://openalex.org/W137390859","https://openalex.org/W178772886","https://openalex.org/W1556819741","https://openalex.org/W1580809199","https://openalex.org/W1966607098","https://openalex.org/W1970946112","https://openalex.org/W1974300932","https://openalex.org/W1976316721","https://openalex.org/W1981009968","https://openalex.org/W1984425167","https://openalex.org/W2000187202","https://openalex.org/W2009717218","https://openalex.org/W2012350862","https://openalex.org/W2020633601","https://openalex.org/W2022234361","https://openalex.org/W2034728596","https://openalex.org/W2037678919","https://openalex.org/W2038398448","https://openalex.org/W2038589630","https://openalex.org/W2044346540","https://openalex.org/W2049355922","https://openalex.org/W2054709617","https://openalex.org/W2055731670","https://openalex.org/W2065385799","https://openalex.org/W2068571038","https://openalex.org/W2075887074","https://openalex.org/W2086398734","https://openalex.org/W2086828451","https://openalex.org/W2093847767","https://openalex.org/W2099025530","https://openalex.org/W2113741278","https://openalex.org/W2131116400","https://openalex.org/W2914166403"],"related_works":["https://openalex.org/W2807256486","https://openalex.org/W2391309548","https://openalex.org/W2123675486","https://openalex.org/W117224218","https://openalex.org/W3038961962","https://openalex.org/W2791039104","https://openalex.org/W2947894078","https://openalex.org/W3164429027","https://openalex.org/W2950961269","https://openalex.org/W2900428495"],"abstract_inverted_index":{"A":[0],"new":[1],"numerical":[2],"method":[3],"is":[4,15,24,92,104,112,141],"presented":[5],"for":[6,17],"semi-infinite":[7,108],"optimization":[8,109],"problems":[9,42,50,91,121],"which":[10],"guarantees":[11],"that":[12,81,114,138],"each":[13],"iterate":[14],"feasible":[16],"the":[18,30,36,40,47,62,66,86,89,97,115,119,128,145],"original":[19,98,129],"problem.":[20,99],"The":[21,55],"basic":[22],"idea":[23],"to":[25,34,45,106,123],"construct":[26],"concave":[27,56,72],"relaxations":[28,57],"of":[29,39,65,85,88,96,118,127],"lower":[31,67],"level":[32,68],"problem,":[33],"compute":[35],"optimal":[37,94],"values":[38],"relaxation":[41],"explicitly,":[43],"and":[44],"solve":[46,107],"resulting":[48],"approximate":[49,90,120],"with":[51],"finitely":[52],"many":[53],"constraints.":[54],"are":[58],"constructed":[59],"by":[60,70],"replacing":[61],"objective":[63],"function":[64],"problem":[69,130],"its":[71],"upper":[73],"bound":[74],"functions.":[75],"Under":[76],"mild":[77],"conditions,":[78],"we":[79],"prove":[80],"every":[82],"accumulation":[83],"point":[84,126],"solutions":[87],"an":[93],"solution":[95],"An":[100],"adaptive":[101,147],"subdivision":[102],"algorithm":[103,140,149],"proposed":[105],"problems.":[110],"It":[111],"shown":[113],"Karush--Kuhn--Tucker":[116,125],"points":[117],"converge":[122],"a":[124],"within":[131],"arbitrarily":[132],"given":[133],"tolerances.":[134],"Numerical":[135],"experiments":[136],"show":[137],"our":[139],"much":[142],"faster":[143],"than":[144],"existing":[146],"convexification":[148],"in":[150],"computation":[151],"time.":[152]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}