{"id":"https://openalex.org/W2055428607","doi":"https://doi.org/10.1137/070710470","title":"An Explicit Exchange Algorithm For Linear Semi-Infinite Programming Problems With Second-Order Cone Constraints","display_name":"An Explicit Exchange Algorithm For Linear Semi-Infinite Programming Problems With Second-Order Cone Constraints","publication_year":2009,"publication_date":"2009-12-16","ids":{"openalex":"https://openalex.org/W2055428607","doi":"https://doi.org/10.1137/070710470","mag":"2055428607"},"language":"en","primary_location":{"id":"doi:10.1137/070710470","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070710470","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/A5102356480","display_name":"Shunsuke Hayashi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shunsuke Hayashi","raw_affiliation_strings":["shunhaya@amp.i.kyoto-u.ac.jp#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"shunhaya@amp.i.kyoto-u.ac.jp#TAB#","institution_ids":[]}]},{"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":["soonyi@mail.ncku.edu.tw#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"soonyi@mail.ncku.edu.tw#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4773,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.65944343,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"20","issue":"3","first_page":"1527","last_page":"1546"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9868999719619751,"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.7317139506340027},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.590106725692749},{"id":"https://openalex.org/keywords/linear-complementarity-problem","display_name":"Linear complementarity problem","score":0.566010594367981},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5551707744598389},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5269644856452942},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.5108596682548523},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.44316360354423523},{"id":"https://openalex.org/keywords/complementarity","display_name":"Complementarity (molecular biology)","score":0.4410818815231323}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7317139506340027},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.590106725692749},{"id":"https://openalex.org/C34320192","wikidata":"https://www.wikidata.org/wiki/Q783105","display_name":"Linear complementarity problem","level":3,"score":0.566010594367981},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5551707744598389},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5269644856452942},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.5108596682548523},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.44316360354423523},{"id":"https://openalex.org/C202269582","wikidata":"https://www.wikidata.org/wiki/Q2644277","display_name":"Complementarity (molecular biology)","level":2,"score":0.4410818815231323},{"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/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/070710470","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070710470","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.99.1427","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.99.1427","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.amp.i.kyoto-u.ac.jp/tecrep/ps_file/2007/2007-012.pdf","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":29,"referenced_works":["https://openalex.org/W10800830","https://openalex.org/W580782046","https://openalex.org/W1534863284","https://openalex.org/W1537335979","https://openalex.org/W1543439990","https://openalex.org/W1556428279","https://openalex.org/W1603490027","https://openalex.org/W1967073510","https://openalex.org/W1973281249","https://openalex.org/W1986122702","https://openalex.org/W1990375839","https://openalex.org/W1995861654","https://openalex.org/W1999913571","https://openalex.org/W2000151369","https://openalex.org/W2009923109","https://openalex.org/W2018695900","https://openalex.org/W2020633601","https://openalex.org/W2025132271","https://openalex.org/W2055390480","https://openalex.org/W2055731670","https://openalex.org/W2071015827","https://openalex.org/W2074085139","https://openalex.org/W2075887074","https://openalex.org/W2085165438","https://openalex.org/W2089105401","https://openalex.org/W2101508998","https://openalex.org/W2105235982","https://openalex.org/W2200834864","https://openalex.org/W2914166403"],"related_works":["https://openalex.org/W2276648117","https://openalex.org/W4289075993","https://openalex.org/W2084792246","https://openalex.org/W819098253","https://openalex.org/W2102107417","https://openalex.org/W2765841216","https://openalex.org/W1548220668","https://openalex.org/W1566966152","https://openalex.org/W1520530328","https://openalex.org/W621787436"],"abstract_inverted_index":{"In":[0,49,93,111],"this":[1],"paper,":[2],"we":[3,100,115,129,174],"propose":[4],"an":[5],"explicit":[6],"exchange":[7],"algorithm":[8,31,132,155,177],"for":[9,152],"solving":[10],"the":[11,25,30,40,45,55,62,76,85,108,112,122,125,139,149,157,166,169,176],"semi-infinite":[12],"programming":[13],"problem":[14,170],"(SIP)":[15],"with":[16,91,133],"second-order":[17],"cone":[18],"(SOC)":[19],"constraints.":[20],"We":[21],"prove,":[22],"by":[23,147],"using":[24],"complementarity":[26,63,86],"slackness":[27,64,87],"conditions,":[28],"that":[29,185],"terminates":[32],"in":[33,73],"a":[34,98,102],"finite":[35],"number":[36],"of":[37,124,168],"iterations":[38],"and":[39,60,144,183],"obtained":[41],"solution":[42,158],"sufficiently":[43],"approximates":[44],"original":[46],"SIP":[47,141],"solution.":[48],"existing":[50,77],"studies":[51],"on":[52,107,138],"SIPs,":[53],"only":[54],"nonnegative":[56],"constraints":[57],"were":[58,66],"considered,":[59],"hence,":[61],"conditions":[65,88],"separable":[67],"to":[68,95,120,178],"each":[69],"scalar":[70],"component.":[71],"However,":[72],"our":[74,131,154],"study,":[75],"componentwise":[78],"analyses":[79],"are":[80,89],"no":[81],"longer":[82],"applicable":[83],"since":[84],"associated":[90],"SOCs.":[92],"order":[94],"overcome":[96],"such":[97],"difficulty,":[99],"introduce":[101],"certain":[103],"coordinate":[104],"system":[105],"based":[106,137],"spectral":[109],"factorization.":[110],"numerical":[113],"experiments,":[114],"solve":[116],"some":[117,179],"test":[118],"problems":[119,182,187],"see":[121,184],"effectiveness":[123],"proposed":[126],"algorithm.":[127],"First,":[128],"compare":[130],"two":[134],"other":[135],"algorithms":[136],"linear":[140],"(LSIP)":[142],"reformulation":[143,163],"observe":[145],"that,":[146],"exploiting":[148],"SDPT3":[150],"solver":[151],"subproblems,":[153],"finds":[156],"much":[159],"faster":[160],"than":[161],"LSIP":[162],"approaches":[164],"when":[165],"size":[167],"is":[171],"large.":[172],"Also,":[173],"apply":[175],"filter":[180],"design":[181],"those":[186],"can":[188],"be":[189],"solved":[190],"efficiently.":[191]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}