default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPham Duy Khanh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Pham Duy Khanh, Boris S. Mordukhovich, Dat Ba Tran:
Inexact Reduced Gradient Methods in Nonconvex Optimization. J. Optim. Theory Appl. 203(3): 2138-2178 (2024)- [j16]Pham Duy Khanh, Boris S. Mordukhovich, Vo Thanh Phat, Dat Ba Tran
:
Globally convergent coderivative-based generalized Newton methods in nonsmooth optimization. Math. Program. 205(1): 373-429 (2024) - [j15]Pham Duy Khanh, V. V. H. Khoa, Boris S. Mordukhovich, Vo Thanh Phat:
Variational and Strong Variational Convexity in Infinite-Dimensional Variational Analysis. SIAM J. Optim. 34(3): 2756-2787 (2024) - 2023
- [j14]Pham Duy Khanh, Boris S. Mordukhovich, Vo Thanh Phat, Dat Ba Tran:
Generalized damped Newton algorithms in nonsmooth optimization via second-order subdifferentials. J. Glob. Optim. 86(1): 93-122 (2023) - [j13]Pham Duy Khanh, Boris S. Mordukhovich, Vo Thanh Phat:
A Generalized Newton Method for Subgradient Systems. Math. Oper. Res. 48(4): 1811-1845 (2023) - [j12]Pham Duy Khanh, Boris S. Mordukhovich, Vo Thanh Phat:
Variational Convexity of Functions and Variational Sufficiency in Optimization. SIAM J. Optim. 33(2): 1121-1158 (2023) - 2022
- [j11]Pham Duy Khanh, Bao Tran Nguyen:
Continuous Fréchet Differentiability of the Moreau Envelope of Convex Functions on Banach Spaces. J. Optim. Theory Appl. 195(3): 1007-1018 (2022) - 2020
- [j10]Bao Tran Nguyen, Pham Duy Khanh:
Faces and Support Functions for the Values of Maximal Monotone Operators. J. Optim. Theory Appl. 186(3): 843-863 (2020) - [j9]Pham Duy Khanh, Vo Thanh Phat:
Second-order characterizations of quasiconvexity and pseudoconvexity for differentiable functions with Lipschitzian derivatives. Optim. Lett. 14(8): 2413-2427 (2020)
2010 – 2019
- 2019
- [j8]Hoa T. Bui, Pham Duy Khanh, Thi Tu Trinh Tran:
Characterizations of Nonsmooth Robustly Quasiconvex Functions. J. Optim. Theory Appl. 180(3): 775-786 (2019) - 2018
- [j7]Pham Duy Khanh, Vo Thanh Phat:
Second-order characterizations of C1-smooth robustly quasiconvex functions. Oper. Res. Lett. 46(6): 568-572 (2018) - 2017
- [j6]Pham Duy Khanh, Jen-Chih Yao, Nguyen Dong Yen:
The Mordukhovich Subdifferentials and Directions of Descent. J. Optim. Theory Appl. 172(2): 518-534 (2017) - 2016
- [j5]Do Sang Kim, Phan Tu Vuong, Pham Duy Khanh:
Qualitative properties of strongly pseudomonotone variational inequalities. Optim. Lett. 10(8): 1669-1679 (2016) - [j4]Pham Duy Khanh, Marc Lassonde:
Quasiconvex Linear Perturbations and Convexity. Am. Math. Mon. 123(6): 605-608 (2016) - 2014
- [j3]Pham Duy Khanh, Phan Tu Vuong:
Modified projection method for strongly pseudomonotone variational inequalities. J. Glob. Optim. 58(2): 341-350 (2014) - [j2]Pham Duy Khanh:
On the Tikhonov regularization of affine pseudomonotone mappings. Optim. Lett. 8(4): 1325-1336 (2014) - 2013
- [j1]N. T. T. Huong, Pham Duy Khanh, Nguyen Dong Yen:
Multivalued Tikhonov Trajectories of General Affine Variational Inequalities. J. Optim. Theory Appl. 158(1): 85-96 (2013)
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-01-10 18:34 CET 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:
