default search action
Ngoc Hoang Anh Mai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j7]Ngoc Hoang Anh Mai, Victor Magron
, Jean B. Lasserre
A Sparse Version of Reznick's Positivstellensatz. Math. Oper. Res. 48(2): 812-833 (2023) - [j6]Ngoc Hoang Anh Mai, Jean-Bernard Lasserre, Victor Magron:
A hierarchy of spectral relaxations for polynomial optimization. Math. Program. Comput. 15(4): 651-701 (2023) - 2022
- [b1]Ngoc Hoang Anh Mai:
Practical polynomial optimization through positivity certificates with and without denominators. (Optimisation polynomiale effective via des certificats de positivité avec ou sans dénominateurs). Paul Sabatier University, Toulouse, France, 2022 - [j5]Ngoc Hoang Anh Mai, Victor Magron:
On the complexity of Putinar-Vasilescu's Positivstellensatz. J. Complex. 72: 101663 (2022) - [j4]Ngoc Hoang Anh Mai, Jean-Bernard Lasserre, Victor Magron
Positivity certificates and polynomial optimization on non-compact semialgebraic sets. Math. Program. 194(1): 443-485 (2022) - [j3]Ngoc Hoang Anh Mai
Exploiting Constant Trace Property in Large-scale Polynomial Optimization. ACM Trans. Math. Softw. 48(4): 40:1-40:39 (2022) - [j2]Jie Wang, Victor Magron, Jean B. Lasserre, Ngoc Hoang Anh Mai:
CS-TSSOS: Correlative and Term Sparsity for Large-Scale Polynomial Optimization. ACM Trans. Math. Softw. 48(4): 42:1-42:26 (2022) - [i4]Yoshio Ebihara, Hayato Waki, Victor Magron, Ngoc Hoang Anh Mai, Dimitri Peaucelle, Sophie Tarbouriech:
Stability Analysis of Recurrent Neural Networks by IQC with Copositive Mutipliers. CoRR abs/2202.04592 (2022) - [i3]Ngoc Hoang Anh Mai, Victor Magron, Jean-Bernard Lasserre, Kim-Chuan Toh:
Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant. CoRR abs/2209.06175 (2022) - 2021
- [j1]Yoshio Ebihara, Hayato Waki, Victor Magron, Ngoc Hoang Anh Mai, Dimitri Peaucelle
l2 induced norm analysis of discrete-time LTI systems for nonnegative input signals and its application to stability analysis of recurrent neural networks. Eur. J. Control 62: 99-104 (2021) - [c2]Yoshio Ebihara, Hayato Waki, Victor Magron, Ngoc Hoang Anh Mai, Dimitri Peaucelle
Stability Analysis of Recurrent Neural Networks by IQC with Copositive Mutipliers. CDC 2021: 5098-5103 - [c1]Ngoc Hoang Anh Mai, Abhishek Bhardwaj
The Constant Trace Property in Noncommutative Optimization. ISSAC 2021: 297-304 - [i2]Thi Lan Dinh, Ngoc Hoang Anh Mai:
Comparing different subgradient methods for solving convex optimization problems with functional constraints. CoRR abs/2101.01045 (2021) - 2020
- [i1]Jie Wang, Victor Magron, Jean B. Lasserre, Ngoc Hoang Anh Mai:
CS-TSSOS: Correlative and term sparsity for large-scale polynomial optimization. CoRR abs/2005.02828 (2020)
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 2024-05-08 21:02 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: