{"id":"https://openalex.org/W1966986674","doi":"https://doi.org/10.1137/s1052623493258635","title":"Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems","display_name":"Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems","publication_year":1996,"publication_date":"1996-08-01","ids":{"openalex":"https://openalex.org/W1966986674","doi":"https://doi.org/10.1137/s1052623493258635","mag":"1966986674"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623493258635","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623493258635","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/A5081792425","display_name":"Jean\u2010Louis Goffin","orcid":null},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Jean-Louis Goffin","raw_affiliation_strings":["McGill University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"McGill University","institution_ids":["https://openalex.org/I5023651"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101766226","display_name":"Zhi\u2010Quan Luo","orcid":"https://orcid.org/0000-0003-3995-914X"},"institutions":[{"id":"https://openalex.org/I98251732","display_name":"McMaster University","ror":"https://ror.org/02fa3aq29","country_code":"CA","type":"education","lineage":["https://openalex.org/I98251732"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Zhi-Quan Luo","raw_affiliation_strings":["McMaster university#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"McMaster university#TAB#","institution_ids":["https://openalex.org/I98251732"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041526408","display_name":"Yinyu Ye","orcid":"https://orcid.org/0009-0001-3239-2622"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yinyu Ye","raw_affiliation_strings":["University of Iowa, "],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Iowa, ","institution_ids":["https://openalex.org/I126307644"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":11.4133,"has_fulltext":false,"cited_by_count":128,"citation_normalized_percentile":{"value":0.99062192,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"6","issue":"3","first_page":"638","last_page":"652"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9994000196456909,"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.9994000196456909,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/mathematics","display_name":"Mathematics","score":0.7906834483146667},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.7524282932281494},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.7381303906440735},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.6894093155860901},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6077938675880432},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.5444849133491516},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5086380243301392},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5034574866294861},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4958880841732025},{"id":"https://openalex.org/keywords/column-generation","display_name":"Column generation","score":0.48142191767692566},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.45891273021698},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4438939690589905},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.42599090933799744},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.425680547952652},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4175792336463928},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36629438400268555},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.15034514665603638},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12279626727104187},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.12022632360458374},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.0729374885559082}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7906834483146667},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.7524282932281494},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.7381303906440735},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.6894093155860901},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6077938675880432},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.5444849133491516},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5086380243301392},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5034574866294861},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4958880841732025},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.48142191767692566},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.45891273021698},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4438939690589905},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.42599090933799744},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.425680547952652},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4175792336463928},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36629438400268555},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.15034514665603638},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12279626727104187},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.12022632360458374},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.0729374885559082},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","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},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","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/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","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":1,"locations":[{"id":"doi:10.1137/s1052623493258635","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623493258635","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W171180563","https://openalex.org/W983997444","https://openalex.org/W1983743030","https://openalex.org/W2008062072","https://openalex.org/W2014944169","https://openalex.org/W2036622774","https://openalex.org/W2055356142","https://openalex.org/W2059499240","https://openalex.org/W2062846739","https://openalex.org/W2064948689","https://openalex.org/W2069808690","https://openalex.org/W2072653654","https://openalex.org/W2502825029","https://openalex.org/W4211092921","https://openalex.org/W4233177862","https://openalex.org/W4235328454","https://openalex.org/W4254960878","https://openalex.org/W4301435544"],"related_works":["https://openalex.org/W2073944685","https://openalex.org/W2161798622","https://openalex.org/W2030257792","https://openalex.org/W2127777220","https://openalex.org/W2089953380","https://openalex.org/W4255492803","https://openalex.org/W1984804966","https://openalex.org/W2028886191","https://openalex.org/W2107511837","https://openalex.org/W2588840994"],"abstract_inverted_index":{"We":[0,53],"further":[1],"analyze":[2],"the":[3,6,35,39,42,47,51,56,73],"convergence":[4],"and":[5,62],"complexity":[7],"of":[8,34,41,50],"a":[9,22,66,77],"dual":[10],"column":[11],"generation":[12],"algorithm":[13,57],"for":[14],"solving":[15],"general":[16],"convex":[17],"feasibility":[18],"problems":[19],"defined":[20],"by":[21,38],"separation":[23],"oracle.":[24,52],"The":[25],"oracle":[26],"is":[27,63],"called":[28],"at":[29],"an":[30],"approximate":[31],"analytic":[32],"center":[33],"set":[36],"given":[37],"intersection":[40],"linear":[43],"inequalities":[44],"which":[45],"are":[46],"previous":[48],"answers":[49],"show":[54],"that":[55,72],"converges":[58],"in":[59,64],"finite":[60],"time":[61],"fact":[65],"fully":[67],"polynomial":[68],"approximation":[69],"algorithm,":[70],"provided":[71],"feasible":[74],"region":[75],"has":[76],"nonempty":[78],"interior.":[79]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}