{"id":"https://openalex.org/W2049355922","doi":"https://doi.org/10.1137/090767133","title":"A New Exchange Method for Convex Semi-Infinite Programming","display_name":"A New Exchange Method for Convex Semi-Infinite Programming","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2049355922","doi":"https://doi.org/10.1137/090767133","mag":"2049355922"},"language":"en","primary_location":{"id":"doi:10.1137/090767133","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090767133","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":true,"oa_status":"green","oa_url":"http://rua.ua.es/dspace/bitstream/10045/75128/1/2010_Zhang_etal_SIAMJOptim.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100426739","display_name":"Liping Zhang","orcid":"https://orcid.org/0000-0002-0111-6473"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Liping Zhang","raw_affiliation_strings":["lzhang@math.tsinghua.edu.cn#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"lzhang@math.tsinghua.edu.cn#TAB#","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110321685","display_name":"Soon\u2010Yi Wu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Soon-Yi Wu","raw_affiliation_strings":["soonyi@mail.ncku.edu.tw#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"soonyi@mail.ncku.edu.tw#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100715600","display_name":"Marco A. L\u00f3pez","orcid":"https://orcid.org/0000-0002-0619-9618"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marco A. L\u00f3pez","raw_affiliation_strings":["marco.antonio@ua.es#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"marco.antonio@ua.es#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.2335,"has_fulltext":true,"cited_by_count":55,"citation_normalized_percentile":{"value":0.94189464,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":"20","issue":"6","first_page":"2959","last_page":"2977"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9990000128746033,"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.9990000128746033,"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.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/T10791","display_name":"Advanced Control Systems Optimization","score":0.991100013256073,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/solver","display_name":"Solver","score":0.7328420877456665},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6500920057296753},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4804525077342987},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4741249084472656},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4459399878978729},{"id":"https://openalex.org/keywords/lagrange-multiplier","display_name":"Lagrange multiplier","score":0.43979668617248535},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.410832941532135},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3945781886577606}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7328420877456665},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6500920057296753},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4804525077342987},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4741249084472656},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4459399878978729},{"id":"https://openalex.org/C73684929","wikidata":"https://www.wikidata.org/wiki/Q598870","display_name":"Lagrange multiplier","level":2,"score":0.43979668617248535},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.410832941532135},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3945781886577606},{"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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/090767133","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090767133","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:dnet:ruarepositor::1a41723c7d310be4ee7fe2e86928788b","is_oa":true,"landing_page_url":"http://hdl.handle.net/10045/75128","pdf_url":"http://rua.ua.es/dspace/bitstream/10045/75128/1/2010_Zhang_etal_SIAMJOptim.pdf","source":{"id":"https://openalex.org/S4306402641","display_name":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Cient\u00edficas)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4383465926","host_organization_name":"LA Referencia","host_organization_lineage":["https://openalex.org/I4383465926"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:dnet:ruarepositor::1a41723c7d310be4ee7fe2e86928788b","is_oa":true,"landing_page_url":"http://hdl.handle.net/10045/75128","pdf_url":"http://rua.ua.es/dspace/bitstream/10045/75128/1/2010_Zhang_etal_SIAMJOptim.pdf","source":{"id":"https://openalex.org/S4306402641","display_name":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Cient\u00edficas)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4383465926","host_organization_name":"LA Referencia","host_organization_lineage":["https://openalex.org/I4383465926"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2049355922.pdf","grobid_xml":"https://content.openalex.org/works/W2049355922.grobid-xml"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W8495306","https://openalex.org/W83112366","https://openalex.org/W137390859","https://openalex.org/W157754240","https://openalex.org/W177890044","https://openalex.org/W1551293570","https://openalex.org/W1975993600","https://openalex.org/W1983611387","https://openalex.org/W1991334712","https://openalex.org/W1995861654","https://openalex.org/W2012350862","https://openalex.org/W2029721662","https://openalex.org/W2039357520","https://openalex.org/W2055731670","https://openalex.org/W2075887074","https://openalex.org/W2082035118","https://openalex.org/W2083247753","https://openalex.org/W2083365247","https://openalex.org/W2086016098","https://openalex.org/W2086067311","https://openalex.org/W2086389705","https://openalex.org/W2086398734","https://openalex.org/W2087576060","https://openalex.org/W2101508998","https://openalex.org/W2129353652","https://openalex.org/W2144181355","https://openalex.org/W2167447951","https://openalex.org/W2171502450","https://openalex.org/W2266946488","https://openalex.org/W2398195345","https://openalex.org/W2752932982","https://openalex.org/W2914166403"],"related_works":["https://openalex.org/W2186864281","https://openalex.org/W4255427455","https://openalex.org/W1600454385","https://openalex.org/W1966025497","https://openalex.org/W1997033546","https://openalex.org/W68941528","https://openalex.org/W4206451355","https://openalex.org/W1553604823","https://openalex.org/W8322802","https://openalex.org/W2195994862"],"abstract_inverted_index":{"In":[0,117],"this":[1],"paper":[2],"we":[3,37,121,167,184],"propose":[4],"a":[5,18,65,84,112],"new":[6,19,95],"exchange":[7,24],"method":[8],"for":[9,43,107,200],"solving":[10],"convex":[11],"semi-infinite":[12,160],"programming":[13],"(CSIP)":[14],"problems.":[15],"We":[16,146],"introduce":[17],"dropping-rule":[20],"in":[21,54,111,163],"the":[22,39,47,52,58,69,94,108,118,123,132,159,173,179,190,201],"proposed":[23,124],"algorithm,":[25],"which":[26],"only":[27,76],"keeps":[28],"those":[29],"active":[30],"constraints":[31],"with":[32,150,158],"positive":[33],"Lagrange":[34],"multipliers.":[35],"Moreover,":[36],"exploit":[38],"idea":[40],"of":[41,46,115],"looking":[42],"$\\eta$-infeasible":[44],"indices":[45],"lower":[48],"level":[49],"problem":[50,67,110,175,191],"as":[51],"adding-rule":[53],"our":[55,100,148,170,187],"algorithm.":[56],"Hence":[57],"algorithm":[59,101,125,149,156,171,188],"does":[60],"not":[61],"require":[62],"to":[63,78,126],"solve":[64,127],"maximization":[66],"over":[68],"index":[70],"set":[71],"at":[72],"each":[73],"iteration;":[74],"it":[75],"needs":[77],"find":[79,168],"some":[80,91,128,135,194],"points":[81],"such":[82],"that":[83,99,169,186,196],"certain":[85],"computationally-easy":[86],"criterion":[87],"is":[88],"satisfied.":[89],"Under":[90],"reasonable":[92],"conditions,":[93],"adding-dropping":[96],"rule":[97],"guarantees":[98],"provides":[102],"an":[103,151],"approximate":[104],"optimal":[105],"solution":[106],"CSIP":[109,174],"finite":[113],"number":[114],"iterations.":[116],"numerical":[119],"experiments,":[120],"apply":[122],"test":[129],"problems":[130,137],"from":[131,138],"literature,":[133],"including":[134],"medium-sized":[136],"complex":[139],"approximation":[140],"theory":[141],"and":[142,157,166],"FIR":[143,180],"filter":[144,181],"design.":[145],"compare":[147],"existing":[152],"central":[153],"cutting":[154],"plane":[155],"solver":[161],"fseminf":[162],"MATLAB":[164],"toolbox,":[165],"solves":[172,189],"much":[176],"faster.":[177],"For":[178],"design":[182],"problem,":[183],"show":[185],"better":[192],"than":[193],"algorithms":[195],"were":[197],"technically":[198],"established":[199],"problem.":[202]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}