{"id":"https://openalex.org/W2598683230","doi":"https://doi.org/10.1109/cdc.2017.8263740","title":"Polynomial-time approximation for nonconvex optimization problems with an L1-constraint","display_name":"Polynomial-time approximation for nonconvex optimization problems with an L1-constraint","publication_year":2017,"publication_date":"2017-12-01","ids":{"openalex":"https://openalex.org/W2598683230","doi":"https://doi.org/10.1109/cdc.2017.8263740","mag":"2598683230"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2017.8263740","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2017.8263740","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE 56th Annual Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1609.08066","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000846306","display_name":"Yonatan Mintz","orcid":"https://orcid.org/0000-0002-0670-1794"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yonatan Mintz","raw_affiliation_strings":["Yonatan Mintz and Anil Aswani are with the Department of Industrial Engineering and Operations Research, University of California","Department of Industrial Engineering & Operations Research University of California, Berkeley CA 94720, USA"],"affiliations":[{"raw_affiliation_string":"Yonatan Mintz and Anil Aswani are with the Department of Industrial Engineering and Operations Research, University of California","institution_ids":[]},{"raw_affiliation_string":"Department of Industrial Engineering & Operations Research University of California, Berkeley CA 94720, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014893911","display_name":"Anil Aswani","orcid":"https://orcid.org/0000-0001-5777-7185"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anil Aswani","raw_affiliation_strings":["Yonatan Mintz and Anil Aswani are with the Department of Industrial Engineering and Operations Research, University of California","Department of Industrial Engineering & Operations Research University of California, Berkeley CA 94720, USA"],"affiliations":[{"raw_affiliation_string":"Yonatan Mintz and Anil Aswani are with the Department of Industrial Engineering and Operations Research, University of California","institution_ids":[]},{"raw_affiliation_string":"Department of Industrial Engineering & Operations Research University of California, Berkeley CA 94720, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000846306"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03047526,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"197","issue":null,"first_page":"682","last_page":"687"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9937999844551086,"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/T12288","display_name":"Optimization and Search Problems","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.6367743015289307},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6061679124832153},{"id":"https://openalex.org/keywords/binary-constraint","display_name":"Binary constraint","score":0.5690656304359436},{"id":"https://openalex.org/keywords/lipschitz-continuity","display_name":"Lipschitz continuity","score":0.5643224120140076},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5323192477226257},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5309951305389404},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5017988681793213},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49193286895751953},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4810909926891327},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.416471004486084},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3294275403022766},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.24509543180465698},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23426374793052673},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.2142166793346405},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.21114569902420044},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.15751299262046814},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.10376033186912537}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6367743015289307},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6061679124832153},{"id":"https://openalex.org/C79475747","wikidata":"https://www.wikidata.org/wiki/Q4913885","display_name":"Binary constraint","level":5,"score":0.5690656304359436},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.5643224120140076},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5323192477226257},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5309951305389404},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5017988681793213},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49193286895751953},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4810909926891327},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.416471004486084},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3294275403022766},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.24509543180465698},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23426374793052673},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.2142166793346405},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.21114569902420044},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.15751299262046814},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.10376033186912537},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/cdc.2017.8263740","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2017.8263740","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE 56th Annual Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1609.08066","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1609.08066","pdf_url":"https://arxiv.org/pdf/1609.08066","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:2598683230","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1609.08066.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1609.08066","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1609.08066","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1609.08066","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1609.08066","pdf_url":"https://arxiv.org/pdf/1609.08066","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[{"score":0.6700000166893005,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2598683230.pdf","grobid_xml":"https://content.openalex.org/works/W2598683230.grobid-xml"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W568673721","https://openalex.org/W813713473","https://openalex.org/W1480142641","https://openalex.org/W1486787620","https://openalex.org/W1517036688","https://openalex.org/W1578969866","https://openalex.org/W1740954773","https://openalex.org/W1965442989","https://openalex.org/W1973458874","https://openalex.org/W1987752344","https://openalex.org/W1993119087","https://openalex.org/W1998163185","https://openalex.org/W2022191808","https://openalex.org/W2026129593","https://openalex.org/W2052763589","https://openalex.org/W2071228820","https://openalex.org/W2082724503","https://openalex.org/W2090365650","https://openalex.org/W2090960684","https://openalex.org/W2095705004","https://openalex.org/W2103658959","https://openalex.org/W2106875569","https://openalex.org/W2114616381","https://openalex.org/W2114650657","https://openalex.org/W2117271243","https://openalex.org/W2132427735","https://openalex.org/W2134232759","https://openalex.org/W2144710417","https://openalex.org/W2162500852","https://openalex.org/W2188201725","https://openalex.org/W2913688336","https://openalex.org/W2950038749","https://openalex.org/W3011766368","https://openalex.org/W3102865626","https://openalex.org/W4245577611","https://openalex.org/W4292230561","https://openalex.org/W6674330103","https://openalex.org/W6682889407"],"related_works":["https://openalex.org/W2968452945","https://openalex.org/W3007099432","https://openalex.org/W2314855177","https://openalex.org/W2972309784","https://openalex.org/W2230723396","https://openalex.org/W2024034153","https://openalex.org/W1568816820","https://openalex.org/W2953033894","https://openalex.org/W2785315711","https://openalex.org/W2964351225","https://openalex.org/W1532024725","https://openalex.org/W3087954410","https://openalex.org/W2963486090","https://openalex.org/W2891444883","https://openalex.org/W3174761287","https://openalex.org/W2594099471","https://openalex.org/W2762688401","https://openalex.org/W2070642658","https://openalex.org/W2953286221","https://openalex.org/W2904185888"],"abstract_inverted_index":{"Nonconvex":[0],"optimization":[1,33,158],"problems":[2,34,92],"with":[3,35,52,167],"an":[4,36,53,149,168],"L1-constraint":[5,37,54],"are":[6,9],"ubiquitous,":[7],"and":[8,23,25,109,135,170],"found":[10],"in":[11,42,58,67,100,142],"many":[12],"application":[13],"domains":[14],"including:":[15],"optimal":[16],"control":[17],"of":[18,61,70,78,105,111,117,139,159],"hybrid":[19],"systems,":[20],"machine":[21],"learning":[22],"statistics,":[24],"operations":[26],"research.":[27],"This":[28],"paper":[29],"shows":[30,89],"that":[31,48,64,90,97,128],"nonconvex":[32],"can":[38,55],"be":[39,56],"approximately":[40],"solved":[41,57],"polynomial":[43,66,84,99,151],"time.":[44],"We":[45,120,145],"first":[46],"show":[47],"nonlinear":[49],"integer":[50,85],"programs":[51],"a":[59,94,125,173],"number":[60,110],"oracle":[62],"steps":[63],"is":[65,98],"the":[68,71,79,103,106,118,137],"dimension":[69,104],"decision":[72,107],"variable,":[73],"for":[74,113,156],"each":[75,114],"fixed":[76,115],"radius":[77,116],"L1-constraint.":[80,119],"When":[81],"specialized":[82],"to":[83,163,175],"programs,":[86],"our":[87],"result":[88,123],"such":[91],"have":[93],"time":[95,152],"complexity":[96],"simultaneously":[101],"both":[102],"variables":[108],"constraints,":[112],"prove":[121],"this":[122],"using":[124],"geometric":[126],"argument":[127],"leverages":[129],"ideas":[130],"from":[131,136],"stochastic":[132],"process":[133],"theory":[134,138],"convex":[140],"bodies":[141],"high-dimensional":[143],"spaces.":[144],"conclude":[146],"by":[147],"providing":[148],"additive":[150],"approximation":[153],"scheme":[154],"(PTAS)":[155],"continuous":[157],"Lipschitz":[160,164],"functions":[161],"subject":[162],"constraints":[165],"intersected":[166],"L1-constraint,":[169],"we":[171],"sketch":[172],"generalization":[174],"mixed-integer":[176],"optimization.":[177]},"counts_by_year":[],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}
