{"id":"https://openalex.org/W2518134372","doi":"https://doi.org/10.1109/med.2016.7535937","title":"Complexity certifications of inexact projection primal gradient method for convex problems: Application to embedded MPC","display_name":"Complexity certifications of inexact projection primal gradient method for convex problems: Application to embedded MPC","publication_year":2016,"publication_date":"2016-06-01","ids":{"openalex":"https://openalex.org/W2518134372","doi":"https://doi.org/10.1109/med.2016.7535937","mag":"2518134372"},"language":"en","primary_location":{"id":"doi:10.1109/med.2016.7535937","is_oa":false,"landing_page_url":"https://doi.org/10.1109/med.2016.7535937","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 24th Mediterranean Conference on Control and Automation (MED)","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/A5049988389","display_name":"Andrei P\u0103tra\u015fcu","orcid":"https://orcid.org/0000-0002-9293-9386"},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Andrei Patrascu","raw_affiliation_strings":["Automatic Control and Systems Engineering Department, University Politehnica Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Automatic Control and Systems Engineering Department, University Politehnica Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019114471","display_name":"Ion Necoara","orcid":"https://orcid.org/0000-0003-1102-2654"},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Ion Necoara","raw_affiliation_strings":["Automatic Control and Systems Engineering Department, University Politehnica Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Automatic Control and Systems Engineering Department, University Politehnica Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5049988389"],"corresponding_institution_ids":["https://openalex.org/I61641377"],"apc_list":null,"apc_paid":null,"fwci":0.4285,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.78844225,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"59","issue":null,"first_page":"125","last_page":"130"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9986000061035156,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.6906431913375854},{"id":"https://openalex.org/keywords/lipschitz-continuity","display_name":"Lipschitz continuity","score":0.6578879356384277},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.5743404626846313},{"id":"https://openalex.org/keywords/proximal-gradient-methods","display_name":"Proximal Gradient Methods","score":0.5645800828933716},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.5609999299049377},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5551926493644714},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5491200089454651},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5471956729888916},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4884139895439148},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4870153069496155},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.45648691058158875},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.44539690017700195},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35815751552581787},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.338363379240036},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.12410661578178406}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.6906431913375854},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.6578879356384277},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.5743404626846313},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.5645800828933716},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.5609999299049377},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5551926493644714},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5491200089454651},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5471956729888916},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4884139895439148},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4870153069496155},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.45648691058158875},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.44539690017700195},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35815751552581787},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.338363379240036},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.12410661578178406},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/med.2016.7535937","is_oa":false,"landing_page_url":"https://doi.org/10.1109/med.2016.7535937","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 24th Mediterranean Conference on Control and Automation (MED)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W205960364","https://openalex.org/W1502987098","https://openalex.org/W1963529497","https://openalex.org/W1969598418","https://openalex.org/W1981832695","https://openalex.org/W2013439434","https://openalex.org/W2017615485","https://openalex.org/W2026079951","https://openalex.org/W2030121914","https://openalex.org/W2033121805","https://openalex.org/W2037603831","https://openalex.org/W2044774602","https://openalex.org/W2047043241","https://openalex.org/W2073787051","https://openalex.org/W2090117039","https://openalex.org/W2124541940","https://openalex.org/W2136885855","https://openalex.org/W2167732364","https://openalex.org/W2234873940","https://openalex.org/W2288556437","https://openalex.org/W2510870520","https://openalex.org/W3099831354","https://openalex.org/W3141595720","https://openalex.org/W4229650096","https://openalex.org/W4242696584","https://openalex.org/W4249513058"],"related_works":["https://openalex.org/W2149119057","https://openalex.org/W2963086517","https://openalex.org/W2564735875","https://openalex.org/W3123504125","https://openalex.org/W3147739796","https://openalex.org/W1983212821","https://openalex.org/W3127841625","https://openalex.org/W2594900731","https://openalex.org/W2811217697","https://openalex.org/W1543207628"],"abstract_inverted_index":{"In":[0],"this":[1,20,61],"paper":[2],"we":[3,22,90],"introduce":[4],"a":[5,47,75,84],"primal":[6],"projected":[7],"gradient":[8,48,81],"method":[9,45,113],"based":[10],"on":[11,126,135],"inexact":[12,70,104],"projections":[13],"for":[14,79,101,144],"solving":[15,74,145],"constrained":[16],"convex":[17,36],"problems.":[18],"For":[19],"algorithm":[21,109,117],"prove":[23],"sublinear":[24],"rate":[25],"of":[26,53,114,139],"convergence":[27],"when":[28],"applied":[29],"to":[30],"problems":[31],"with":[32,98,128],"objective":[33],"function":[34],"being":[35],"and":[37,57,110],"having":[38],"Lipschitz":[39],"gradient.":[40],"At":[41],"each":[42],"iteration,":[43],"our":[44],"computes":[46],"step":[49,62,82],"towards":[50],"the":[51,54,64,69,80,103,136,140,146],"solution":[52],"unconstrained":[55],"problem":[56,78],"then":[58],"projecting":[59],"approximately":[60,73],"onto":[63],"feasible":[65],"set.":[66],"We":[67],"recast":[68],"projection":[71],"as":[72,107],"best":[76],"approximation":[77],"until":[83],"certain":[85],"stopping":[86],"criterion":[87],"holds.":[88],"Finally,":[89],"show":[91],"that":[92],"there":[93],"are":[94,149],"available":[95],"powerful":[96],"algorithms,":[97],"linear":[99],"convergence,":[100],"computing":[102],"projection,":[105],"such":[106],"Dykstra":[108],"alternating":[111],"direction":[112],"multipliers.":[115],"Our":[116],"is":[118],"especially":[119],"useful":[120],"in":[121],"embedded":[122],"model":[123],"predictive":[124],"control":[125,147],"hardware":[127],"limited":[129],"computational":[130,137],"power,":[131],"where":[132],"tight":[133],"bounds":[134],"complexity":[138],"numerical":[141],"algorithm,":[142],"used":[143],"problem,":[148],"required.":[150]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}