default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatteo Tacchi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j6]Matteo Tacchi
, Yingzhao Lian, Colin N. Jones:
Robustly Learning Regions of Attraction From Fixed Data. IEEE Trans. Autom. Control. 70(3): 1576-1591 (2025)- 2024
- [j5]Corbinian Schlosser, Matteo Tacchi:
Specialized Effective Positivstellensätze for Improved Convergence Rates of the Moment-SOS Hierarchy. IEEE Control. Syst. Lett. 8: 2319-2324 (2024) - [c4]Jared Miller, Niklas Schmid, Matteo Tacchi, Didier Henrion, Roy S. Smith:
Peak Time-Windowed Mean Estimation using Convex Optimization. CDC 2024: 703-708 - [i6]Jared Miller, Matteo Tacchi, Didier Henrion, Mario Sznaier:
Unsafe Probabilities and Risk Contours for Stochastic Processes using Convex Optimization. CoRR abs/2401.00815 (2024) - [i5]Jared Miller, Niklas Schmid, Matteo Tacchi, Didier Henrion, Roy S. Smith:
Peak Time-Windowed Risk Estimation of Stochastic Processes. CoRR abs/2404.06961 (2024) - 2023
- [j4]Matteo Tacchi, Jean-Bernard Lasserre, Didier Henrion:
Stokes, Gibbs, and Volume Computation of Semi-Algebraic Sets. Discret. Comput. Geom. 69(1): 260-283 (2023) - [c3]Jared Miller, Matteo Tacchi, Mario Sznaier, Ashkan Jasour:
Peak Value-at-Risk Estimation for Stochastic Differential Equations Using Occupation Measures. CDC 2023: 4836-4842 - [i4]Stéphane Drobot, Matteo Tacchi, Colin N. Jones:
SOStab: a Matlab Toolbox for Approximating Regions of Attraction of Nonlinear Systems. CoRR abs/2304.08889 (2023) - 2022
- [j3]Matteo Tacchi, Tillmann Weißer, Jean-Bernard Lasserre, Didier Henrion:
Exploiting Sparsity for Semi-Algebraic Set Volume Computation. Found. Comput. Math. 22(1): 161-209 (2022) - [j2]Matteo Tacchi:
Convergence of Lasserre's hierarchy: the general case. Optim. Lett. 16(3): 1015-1033 (2022) - 2021
- [b1]Matteo Tacchi:
Moment-SOS hierarchy for large scale set approximation.Application to power systems transient stability analysis. (Hiérarchie moments-SOS pour approximation ensembliste à grande échelle. Application à l'analyse de stabilité transitoire des systèmes électriques). INSA Toulouse, France, 2021 - 2020
- [c2]Matteo Tacchi:
Model Based Transient Stability Assessment for Power Systems. ECC 2020: 328 - [i3]Matteo Tacchi:
Convergence of Lasserre's hierarchy: the general case. CoRR abs/2011.08139 (2020)
2010 – 2019
- 2019
- [j1]Antoine Oustry, Matteo Tacchi, Didier Henrion:
Inner Approximations of the Maximal Positively Invariant Set for Polynomial Dynamical Systems. IEEE Control. Syst. Lett. 3(3): 733-738 (2019) - [c1]Cédric Josz, Daniel K. Molzahn, Matteo Tacchi, Somayeh Sojoudi:
Transient Stability Analysis of Power Systems via Occupation Measures. ISGT 2019: 1-5 - [i2]Antoine Oustry, Matteo Tacchi, Didier Henrion:
Inner approximations of the maximal positively invariant set for polynomial dynamical systems. CoRR abs/1903.04798 (2019) - [i1]Matteo Tacchi, Carmen Cardozo, Didier Henrion, Jean B. Lasserre:
Approximating regions of attraction of a sparse polynomial differential system. CoRR abs/1911.09500 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-03 00:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
