{"id":"https://openalex.org/W2077924482","doi":"https://doi.org/10.1109/ciss.2014.6814141","title":"DSOS and SDSOS optimization: LP and SOCP-based alternatives to sum of squares optimization","display_name":"DSOS and SDSOS optimization: LP and SOCP-based alternatives to sum of squares optimization","publication_year":2014,"publication_date":"2014-03-01","ids":{"openalex":"https://openalex.org/W2077924482","doi":"https://doi.org/10.1109/ciss.2014.6814141","mag":"2077924482"},"language":"en","primary_location":{"id":"doi:10.1109/ciss.2014.6814141","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ciss.2014.6814141","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","raw_type":"proceedings-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/A5101485690","display_name":"Amir Ali Ahmadi","orcid":"https://orcid.org/0009-0001-5743-354X"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amir Ali Ahmadi","raw_affiliation_strings":["Mathematical Programming Group, IBM Watson Research Center","IBM Watson Research Center at IBM's Department of Business Analytics and Mathematical Sciences, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematical Programming Group, IBM Watson Research Center","institution_ids":["https://openalex.org/I1341412227"]},{"raw_affiliation_string":"IBM Watson Research Center at IBM's Department of Business Analytics and Mathematical Sciences, USA","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102792178","display_name":"Anirudha Majumdar","orcid":"https://orcid.org/0009-0002-2296-7485"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anirudha Majumdar","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, MIT","Department of Electrical Engineering and Computer Science, CSAIL, MIT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, MIT","institution_ids":[]},{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, CSAIL, MIT, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":16.621,"has_fulltext":false,"cited_by_count":92,"citation_normalized_percentile":{"value":0.99686127,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9918000102043152,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9896000027656555,"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/semidefinite-programming","display_name":"Semidefinite programming","score":0.8824349641799927},{"id":"https://openalex.org/keywords/explained-sum-of-squares","display_name":"Explained sum of squares","score":0.709356427192688},{"id":"https://openalex.org/keywords/second-order-cone-programming","display_name":"Second-order cone programming","score":0.699743926525116},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6411136388778687},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.6303358674049377},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6078618764877319},{"id":"https://openalex.org/keywords/least-squares-function-approximation","display_name":"Least-squares function approximation","score":0.5328420400619507},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4607819616794586},{"id":"https://openalex.org/keywords/semidefinite-embedding","display_name":"Semidefinite embedding","score":0.43885332345962524},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.4358747899532318},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41913220286369324},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.2804354429244995},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.17406848073005676},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.16220524907112122}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.8824349641799927},{"id":"https://openalex.org/C49847556","wikidata":"https://www.wikidata.org/wiki/Q3964631","display_name":"Explained sum of squares","level":2,"score":0.709356427192688},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.699743926525116},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6411136388778687},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.6303358674049377},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6078618764877319},{"id":"https://openalex.org/C9936470","wikidata":"https://www.wikidata.org/wiki/Q6510405","display_name":"Least-squares function approximation","level":3,"score":0.5328420400619507},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4607819616794586},{"id":"https://openalex.org/C206818286","wikidata":"https://www.wikidata.org/wiki/Q7449403","display_name":"Semidefinite embedding","level":4,"score":0.43885332345962524},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4358747899532318},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41913220286369324},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.2804354429244995},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.17406848073005676},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.16220524907112122},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"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/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ciss.2014.6814141","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ciss.2014.6814141","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W217710249","https://openalex.org/W1530960252","https://openalex.org/W1591868040","https://openalex.org/W1806104592","https://openalex.org/W1884347414","https://openalex.org/W1967184028","https://openalex.org/W1967344706","https://openalex.org/W2049087128","https://openalex.org/W2072642243","https://openalex.org/W2105500253","https://openalex.org/W2116586985","https://openalex.org/W2120146316","https://openalex.org/W2133404041","https://openalex.org/W2148247550","https://openalex.org/W2158668441","https://openalex.org/W2313809083","https://openalex.org/W2912522929","https://openalex.org/W3144358832","https://openalex.org/W4301403801"],"related_works":["https://openalex.org/W2912522929","https://openalex.org/W2348903644","https://openalex.org/W2385886188","https://openalex.org/W2138549351","https://openalex.org/W2737505353","https://openalex.org/W1653317167","https://openalex.org/W1553621070","https://openalex.org/W2975050997","https://openalex.org/W2771160919","https://openalex.org/W4301659259"],"abstract_inverted_index":{"Sum":[0],"of":[1,15,55,76,78,88,94],"squares":[2,56,79],"(SOS)":[3],"optimization":[4,16,48,57,71],"has":[5,29],"been":[6],"a":[7,100],"powerful":[8],"and":[9,46,64,81,85],"influential":[10],"addition":[11],"to":[12,34,53],"the":[13,18],"theory":[14],"in":[17,36,91],"past":[19],"decade.":[20],"Its":[21],"reliance":[22],"on":[23,61],"relatively":[24],"large-scale":[25],"semidefinite":[26,83,95],"programming,":[27],"however,":[28],"seriously":[30],"challenged":[31],"its":[32],"ability":[33],"scale":[35],"many":[37],"practical":[38],"applications.":[39],"In":[40],"this":[41],"paper,":[42],"we":[43],"introduce":[44],"DSOS":[45],"SDSOS":[47],"as":[49],"more":[50],"tractable":[51],"alternatives":[52],"sum":[54,77],"that":[58],"rely":[59],"instead":[60],"linear":[62],"programming":[63,96],"second":[65],"order":[66],"cone":[67],"programming.":[68],"These":[69],"are":[70],"problems":[72],"over":[73],"certain":[74],"subsets":[75],"polynomials":[80],"positive":[82],"matrices":[84],"can":[86],"be":[87],"potential":[89],"interest":[90],"general":[92],"applications":[93],"where":[97],"scalability":[98],"is":[99],"limitation.":[101]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":18},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":14},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}