{"id":"https://openalex.org/W1983611387","doi":"https://doi.org/10.1137/0803047","title":"A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems","display_name":"A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems","publication_year":1993,"publication_date":"1993-11-01","ids":{"openalex":"https://openalex.org/W1983611387","doi":"https://doi.org/10.1137/0803047","mag":"1983611387"},"language":"en","primary_location":{"id":"doi:10.1137/0803047","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0803047","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/A5109805555","display_name":"K. O. Kortanek","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"K. O. Kortanek","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5041155297","display_name":"Hoon. No","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hoon No","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":2.3477,"has_fulltext":false,"cited_by_count":100,"citation_normalized_percentile":{"value":0.88471178,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"3","issue":"4","first_page":"901","last_page":"918"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9995999932289124,"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.9995999932289124,"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.996399998664856,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9948999881744385,"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/mathematics","display_name":"Mathematics","score":0.8193208575248718},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.7423192262649536},{"id":"https://openalex.org/keywords/differentiable-function","display_name":"Differentiable function","score":0.6178278923034668},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.5667876601219177},{"id":"https://openalex.org/keywords/semi-infinite-programming","display_name":"Semi-infinite programming","score":0.5559386610984802},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5436069965362549},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5228569507598877},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.519300639629364},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.48674821853637695},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4829199016094208},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.44932466745376587},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4460172653198242},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.42981216311454773},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4244651198387146},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.34713757038116455},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.1525474488735199},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14348021149635315},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11988013982772827},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.07601174712181091}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8193208575248718},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.7423192262649536},{"id":"https://openalex.org/C202615002","wikidata":"https://www.wikidata.org/wiki/Q783507","display_name":"Differentiable function","level":2,"score":0.6178278923034668},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.5667876601219177},{"id":"https://openalex.org/C2780394207","wikidata":"https://www.wikidata.org/wiki/Q7449304","display_name":"Semi-infinite programming","level":3,"score":0.5559386610984802},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5436069965362549},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5228569507598877},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.519300639629364},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.48674821853637695},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4829199016094208},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.44932466745376587},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4460172653198242},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.42981216311454773},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4244651198387146},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.34713757038116455},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.1525474488735199},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14348021149635315},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11988013982772827},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.07601174712181091},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0803047","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0803047","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":25,"referenced_works":["https://openalex.org/W30924588","https://openalex.org/W140582013","https://openalex.org/W590568853","https://openalex.org/W1580929723","https://openalex.org/W1965209365","https://openalex.org/W1975795280","https://openalex.org/W1979792455","https://openalex.org/W1995769522","https://openalex.org/W1997371905","https://openalex.org/W2004480883","https://openalex.org/W2010636146","https://openalex.org/W2012350862","https://openalex.org/W2024972953","https://openalex.org/W2025303603","https://openalex.org/W2039357520","https://openalex.org/W2057366835","https://openalex.org/W2062846739","https://openalex.org/W2074563224","https://openalex.org/W2075887074","https://openalex.org/W2087576060","https://openalex.org/W2088671377","https://openalex.org/W2095033315","https://openalex.org/W2489906889","https://openalex.org/W4211195957","https://openalex.org/W4249667877"],"related_works":["https://openalex.org/W2097136890","https://openalex.org/W4324118942","https://openalex.org/W2913057782","https://openalex.org/W2734993473","https://openalex.org/W2101508998","https://openalex.org/W2185064329","https://openalex.org/W2187229407","https://openalex.org/W2025961961","https://openalex.org/W3030201206","https://openalex.org/W2059909660"],"abstract_inverted_index":{"The":[0],"central":[1],"cutting":[2],"plane":[3],"algorithm":[4],"for":[5,78,116,123],"linear":[6,49,81],"semi-infinite":[7],"programming":[8,82],"(SIP)":[9],"is":[10,52],"extended":[11],"to":[12,64,93,98,101,110],"nonlinear":[13,125],"convex":[14],"SIP":[15,137],"of":[16,80,105,127,144,153],"the":[17,62,124,159],"form":[18],"min":[19],"$\\{":[20],"f":[21],"(":[22,27],"x":[23],")|x":[24],"\\in":[25,32],"H,g":[26],"x,t":[28],")":[29],"\\leq":[30],"0\\,{\\text{all}}\\,t":[31],"S":[33],"\\}$.":[34],"Under":[35],"differentiability":[36],"assumptions":[37],"that":[38,54,155],"are":[39,61,148],"weaker":[40],"than":[41],"those":[42],"employed":[43],"in":[44,118,140,158],"superlinearly":[45],"convergent":[46],"algorithms,":[47],"a":[48,67,102,141,151],"convergence":[50],"rate":[51],"established":[53],"has":[55],"additional":[56],"important":[57],"features.":[58],"These":[59],"features":[60],"ability":[63],"(i)":[65],"generate":[66,94],"cut":[68],"from":[69,166],"any":[70],"violated":[71],"constraint;":[72],"(ii)":[73],"invoke":[74],"efficient":[75,89],"constraint-dropping":[76],"rules":[77],"management":[79,91],"(LP)":[83],"subproblem":[84],"size;":[85],"(iii)":[86],"provide":[87,111,132],"an":[88,112],"grid":[90,114],"scheme":[92],"cuts":[95],"and":[96,134],"ultimately":[97],"test":[99],"feasibility":[100],"high":[103],"degree":[104],"accuracy,":[106],"as":[107,109],"well":[108],"automatic":[113],"refinement":[115],"use":[117],"obtaining":[119],"admissible":[120],"starting":[121],"solutions":[122,139],"system":[126],"first-order":[128],"conditions;":[129],"and,":[130],"(iv)":[131],"primal":[133],"dual":[135],"(Lagrangian)":[136],"feasible":[138],"finite":[142],"number":[143],"iterations.":[145],"Numerical":[146],"tests":[147],"provided":[149],"on":[150],"collection":[152],"problems":[154,165],"have":[156],"appeared":[157],"literature":[160],"including":[161],"some":[162],"moderately":[163],"sized":[164],"complex":[167],"approximation":[168],"theory.":[169]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":33},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}