default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTien Son Pham
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Minh Tùng Nguyen, Tien-Son Pham:
Clarke's Tangent Cones, Subgradients, Optimality Conditions, and the Lipschitzness at Infinity. SIAM J. Optim. 34(2): 1732-1754 (2024)- 2023
- [j16]Feng Guo, Liguo Jiao, Do Sang Kim, Tien-Son Pham:
On Types of Isolated KKT Points in Polynomial Optimization. J. Syst. Sci. Complex. 36(5): 2186-2213 (2023) - [j15]Tien-Son Pham
:
Tangencies and polynomial optimization. Math. Program. 199(1): 1239-1272 (2023) - 2022
- [j14]Bui Van Dinh, Tien-Son Pham:
Error Bounds of Regularized Gap Functions for Polynomial Variational Inequalities. J. Optim. Theory Appl. 192(1): 226-247 (2022) - [j13]Jae-Hyoung Lee, Tien-Son Pham:
Openness, Hölder Metric Regularity, and Hölder Continuity Properties of Semialgebraic Set-Valued Maps. SIAM J. Optim. 32(1): 56-74 (2022) - 2021
- [j12]Do Sang Kim, Boris S. Mordukhovich, Tien Son Pham, Nguyen Van Tuyen:
Existence of efficient and properly efficient solutions to problems of constrained vector optimization. Math. Program. 190(1): 259-283 (2021) - 2020
- [j11]Feng Guo, Tien-Son Pham:
On types of degenerate critical points of real polynomial functions. J. Symb. Comput. 99: 108-126 (2020) - [j10]Tien-Son Pham:
Local Minimizers of Semi-Algebraic Functions from the Viewpoint of Tangencies. SIAM J. Optim. 30(3): 1777-1794 (2020)
2010 – 2019
- 2019
- [j9]Tien-Son Pham:
Optimality Conditions for Minimizers at Infinity in Polynomial Programming. Math. Oper. Res. 44(4): 1381-1395 (2019) - [j8]Do Sang Kim, Tien Son Pham, Nguyen Van Tuyen:
On the existence of Pareto solutions for polynomial vector optimization problems. Math. Program. 177(1-2): 321-341 (2019) - 2018
- [j7]Jae-Hyoung Lee, Gue Myung Lee, Tien Son Pham:
Genericity and Hölder Stability in Semi-Algebraic Variational Inequalities. J. Optim. Theory Appl. 178(1): 56-77 (2018) - 2017
- [j6]Si Tiep Dinh, Tien Son Pham:
Łojasiewicz inequalities with explicit exponents for smallest singular value functions. J. Complex. 41: 58-71 (2017) - [j5]Gue Myung Lee, Tien Son Pham:
Generic Properties for Semialgebraic Programs. SIAM J. Optim. 27(3): 2061-2084 (2017) - 2016
- [j4]Gue Myung Lee, Tien Son Pham:
Stability and Genericity for Semi-algebraic Compact Programs. J. Optim. Theory Appl. 169(2): 473-495 (2016) - [j3]Roxana Heß, Didier Henrion, Jean-Bernard Lasserre, Tien Son Pham:
Semidefinite Approximations of the Polynomial Abscissa. SIAM J. Control. Optim. 54(3): 1633-1656 (2016) - [j2]Van Doat Dang, Huy Vui Ha, Tien Son Pham:
Well-Posedness in Unconstrained Polynomial Optimization Problems. SIAM J. Optim. 26(3): 1411-1428 (2016) - 2014
- [j1]Si Tiep Dinh, Huy Vui Ha, Tien Son Pham:
A Frank-Wolfe type theorem for nondegenerate polynomial programs. Math. Program. 147(1-2): 519-538 (2014)
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-06-11 21:44 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:
