{"id":"https://openalex.org/W3082000164","doi":"https://doi.org/10.1137/18m1207120","title":"Optimization of a Perturbed Sweeping Process by Constrained Discontinuous Controls","display_name":"Optimization of a Perturbed Sweeping Process by Constrained Discontinuous Controls","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3082000164","doi":"https://doi.org/10.1137/18m1207120","mag":"3082000164"},"language":"en","primary_location":{"id":"doi:10.1137/18m1207120","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1207120","pdf_url":null,"source":{"id":"https://openalex.org/S897311980","display_name":"SIAM Journal on Control and Optimization","issn_l":"0363-0129","issn":["0363-0129","1095-7138"],"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 Control and Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hdl.handle.net/11577/3358653","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101437440","display_name":"Giovanni Colombo","orcid":"https://orcid.org/0000-0002-0675-0465"},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giovanni Colombo","raw_affiliation_strings":["Dipartimento di Matematica \"Tullio Levi-Civita\", Universit\u00e0 di Padova, via Trieste 63, 35121 Padova, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica \"Tullio Levi-Civita\", Universit\u00e0 di Padova, via Trieste 63, 35121 Padova, Italy","institution_ids":["https://openalex.org/I138689650"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066241737","display_name":"Boris S. Mordukhovich","orcid":"https://orcid.org/0000-0002-6071-6049"},"institutions":[{"id":"https://openalex.org/I185443292","display_name":"Wayne State University","ror":"https://ror.org/01070mq45","country_code":"US","type":"education","lineage":["https://openalex.org/I185443292"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Boris S. Mordukhovich","raw_affiliation_strings":["Department of Mathematics, Wayne State University, Detroit, Michigan 48202, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Wayne State University, Detroit, Michigan 48202, USA","institution_ids":["https://openalex.org/I185443292"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005213870","display_name":"Dao Nguyen","orcid":"https://orcid.org/0000-0003-2172-2523"},"institutions":[{"id":"https://openalex.org/I185443292","display_name":"Wayne State University","ror":"https://ror.org/01070mq45","country_code":"US","type":"education","lineage":["https://openalex.org/I185443292"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dao Nguyen","raw_affiliation_strings":["Department of Mathematics, Wayne State University, Detroit, Michigan 48202, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Wayne State University, Detroit, Michigan 48202, USA","institution_ids":["https://openalex.org/I185443292"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.5355,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.91490416,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":"58","issue":"4","first_page":"2678","last_page":"2709"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9993000030517578,"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/T12809","display_name":"Contact Mechanics and Variational Inequalities","score":0.9979000091552734,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9959999918937683,"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/mathematics","display_name":"Mathematics","score":0.7694392800331116},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.7160743474960327},{"id":"https://openalex.org/keywords/differential-inclusion","display_name":"Differential inclusion","score":0.7058907747268677},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.6010107398033142},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5582881569862366},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.556954562664032},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5311402678489685},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.5156542062759399},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4919140338897705},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4640713334083557},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.45555150508880615},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4470430016517639},{"id":"https://openalex.org/keywords/maximum-principle","display_name":"Maximum principle","score":0.4228702485561371},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.41017013788223267},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3930942118167877},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17641735076904297},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1746523678302765},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.12481901049613953},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08557355403900146}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7694392800331116},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.7160743474960327},{"id":"https://openalex.org/C70834904","wikidata":"https://www.wikidata.org/wiki/Q1054638","display_name":"Differential inclusion","level":2,"score":0.7058907747268677},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.6010107398033142},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5582881569862366},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.556954562664032},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5311402678489685},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.5156542062759399},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4919140338897705},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4640713334083557},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.45555150508880615},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4470430016517639},{"id":"https://openalex.org/C31010330","wikidata":"https://www.wikidata.org/wiki/Q1914255","display_name":"Maximum principle","level":3,"score":0.4228702485561371},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41017013788223267},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3930942118167877},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17641735076904297},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1746523678302765},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.12481901049613953},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08557355403900146},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/18m1207120","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1207120","pdf_url":null,"source":{"id":"https://openalex.org/S897311980","display_name":"SIAM Journal on Control and Optimization","issn_l":"0363-0129","issn":["0363-0129","1095-7138"],"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 Control and Optimization","raw_type":"journal-article"},{"id":"pmh:oai:www.research.unipd.it:11577/3358653","is_oa":true,"landing_page_url":"https://hdl.handle.net/11577/3358653","pdf_url":null,"source":{"id":"https://openalex.org/S4306402547","display_name":"Padua Research Archive (University of Padova)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I138689650","host_organization_name":"University of Padua","host_organization_lineage":["https://openalex.org/I138689650"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:www.research.unipd.it:11577/3358653","is_oa":true,"landing_page_url":"https://hdl.handle.net/11577/3358653","pdf_url":null,"source":{"id":"https://openalex.org/S4306402547","display_name":"Padua Research Archive (University of Padova)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I138689650","host_organization_name":"University of Padua","host_organization_lineage":["https://openalex.org/I138689650"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3132722466","display_name":null,"funder_award_id":"SID 2018","funder_id":"https://openalex.org/F4320321966","funder_display_name":"Universit\u00e0 degli Studi di Padova"},{"id":"https://openalex.org/G7234939700","display_name":"Innovations in sparse optimisation: big data nonsmooth optimisation","funder_award_id":"DP190100555","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"},{"id":"https://openalex.org/G7460605134","display_name":"Second-Order Variational Analysis and Its Applications","funder_award_id":"1512846","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G859836353","display_name":"Advanced Research on Second-Order Variational Analysis with New Applications to Optimization, Control, and Practical Modeling","funder_award_id":"1808978","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G908574215","display_name":null,"funder_award_id":"#15RT0462","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320321966","display_name":"Universit\u00e0 degli Studi di Padova","ror":"https://ror.org/00240q980"},{"id":"https://openalex.org/F4320334704","display_name":"Australian Research Council","ror":"https://ror.org/05mmh0f86"},{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1976930521","https://openalex.org/W2002371412","https://openalex.org/W2016641170","https://openalex.org/W2096391565","https://openalex.org/W2131633719","https://openalex.org/W2326414711","https://openalex.org/W2329578275","https://openalex.org/W2542096032","https://openalex.org/W2554985793","https://openalex.org/W2615148833","https://openalex.org/W2905378480","https://openalex.org/W2962947434","https://openalex.org/W2963733232","https://openalex.org/W2964179153","https://openalex.org/W2994790354"],"related_works":["https://openalex.org/W2962746246","https://openalex.org/W1967384683","https://openalex.org/W1520410026","https://openalex.org/W4292923857","https://openalex.org/W4285534277","https://openalex.org/W1989531755","https://openalex.org/W3209004265","https://openalex.org/W4211240924","https://openalex.org/W2031281152","https://openalex.org/W2771042763"],"abstract_inverted_index":{"This":[0,27,79],"paper":[1],"deals":[2],"with":[3,37,60,72,148,169],"optimal":[4],"control":[5,22,47],"problems":[6,59,110,168],"described":[7],"by":[8,17,120,173,184],"a":[9,66],"controlled":[10,117,156],"version":[11],"of":[12,29,69,85,100,151],"Moreau's":[13],"sweeping":[14,118,157,171],"process":[15,119],"governed":[16],"convex":[18],"polyhedra,":[19],"where":[20],"measurable":[21,62],"actions":[23],"enter":[24],"additive":[25],"perturbations.":[26],"class":[28],"problems,":[30],"which":[31],"addresses":[32],"unbounded":[33],"discontinuous":[34],"differential":[35],"inclusions":[36],"intrinsic":[38],"state":[39],"constraints,":[40],"is":[41],"truly":[42],"challenging":[43],"and":[44,76,87,91,111,133],"underinvestigated":[45],"in":[46,108,113,167],"theory":[48],"while":[49],"being":[50],"highly":[51],"important":[52],"for":[53,104,155,164],"various":[54],"applications.":[55],"To":[56],"attack":[57],"such":[58],"constrained":[61],"controls,":[63],"we":[64],"develop":[65],"refined":[67],"method":[68],"discrete":[70],"approximations":[71],"establishing":[73],"its":[74],"well-posedness":[75],"strong":[77],"convergence.":[78],"approach,":[80],"married":[81],"to":[82,96,122],"advanced":[83],"tools":[84],"first-order":[86],"second-order":[88],"variational":[89],"analysis":[90],"generalized":[92],"differentiations,":[93],"allows":[94],"us":[95],"derive":[97],"adequate":[98],"collections":[99],"necessary":[101,179],"optimality":[102,180],"conditions":[103,181],"local":[105],"minimizers,":[106],"first":[107],"discrete-time":[109],"then":[112],"the":[114,123,136,152],"original":[115],"continuous-time":[116],"passing":[121],"limit.":[124],"The":[125,177],"new":[126],"results":[127],"include":[128],"an":[129],"appropriate":[130],"maximum":[131,153],"condition":[132],"significantly":[134],"extend":[135],"previous":[137],"ones":[138],"obtained":[139,178],"under":[140],"essentially":[141],"more":[142],"restrictive":[143],"assumptions.":[144],"We":[145],"compare":[146],"them":[147],"other":[149],"versions":[150],"principle":[154],"processes":[158],"that":[159],"have":[160],"been":[161],"recently":[162],"established":[163],"global":[165],"minimizers":[166],"smooth":[170],"sets":[172],"using":[174],"different":[175],"techniques.":[176],"are":[182],"illustrated":[183],"several":[185],"examples.":[186]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}