default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLe Thi Khanh Hien
2020 – today
- 2024
[j16]Le Thi Khanh Hien
, Dimitri Papadimitriou:
An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints. J. Glob. Optim. 89(4): 927-948 (2024)- [j15]Le Thi Khanh Hien, Renbo Zhao, William B. Haskell:
An Inexact Primal-Dual Smoothing Framework for Large-Scale Non-Bilinear Saddle Point Problems. J. Optim. Theory Appl. 200(1): 34-67 (2024) - [j14]Valentin Leplat, Le Thi Khanh Hien, Akwum Onwunta, Nicolas Gillis:
Deep Nonnegative Matrix Factorization With Beta Divergences. Neural Comput. 36(11): 2365-2402 (2024) - [j13]Le Thi Khanh Hien, Sukanya Patra, Souhaib Ben Taieb:
Anomaly detection with semi-supervised classification based on risk estimators. Trans. Mach. Learn. Res. 2024 (2024) - [i11]Le Thi Khanh Hien, Valentin Leplat, Nicolas Gillis:
Block Majorization Minimization with Extrapolation and Application to β-NMF. CoRR abs/2401.06646 (2024) - 2023
- [j12]Le Thi Khanh Hien, Duy Nhat Phan, Nicolas Gillis:
An Inertial Block Majorization Minimization Framework for Nonsmooth Nonconvex Optimization. J. Mach. Learn. Res. 24: 18:1-18:41 (2023) - [c4]Sukanya Patra, Le Thi Khanh Hien, Souhaib Ben Taieb:
Anomaly detection in irregular image sequences for concentrated solar power plants. ESANN 2023 - [i10]Le Thi Khanh Hien, Sukanya Patra, Souhaib Ben Taieb:
Anomaly detection with semi-supervised classification based on risk estimators. CoRR abs/2309.00379 (2023) - [i9]Valentin Leplat, Le Thi Khanh Hien, Akwum Onwunta, Nicolas Gillis:
Deep Nonnegative Matrix Factorization with Beta Divergences. CoRR abs/2309.08249 (2023) - 2022
- [j11]Le Thi Khanh Hien, Duy Nhat Phan, Nicolas Gillis:
Inertial alternating direction method of multipliers for non-convex non-smooth optimization. Comput. Optim. Appl. 83(1): 247-285 (2022) - [j10]Nicolas Gillis, Le Thi Khanh Hien, Valentin Leplat, Vincent Y. F. Tan:
Distributionally Robust and Multi-Objective Nonnegative Matrix Factorization. IEEE Trans. Pattern Anal. Mach. Intell. 44(8): 4052-4064 (2022) - [j9]Le Thi Khanh Hien, Duy Nhat Phan, Nicolas Gillis, Masoud Ahookhosh, Panagiotis Patrinos:
Block Bregman Majorization Minimization with Extrapolation. SIAM J. Math. Data Sci. 4(1): 1-25 (2022) - [i8]Le Thi Khanh Hien, Dimitri Papadimitriou:
Multiblock ADMM for nonsmooth nonconvex optimization with nonlinear coupling constraints. CoRR abs/2201.07657 (2022) - 2021
- [j8]Masoud Ahookhosh, Le Thi Khanh Hien, Nicolas Gillis, Panagiotis Patrinos:
Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization. Comput. Optim. Appl. 79(3): 681-715 (2021) - [j7]Masoud Ahookhosh, Le Thi Khanh Hien, Nicolas Gillis, Panagiotis Patrinos:
A Block Inertial Bregman Proximal Algorithm for Nonsmooth Nonconvex Problems with Application to Symmetric Nonnegative Matrix Tri-Factorization. J. Optim. Theory Appl. 190(1): 234-258 (2021) - [j6]Le Thi Khanh Hien, Nicolas Gillis:
Algorithms for Nonnegative Matrix Factorization with the Kullback-Leibler Divergence. J. Sci. Comput. 87(3): 93 (2021) - [j5]Andersen Man Shun Ang, Jeremy E. Cohen, Nicolas Gillis, Le Thi Khanh Hien:
Accelerating block coordinate descent for nonnegative tensor factorization. Numer. Linear Algebra Appl. 28(5) (2021) - [c3]Olivier Vu Thanh, Andersen Man Shun Ang, Nicolas Gillis, Le Thi Khanh Hien:
Inertial Majorization-Minimization Algorithm for Minimum-Volume NMF. EUSIPCO 2021: 1065-1069 - [i7]Le Thi Khanh Hien, Duy Nhat Phan, Nicolas Gillis:
A Framework of Inertial Alternating Direction Method of Multipliers for Non-Convex Non-Smooth Optimization. CoRR abs/2102.05433 (2021) - [i6]Le Thi Khanh Hien, Duy Nhat Phan, Nicolas Gillis, Masoud Ahookhosh, Panagiotis Patrinos:
Block Alternating Bregman Majorization Minimization with Extrapolation. CoRR abs/2107.04395 (2021) - 2020
- [j4]Le Thi Khanh Hien, Melvyn Sim, Huan Xu:
Mitigating Interdiction Risk with Fortification. Oper. Res. 68(2): 348-362 (2020) - [c2]Andersen Man Shun Ang, Jeremy E. Cohen, Le Thi Khanh Hien, Nicolas Gillis:
Extrapolated Alternating Algorithms for Approximate Canonical Polyadic Decomposition. ICASSP 2020: 3147-3151 - [i5]Andersen Man Shun Ang, Jeremy E. Cohen, Nicolas Gillis, Le Thi Khanh Hien:
Accelerating Block Coordinate Descent for Nonnegative Tensor Factorization. CoRR abs/2001.04321 (2020) - [i4]Le Thi Khanh Hien, Nicolas Gillis:
Algorithms for Nonnegative Matrix Factorization with the Kullback-Leibler Divergence. CoRR abs/2010.01935 (2020) - [i3]Le Thi Khanh Hien, Duy Nhat Phan, Nicolas Gillis:
An Inertial Block Majorization Minimization Framework for Nonsmooth Nonconvex Optimization. CoRR abs/2010.12133 (2020)
2010 – 2019
- 2019
- [j3]Le Thi Khanh Hien, Cuong V. Nguyen, Huan Xu, Canyi Lu, Jiashi Feng:
Accelerated Randomized Mirror Descent Algorithms for Composite Non-strongly Convex Optimization. J. Optim. Theory Appl. 181(2): 541-566 (2019) - [i2]Nicolas Gillis, Le Thi Khanh Hien, Valentin Leplat, Vincent Y. F. Tan:
Distributionally Robust and Multi-Objective Nonnegative Matrix Factorization. CoRR abs/1901.10757 (2019) - [i1]Masoud Ahookhosh, Le Thi Khanh Hien, Nicolas Gillis, Panagiotis Patrinos:
Multi-block Bregman proximal alternating linearized minimization and its application to sparse orthogonal nonnegative matrix factorization. CoRR abs/1908.01402 (2019) - 2017
- [c1]Le Thi Khanh Hien, William B. Haskell:
Sequential smoothing framework for convex-concave saddle point problems with application to large-scale constrained optimization. Allerton 2017: 1176-1183 - 2015
- [j2]Le Thi Khanh Hien:
Differential properties of Euclidean projection onto power cone. Math. Methods Oper. Res. 82(3): 265-284 (2015) - [j1]Chek Beng Chua, L. T. K. Hien:
A Superlinearly Convergent Smoothing Newton Continuation Algorithm for Variational Inequalities over Definable Sets. SIAM J. Optim. 25(2): 1034-1063 (2015)
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.
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.
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.
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-20 22:59 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:
