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