Gray Box Identification Using Difference of Convex Programming Article Swipe
YOU?
·
· 2017
· Open Access
·
· DOI: https://doi.org/10.1016/j.ifacol.2017.08.1469
Gray-box identification is prevalent in modeling physical and networked systems. However, due to the non-convex nature of the gray-box identification problem, good initial parameter estimates are crucial for a successful application. In this paper, a new identification method is proposed by exploiting the low-rank and structured Hankel matrix of impulse response. This identification problem is recasted into a difference-of-convex programming problem, which is then solved by the sequential convex programming approach with the associated initialization obtained by nuclear-norm optimization. The presented method aims to achieve the maximum impulse-response fitting while not requiring additional (non-convex) conditions to secure non-singularity of the similarity transformation relating the given state-space matrices to the gray-box parameterized ones. This overcomes a persistent shortcoming in a number of recent contributions on this topic, and the new method can be applied for the structured state-space realization even if the involved system parameters are unidentifiable. The method can be used both for directly estimating the gray-box parameters and for providing initial parameter estimates for further iterative search in a conventional gray-box identification setup.
Related Topics
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.1016/j.ifacol.2017.08.1469
- OA Status
- diamond
- Cited By
- 5
- References
- 19
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W2766162775
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W2766162775Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1016/j.ifacol.2017.08.1469Digital Object Identifier
- Title
-
Gray Box Identification Using Difference of Convex ProgrammingWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2017Year of publication
- Publication date
-
2017-07-01Full publication date if available
- Authors
-
Chengpu Yu, Lennart Ljung, Michel VerhaegenList of authors in order
- Landing page
-
https://doi.org/10.1016/j.ifacol.2017.08.1469Publisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
diamondOpen access status per OpenAlex
- OA URL
-
https://doi.org/10.1016/j.ifacol.2017.08.1469Direct OA link when available
- Concepts
-
Initialization, System identification, Mathematical optimization, Parameter identification problem, Hankel matrix, Impulse response, Parameterized complexity, Solver, Mathematics, Convex optimization, Computer science, Identification (biology), Algorithm, Regular polygon, Botany, Mathematical analysis, Geometry, Programming language, Biology, Measure (data warehouse), Database, Model parameterTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
5Total citation count in OpenAlex
- Citations by year (recent)
-
2024: 1, 2021: 1, 2019: 2, 2018: 1Per-year citation counts (last 5 years)
- References (count)
-
19Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W2766162775 |
|---|---|
| doi | https://doi.org/10.1016/j.ifacol.2017.08.1469 |
| ids.doi | https://doi.org/10.1016/j.ifacol.2017.08.1469 |
| ids.mag | 2766162775 |
| ids.openalex | https://openalex.org/W2766162775 |
| fwci | 0.9389466 |
| type | article |
| title | Gray Box Identification Using Difference of Convex Programming |
| biblio.issue | 1 |
| biblio.volume | 50 |
| biblio.last_page | 9467 |
| biblio.first_page | 9462 |
| topics[0].id | https://openalex.org/T10500 |
| topics[0].field.id | https://openalex.org/fields/22 |
| topics[0].field.display_name | Engineering |
| topics[0].score | 0.9983999729156494 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/2206 |
| topics[0].subfield.display_name | Computational Mechanics |
| topics[0].display_name | Sparse and Compressive Sensing Techniques |
| topics[1].id | https://openalex.org/T11236 |
| topics[1].field.id | https://openalex.org/fields/22 |
| topics[1].field.display_name | Engineering |
| topics[1].score | 0.9972000122070312 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/2207 |
| topics[1].subfield.display_name | Control and Systems Engineering |
| topics[1].display_name | Control Systems and Identification |
| topics[2].id | https://openalex.org/T11447 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9952999949455261 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1711 |
| topics[2].subfield.display_name | Signal Processing |
| topics[2].display_name | Blind Source Separation Techniques |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C114466953 |
| concepts[0].level | 2 |
| concepts[0].score | 0.566078245639801 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q6034165 |
| concepts[0].display_name | Initialization |
| concepts[1].id | https://openalex.org/C119247159 |
| concepts[1].level | 3 |
| concepts[1].score | 0.5507515072822571 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q1366192 |
| concepts[1].display_name | System identification |
| concepts[2].id | https://openalex.org/C126255220 |
| concepts[2].level | 1 |
| concepts[2].score | 0.5262388586997986 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[2].display_name | Mathematical optimization |
| concepts[3].id | https://openalex.org/C79610928 |
| concepts[3].level | 3 |
| concepts[3].score | 0.5119773149490356 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q1656743 |
| concepts[3].display_name | Parameter identification problem |
| concepts[4].id | https://openalex.org/C25023664 |
| concepts[4].level | 2 |
| concepts[4].score | 0.4984116554260254 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q1575637 |
| concepts[4].display_name | Hankel matrix |
| concepts[5].id | https://openalex.org/C72279823 |
| concepts[5].level | 2 |
| concepts[5].score | 0.4862755537033081 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q1139726 |
| concepts[5].display_name | Impulse response |
| concepts[6].id | https://openalex.org/C165464430 |
| concepts[6].level | 2 |
| concepts[6].score | 0.4718221127986908 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q1570441 |
| concepts[6].display_name | Parameterized complexity |
| concepts[7].id | https://openalex.org/C2778770139 |
| concepts[7].level | 2 |
| concepts[7].score | 0.4599205255508423 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q1966904 |
| concepts[7].display_name | Solver |
| concepts[8].id | https://openalex.org/C33923547 |
| concepts[8].level | 0 |
| concepts[8].score | 0.459919810295105 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[8].display_name | Mathematics |
| concepts[9].id | https://openalex.org/C157972887 |
| concepts[9].level | 3 |
| concepts[9].score | 0.4425579309463501 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q463359 |
| concepts[9].display_name | Convex optimization |
| concepts[10].id | https://openalex.org/C41008148 |
| concepts[10].level | 0 |
| concepts[10].score | 0.433065265417099 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[10].display_name | Computer science |
| concepts[11].id | https://openalex.org/C116834253 |
| concepts[11].level | 2 |
| concepts[11].score | 0.4102478623390198 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q2039217 |
| concepts[11].display_name | Identification (biology) |
| concepts[12].id | https://openalex.org/C11413529 |
| concepts[12].level | 1 |
| concepts[12].score | 0.40620118379592896 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[12].display_name | Algorithm |
| concepts[13].id | https://openalex.org/C112680207 |
| concepts[13].level | 2 |
| concepts[13].score | 0.4052811563014984 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q714886 |
| concepts[13].display_name | Regular polygon |
| concepts[14].id | https://openalex.org/C59822182 |
| concepts[14].level | 1 |
| concepts[14].score | 0.0 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q441 |
| concepts[14].display_name | Botany |
| concepts[15].id | https://openalex.org/C134306372 |
| concepts[15].level | 1 |
| concepts[15].score | 0.0 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q7754 |
| concepts[15].display_name | Mathematical analysis |
| concepts[16].id | https://openalex.org/C2524010 |
| concepts[16].level | 1 |
| concepts[16].score | 0.0 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q8087 |
| concepts[16].display_name | Geometry |
| concepts[17].id | https://openalex.org/C199360897 |
| concepts[17].level | 1 |
| concepts[17].score | 0.0 |
| concepts[17].wikidata | https://www.wikidata.org/wiki/Q9143 |
| concepts[17].display_name | Programming language |
| concepts[18].id | https://openalex.org/C86803240 |
| concepts[18].level | 0 |
| concepts[18].score | 0.0 |
| concepts[18].wikidata | https://www.wikidata.org/wiki/Q420 |
| concepts[18].display_name | Biology |
| concepts[19].id | https://openalex.org/C2780009758 |
| concepts[19].level | 2 |
| concepts[19].score | 0.0 |
| concepts[19].wikidata | https://www.wikidata.org/wiki/Q6804172 |
| concepts[19].display_name | Measure (data warehouse) |
| concepts[20].id | https://openalex.org/C77088390 |
| concepts[20].level | 1 |
| concepts[20].score | 0.0 |
| concepts[20].wikidata | https://www.wikidata.org/wiki/Q8513 |
| concepts[20].display_name | Database |
| concepts[21].id | https://openalex.org/C2983447341 |
| concepts[21].level | 2 |
| concepts[21].score | 0.0 |
| concepts[21].wikidata | https://www.wikidata.org/wiki/Q1413083 |
| concepts[21].display_name | Model parameter |
| keywords[0].id | https://openalex.org/keywords/initialization |
| keywords[0].score | 0.566078245639801 |
| keywords[0].display_name | Initialization |
| keywords[1].id | https://openalex.org/keywords/system-identification |
| keywords[1].score | 0.5507515072822571 |
| keywords[1].display_name | System identification |
| keywords[2].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[2].score | 0.5262388586997986 |
| keywords[2].display_name | Mathematical optimization |
| keywords[3].id | https://openalex.org/keywords/parameter-identification-problem |
| keywords[3].score | 0.5119773149490356 |
| keywords[3].display_name | Parameter identification problem |
| keywords[4].id | https://openalex.org/keywords/hankel-matrix |
| keywords[4].score | 0.4984116554260254 |
| keywords[4].display_name | Hankel matrix |
| keywords[5].id | https://openalex.org/keywords/impulse-response |
| keywords[5].score | 0.4862755537033081 |
| keywords[5].display_name | Impulse response |
| keywords[6].id | https://openalex.org/keywords/parameterized-complexity |
| keywords[6].score | 0.4718221127986908 |
| keywords[6].display_name | Parameterized complexity |
| keywords[7].id | https://openalex.org/keywords/solver |
| keywords[7].score | 0.4599205255508423 |
| keywords[7].display_name | Solver |
| keywords[8].id | https://openalex.org/keywords/mathematics |
| keywords[8].score | 0.459919810295105 |
| keywords[8].display_name | Mathematics |
| keywords[9].id | https://openalex.org/keywords/convex-optimization |
| keywords[9].score | 0.4425579309463501 |
| keywords[9].display_name | Convex optimization |
| keywords[10].id | https://openalex.org/keywords/computer-science |
| keywords[10].score | 0.433065265417099 |
| keywords[10].display_name | Computer science |
| keywords[11].id | https://openalex.org/keywords/identification |
| keywords[11].score | 0.4102478623390198 |
| keywords[11].display_name | Identification (biology) |
| keywords[12].id | https://openalex.org/keywords/algorithm |
| keywords[12].score | 0.40620118379592896 |
| keywords[12].display_name | Algorithm |
| keywords[13].id | https://openalex.org/keywords/regular-polygon |
| keywords[13].score | 0.4052811563014984 |
| keywords[13].display_name | Regular polygon |
| language | en |
| locations[0].id | doi:10.1016/j.ifacol.2017.08.1469 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S2898405271 |
| locations[0].source.issn | 2405-8963, 2405-8971 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | 2405-8963 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | IFAC-PapersOnLine |
| locations[0].source.host_organization | https://openalex.org/P4310320990 |
| locations[0].source.host_organization_name | Elsevier BV |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310320990 |
| locations[0].source.host_organization_lineage_names | Elsevier BV |
| 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 | IFAC-PapersOnLine |
| locations[0].landing_page_url | https://doi.org/10.1016/j.ifacol.2017.08.1469 |
| locations[1].id | pmh:oai:tudelft.nl:uuid:0f32cbc6-455d-4368-89fb-4e34303b7c16 |
| locations[1].is_oa | False |
| locations[1].source.id | https://openalex.org/S4306400906 |
| 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 | Research Repository (Delft University of Technology) |
| locations[1].source.host_organization | https://openalex.org/I98358874 |
| locations[1].source.host_organization_name | Delft University of Technology |
| locations[1].source.host_organization_lineage | https://openalex.org/I98358874 |
| locations[1].license | |
| locations[1].pdf_url | |
| locations[1].version | submittedVersion |
| locations[1].raw_type | conference paper |
| locations[1].license_id | |
| locations[1].is_accepted | False |
| locations[1].is_published | False |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | http://resolver.tudelft.nl/uuid:0f32cbc6-455d-4368-89fb-4e34303b7c16 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5018395060 |
| authorships[0].author.orcid | https://orcid.org/0000-0002-3466-2876 |
| authorships[0].author.display_name | Chengpu Yu |
| authorships[0].countries | NL |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I98358874 |
| authorships[0].affiliations[0].raw_affiliation_string | Delft Center for Systems and Control, Delft University, Delft 2628CD, Netherlands |
| authorships[0].institutions[0].id | https://openalex.org/I98358874 |
| authorships[0].institutions[0].ror | https://ror.org/02e2c7k09 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I98358874 |
| authorships[0].institutions[0].country_code | NL |
| authorships[0].institutions[0].display_name | Delft University of Technology |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Chengpu Yu |
| authorships[0].is_corresponding | True |
| authorships[0].raw_affiliation_strings | Delft Center for Systems and Control, Delft University, Delft 2628CD, Netherlands |
| authorships[1].author.id | https://openalex.org/A5078405221 |
| authorships[1].author.orcid | https://orcid.org/0000-0003-4881-8955 |
| authorships[1].author.display_name | Lennart Ljung |
| authorships[1].countries | SE |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I102134673 |
| authorships[1].affiliations[0].raw_affiliation_string | Division of Automatic Control, Department of Electrical Engineering, Linkoping University, Sweden |
| authorships[1].institutions[0].id | https://openalex.org/I102134673 |
| authorships[1].institutions[0].ror | https://ror.org/05ynxx418 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I102134673 |
| authorships[1].institutions[0].country_code | SE |
| authorships[1].institutions[0].display_name | Linköping University |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Lennart Ljung |
| authorships[1].is_corresponding | True |
| authorships[1].raw_affiliation_strings | Division of Automatic Control, Department of Electrical Engineering, Linkoping University, Sweden |
| authorships[2].author.id | https://openalex.org/A5003504954 |
| authorships[2].author.orcid | https://orcid.org/0000-0002-7967-6884 |
| authorships[2].author.display_name | Michel Verhaegen |
| authorships[2].countries | NL |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I98358874 |
| authorships[2].affiliations[0].raw_affiliation_string | Delft Center for Systems and Control, Delft University, Delft 2628CD, Netherlands |
| authorships[2].institutions[0].id | https://openalex.org/I98358874 |
| authorships[2].institutions[0].ror | https://ror.org/02e2c7k09 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I98358874 |
| authorships[2].institutions[0].country_code | NL |
| authorships[2].institutions[0].display_name | Delft University of Technology |
| authorships[2].author_position | last |
| authorships[2].raw_author_name | Michel Verhaegen |
| authorships[2].is_corresponding | True |
| authorships[2].raw_affiliation_strings | Delft Center for Systems and Control, Delft University, Delft 2628CD, Netherlands |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://doi.org/10.1016/j.ifacol.2017.08.1469 |
| open_access.oa_status | diamond |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Gray Box Identification Using Difference of Convex Programming |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10500 |
| primary_topic.field.id | https://openalex.org/fields/22 |
| primary_topic.field.display_name | Engineering |
| primary_topic.score | 0.9983999729156494 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/2206 |
| primary_topic.subfield.display_name | Computational Mechanics |
| primary_topic.display_name | Sparse and Compressive Sensing Techniques |
| related_works | https://openalex.org/W2385614044, https://openalex.org/W2803806910, https://openalex.org/W2054616108, https://openalex.org/W2375002642, https://openalex.org/W2534131053, https://openalex.org/W1576040274, https://openalex.org/W2030315448, https://openalex.org/W2117059447, https://openalex.org/W2156286457, https://openalex.org/W2052798316 |
| cited_by_count | 5 |
| counts_by_year[0].year | 2024 |
| counts_by_year[0].cited_by_count | 1 |
| counts_by_year[1].year | 2021 |
| counts_by_year[1].cited_by_count | 1 |
| counts_by_year[2].year | 2019 |
| counts_by_year[2].cited_by_count | 2 |
| counts_by_year[3].year | 2018 |
| counts_by_year[3].cited_by_count | 1 |
| locations_count | 2 |
| best_oa_location.id | doi:10.1016/j.ifacol.2017.08.1469 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S2898405271 |
| best_oa_location.source.issn | 2405-8963, 2405-8971 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | 2405-8963 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | IFAC-PapersOnLine |
| best_oa_location.source.host_organization | https://openalex.org/P4310320990 |
| best_oa_location.source.host_organization_name | Elsevier BV |
| best_oa_location.source.host_organization_lineage | https://openalex.org/P4310320990 |
| best_oa_location.source.host_organization_lineage_names | Elsevier BV |
| best_oa_location.license | |
| best_oa_location.pdf_url | |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | IFAC-PapersOnLine |
| best_oa_location.landing_page_url | https://doi.org/10.1016/j.ifacol.2017.08.1469 |
| primary_location.id | doi:10.1016/j.ifacol.2017.08.1469 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S2898405271 |
| primary_location.source.issn | 2405-8963, 2405-8971 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | 2405-8963 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | IFAC-PapersOnLine |
| primary_location.source.host_organization | https://openalex.org/P4310320990 |
| primary_location.source.host_organization_name | Elsevier BV |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310320990 |
| primary_location.source.host_organization_lineage_names | Elsevier BV |
| 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 | IFAC-PapersOnLine |
| primary_location.landing_page_url | https://doi.org/10.1016/j.ifacol.2017.08.1469 |
| publication_date | 2017-07-01 |
| publication_year | 2017 |
| referenced_works | https://openalex.org/W2058899256, https://openalex.org/W6641836079, https://openalex.org/W2576448264, https://openalex.org/W1969698720, https://openalex.org/W1571538529, https://openalex.org/W2111993375, https://openalex.org/W2078857903, https://openalex.org/W6602344895, https://openalex.org/W2118550318, https://openalex.org/W2131038454, https://openalex.org/W2319977202, https://openalex.org/W6633909130, https://openalex.org/W2275184629, https://openalex.org/W178056938, https://openalex.org/W3102756123, https://openalex.org/W2262919957, https://openalex.org/W1967503042, https://openalex.org/W1547003416, https://openalex.org/W57413261 |
| referenced_works_count | 19 |
| abstract_inverted_index.a | 28, 34, 57, 114, 118, 169 |
| abstract_inverted_index.In | 31 |
| abstract_inverted_index.be | 131, 149 |
| abstract_inverted_index.by | 40, 65, 76 |
| abstract_inverted_index.if | 139 |
| abstract_inverted_index.in | 4, 117, 168 |
| abstract_inverted_index.is | 2, 38, 54, 62 |
| abstract_inverted_index.of | 16, 48, 98, 120 |
| abstract_inverted_index.on | 123 |
| abstract_inverted_index.to | 12, 83, 95, 107 |
| abstract_inverted_index.The | 79, 146 |
| abstract_inverted_index.and | 7, 44, 126, 158 |
| abstract_inverted_index.are | 25, 144 |
| abstract_inverted_index.can | 130, 148 |
| abstract_inverted_index.due | 11 |
| abstract_inverted_index.for | 27, 133, 152, 159, 164 |
| abstract_inverted_index.new | 35, 128 |
| abstract_inverted_index.not | 90 |
| abstract_inverted_index.the | 13, 17, 42, 66, 72, 85, 99, 103, 108, 127, 134, 140, 155 |
| abstract_inverted_index.This | 51, 112 |
| abstract_inverted_index.aims | 82 |
| abstract_inverted_index.both | 151 |
| abstract_inverted_index.even | 138 |
| abstract_inverted_index.good | 21 |
| abstract_inverted_index.into | 56 |
| abstract_inverted_index.then | 63 |
| abstract_inverted_index.this | 32, 124 |
| abstract_inverted_index.used | 150 |
| abstract_inverted_index.with | 71 |
| abstract_inverted_index.given | 104 |
| abstract_inverted_index.ones. | 111 |
| abstract_inverted_index.which | 61 |
| abstract_inverted_index.while | 89 |
| abstract_inverted_index.Hankel | 46 |
| abstract_inverted_index.convex | 68 |
| abstract_inverted_index.matrix | 47 |
| abstract_inverted_index.method | 37, 81, 129, 147 |
| abstract_inverted_index.nature | 15 |
| abstract_inverted_index.number | 119 |
| abstract_inverted_index.paper, | 33 |
| abstract_inverted_index.recent | 121 |
| abstract_inverted_index.search | 167 |
| abstract_inverted_index.secure | 96 |
| abstract_inverted_index.solved | 64 |
| abstract_inverted_index.system | 142 |
| abstract_inverted_index.topic, | 125 |
| abstract_inverted_index.achieve | 84 |
| abstract_inverted_index.applied | 132 |
| abstract_inverted_index.crucial | 26 |
| abstract_inverted_index.fitting | 88 |
| abstract_inverted_index.further | 165 |
| abstract_inverted_index.impulse | 49 |
| abstract_inverted_index.initial | 22, 161 |
| abstract_inverted_index.maximum | 86 |
| abstract_inverted_index.problem | 53 |
| abstract_inverted_index.However, | 10 |
| abstract_inverted_index.approach | 70 |
| abstract_inverted_index.directly | 153 |
| abstract_inverted_index.gray-box | 18, 109, 156, 171 |
| abstract_inverted_index.involved | 141 |
| abstract_inverted_index.low-rank | 43 |
| abstract_inverted_index.matrices | 106 |
| abstract_inverted_index.modeling | 5 |
| abstract_inverted_index.obtained | 75 |
| abstract_inverted_index.physical | 6 |
| abstract_inverted_index.problem, | 20, 60 |
| abstract_inverted_index.proposed | 39 |
| abstract_inverted_index.recasted | 55 |
| abstract_inverted_index.relating | 102 |
| abstract_inverted_index.systems. | 9 |
| abstract_inverted_index.estimates | 24, 163 |
| abstract_inverted_index.iterative | 166 |
| abstract_inverted_index.networked | 8 |
| abstract_inverted_index.overcomes | 113 |
| abstract_inverted_index.parameter | 23, 162 |
| abstract_inverted_index.presented | 80 |
| abstract_inverted_index.prevalent | 3 |
| abstract_inverted_index.providing | 160 |
| abstract_inverted_index.requiring | 91 |
| abstract_inverted_index.response. | 50 |
| abstract_inverted_index.additional | 92 |
| abstract_inverted_index.associated | 73 |
| abstract_inverted_index.conditions | 94 |
| abstract_inverted_index.estimating | 154 |
| abstract_inverted_index.exploiting | 41 |
| abstract_inverted_index.non-convex | 14 |
| abstract_inverted_index.parameters | 143, 157 |
| abstract_inverted_index.persistent | 115 |
| abstract_inverted_index.sequential | 67 |
| abstract_inverted_index.similarity | 100 |
| abstract_inverted_index.structured | 45, 135 |
| abstract_inverted_index.successful | 29 |
| abstract_inverted_index.programming | 59, 69 |
| abstract_inverted_index.realization | 137 |
| abstract_inverted_index.shortcoming | 116 |
| abstract_inverted_index.state-space | 105, 136 |
| abstract_inverted_index.(non-convex) | 93 |
| abstract_inverted_index.application. | 30 |
| abstract_inverted_index.conventional | 170 |
| abstract_inverted_index.nuclear-norm | 77 |
| abstract_inverted_index.contributions | 122 |
| abstract_inverted_index.optimization. | 78 |
| abstract_inverted_index.parameterized | 110 |
| abstract_inverted_index.identification | 1, 19, 36, 52, 172 |
| abstract_inverted_index.initialization | 74 |
| abstract_inverted_index.transformation | 101 |
| abstract_inverted_index.non-singularity | 97 |
| abstract_inverted_index.unidentifiable. | 145 |
| abstract_inverted_index.impulse-response | 87 |
| abstract_inverted_index.setup.</p> | 173 |
| abstract_inverted_index.<p>Gray-box | 0 |
| abstract_inverted_index.difference-of-convex | 58 |
| cited_by_percentile_year.max | 96 |
| cited_by_percentile_year.min | 89 |
| corresponding_author_ids | https://openalex.org/A5078405221, https://openalex.org/A5003504954, https://openalex.org/A5018395060 |
| countries_distinct_count | 2 |
| institutions_distinct_count | 3 |
| corresponding_institution_ids | https://openalex.org/I102134673, https://openalex.org/I98358874 |
| citation_normalized_percentile.value | 0.7051678 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |