{"id":"https://openalex.org/W2095365233","doi":"https://doi.org/10.1137/s1052623495294943","title":"An Analytic Center Based Column Generation Algorithm for Convex Quadratic Feasibility Problems","display_name":"An Analytic Center Based Column Generation Algorithm for Convex Quadratic Feasibility Problems","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W2095365233","doi":"https://doi.org/10.1137/s1052623495294943","mag":"2095365233"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623495294943","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623495294943","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/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/A5100618850","display_name":"Jie Sun","orcid":"https://orcid.org/0000-0001-5611-1672"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Jie Sun","raw_affiliation_strings":["National University of Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National University of Singapore","institution_ids":["https://openalex.org/I165932596"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.0951,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.95527015,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"9","issue":"1","first_page":"217","last_page":"235"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9977999925613403,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9922999739646912,"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.8090372085571289},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.6811531186103821},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5239769816398621},{"id":"https://openalex.org/keywords/linear-inequality","display_name":"Linear inequality","score":0.5037047266960144},{"id":"https://openalex.org/keywords/quadratic-function","display_name":"Quadratic function","score":0.5022182464599609},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.48606136441230774},{"id":"https://openalex.org/keywords/center","display_name":"Center (category theory)","score":0.4840668737888336},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.4626482427120209},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.44935253262519836},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44599252939224243},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.42879554629325867},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4283212125301361},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.41991811990737915},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35138148069381714},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34233230352401733},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2615334987640381},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1386399269104004},{"id":"https://openalex.org/keywords/inequality","display_name":"Inequality","score":0.11797785758972168},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06390127539634705}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8090372085571289},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.6811531186103821},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5239769816398621},{"id":"https://openalex.org/C84135550","wikidata":"https://www.wikidata.org/wiki/Q3154022","display_name":"Linear inequality","level":3,"score":0.5037047266960144},{"id":"https://openalex.org/C166437778","wikidata":"https://www.wikidata.org/wiki/Q50695","display_name":"Quadratic function","level":3,"score":0.5022182464599609},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48606136441230774},{"id":"https://openalex.org/C2779463800","wikidata":"https://www.wikidata.org/wiki/Q5062222","display_name":"Center (category theory)","level":2,"score":0.4840668737888336},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.4626482427120209},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.44935253262519836},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44599252939224243},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.42879554629325867},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4283212125301361},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.41991811990737915},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35138148069381714},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34233230352401733},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2615334987640381},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1386399269104004},{"id":"https://openalex.org/C45555294","wikidata":"https://www.wikidata.org/wiki/Q28113351","display_name":"Inequality","level":2,"score":0.11797785758972168},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06390127539634705},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s1052623495294943","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623495294943","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:scholarbank.nus.edu.sg:10635/45026","is_oa":false,"landing_page_url":"http://scholarbank.nus.edu.sg/handle/10635/45026","pdf_url":null,"source":{"id":"https://openalex.org/S7407052290","display_name":"National University of Singapore","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Scopus","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W171180563","https://openalex.org/W1966986674","https://openalex.org/W1972639694","https://openalex.org/W1974001978","https://openalex.org/W1980331059","https://openalex.org/W2007831912","https://openalex.org/W2044908666","https://openalex.org/W2048133466","https://openalex.org/W2059499240","https://openalex.org/W2059724554","https://openalex.org/W2070426678","https://openalex.org/W2081632040","https://openalex.org/W2081807695","https://openalex.org/W2262284202","https://openalex.org/W3159982138","https://openalex.org/W4231459397","https://openalex.org/W4233177862","https://openalex.org/W4235328454","https://openalex.org/W4237512656"],"related_works":["https://openalex.org/W1998607366","https://openalex.org/W4286899697","https://openalex.org/W1994547505","https://openalex.org/W3187930658","https://openalex.org/W4287773735","https://openalex.org/W2059724554","https://openalex.org/W4287547507","https://openalex.org/W2168735742","https://openalex.org/W2027846478","https://openalex.org/W2095365233"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,10,32,40,44,51,63,72,90,94,99,107,114,128,135,154,173,184,192,197,200,205,210,221],"analytic":[3,37,57,118],"center":[4,38,58,74,119],"based":[5,120],"column":[6,121,212],"generation":[7,122,213],"algorithm":[8,33,64,108],"for":[9,127,134],"problem":[11,131,193,225],"of":[12,25,39,46,96,157,169,176,186,199],"finding":[13],"a":[14,18,22,60,67,78,84,111,164],"feasible":[15,206],"point":[16],"in":[17,50,147,153,191,204,226],"set":[19,41,100],"defined":[20,42,101],"by":[21,43,83,102],"finite":[23],"number":[24,95,175,185],"convex":[26,85,137,187,222],"quadratic":[27,47,68,80,86,188,223],"inequalities.":[28],"At":[29],"each":[30],"iteration":[31],"computes":[34],"an":[35],"approximate":[36,56,91],"intersection":[45,104],"inequalities":[48,190],"generated":[49],"previous":[52],"iterations.":[53],"If":[54],"this":[55],"is":[59,75,88,183,196],"solution,":[61],"then":[62],"terminates;":[65],"otherwise":[66],"inequality":[69],"violated":[70],"at":[71],"current":[73],"selected":[76],"and":[77,106,132,194],"new":[79],"cut":[81],"(defined":[82],"inequality)":[87],"placednear":[89],"center.":[92],"As":[93],"cuts":[97,177,217],"increases,":[98],"their":[103],"shrinks":[105],"eventually":[109],"finds":[110],"solution":[112],"to":[113,178],"problem.":[115,139],"Previously,":[116],"similar":[117],"algorithms":[123],"were":[124],"studied":[125],"first":[126],"linear":[129,158,216],"feasibility":[130,138,224],"later":[133],"general":[136],"Our":[140],"method":[141,162],"differs":[142],"from":[143],"these":[144],"early":[145,211],"methods":[146,214],"that":[148],"we":[149],"use":[150],"\"quadratic":[151],"cuts\"":[152],"computation":[155],"instead":[156],"cuts.":[159],"Moreover,":[160],"our":[161],"has":[163],"polynomial":[165,189],"worst":[166],"case":[167],"complexity":[168],"$O(n\\ln":[170],"\\frac{1}{\\varepsilon})$":[171],"on":[172],"total":[174],"be":[179],"used,":[180],"where":[181],"n":[182],"$\\varepsilon$":[195],"radius":[198],"largest":[201],"ball":[202],"contained":[203],"set.":[207],"In":[208],"contrast,":[209],"using":[215],"can":[218],"only":[219],"solve":[220],"pseudopolynomial":[227],"time.":[228]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
