{"id":"https://openalex.org/W2029766035","doi":"https://doi.org/10.1137/s105262349427621x","title":"An Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming","display_name":"An Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming","publication_year":1998,"publication_date":"1998-05-01","ids":{"openalex":"https://openalex.org/W2029766035","doi":"https://doi.org/10.1137/s105262349427621x","mag":"2029766035"},"language":"en","primary_location":{"id":"doi:10.1137/s105262349427621x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s105262349427621x","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/A5068223640","display_name":"Chih\u2010Jen Lin","orcid":"https://orcid.org/0000-0003-4684-8747"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chih-Jen Lin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027860626","display_name":"Shu\u2010Cherng Fang","orcid":"https://orcid.org/0000-0001-5087-3262"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shu-Cherng Fang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","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":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0403,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.86218897,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"8","issue":"2","first_page":"443","last_page":"456"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9998000264167786,"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.9998000264167786,"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.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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9890000224113464,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/mathematics","display_name":"Mathematics","score":0.7926712036132812},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6278674602508545},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6251348853111267},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.6097701787948608},{"id":"https://openalex.org/keywords/semi-infinite-programming","display_name":"Semi-infinite programming","score":0.5923060178756714},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5609362721443176},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.5182035565376282},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5161048173904419},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.48600468039512634},{"id":"https://openalex.org/keywords/second-order-cone-programming","display_name":"Second-order cone programming","score":0.47701406478881836},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.32748132944107056},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17161595821380615},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.05299648642539978}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7926712036132812},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6278674602508545},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6251348853111267},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.6097701787948608},{"id":"https://openalex.org/C2780394207","wikidata":"https://www.wikidata.org/wiki/Q7449304","display_name":"Semi-infinite programming","level":3,"score":0.5923060178756714},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5609362721443176},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.5182035565376282},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5161048173904419},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.48600468039512634},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.47701406478881836},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.32748132944107056},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17161595821380615},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.05299648642539978},{"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/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"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/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s105262349427621x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s105262349427621x","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:CiteSeerX.psu:10.1.1.57.3135","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.3135","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ntucsu.csie.ntu.edu.tw/~cjlin/97-1.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W166965830","https://openalex.org/W624054654","https://openalex.org/W1588345844","https://openalex.org/W1590012787","https://openalex.org/W1980685696","https://openalex.org/W2005126631","https://openalex.org/W2010636146","https://openalex.org/W2011175600","https://openalex.org/W2037654933","https://openalex.org/W2058079132","https://openalex.org/W2065140259","https://openalex.org/W2068484625","https://openalex.org/W2069149672","https://openalex.org/W2072576444","https://openalex.org/W2075887074","https://openalex.org/W2076134677","https://openalex.org/W2086016098","https://openalex.org/W2136334809","https://openalex.org/W2142912299","https://openalex.org/W2225257958","https://openalex.org/W2503147665"],"related_works":["https://openalex.org/W2124659772","https://openalex.org/W2023928436","https://openalex.org/W3030201206","https://openalex.org/W2124105854","https://openalex.org/W1495965042","https://openalex.org/W3088461518","https://openalex.org/W2059909660","https://openalex.org/W3153752017","https://openalex.org/W965332046","https://openalex.org/W2053271671"],"abstract_inverted_index":{"In":[0],"this":[1,39],"paper,":[2],"an":[3],"unconstrained":[4],"convex":[5],"programming":[6,16],"dual":[7,23],"approach":[8],"for":[9],"solving":[10],"a":[11],"class":[12],"of":[13],"linear":[14],"semi-infinite":[15],"problems":[17],"is":[18],"proposed.":[19],"Both":[20],"primal":[21],"and":[22],"convergence":[24],"results":[25],"are":[26,34],"established":[27],"under":[28],"some":[29],"basic":[30],"assumptions.":[31],"Numerical":[32],"examples":[33],"also":[35],"included":[36],"to":[37],"illustrate":[38],"approach.":[40]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}