default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMan-Chung Yue
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Manru Zong, Yin Tat Lee, Man-Chung Yue
:
Short-step methods are not strongly polynomial-time. Math. Program. 207(1): 733-746 (2024)- [j9]Wouter Jongeneel, Man-Chung Yue, Daniel Kuhn:
Small Errors in Random Zeroth-Order Optimization Are Imaginary. SIAM J. Optim. 34(3): 2638-2670 (2024) - [j8]Zhichun Yang, Fu-quan Xia, Kai Tu, Man-Chung Yue:
Variance Reduced Random Relaxed Projection Method for Constrained Finite-Sum Minimization Problems. IEEE Trans. Signal Process. 72: 2188-2203 (2024) - [i12]Man-Chung Yue, Yves Rychener, Daniel Kuhn, Viet Anh Nguyen:
A Geometric Unification of Distributionally Robust Covariance Estimators: Shrinking the Spectrum by Inflating the Ambiguity Set. CoRR abs/2405.20124 (2024) - 2023
- [i11]Ngoc Bui, Duy Nguyen, Man-Chung Yue, Viet Anh Nguyen:
Coverage-Validity-Aware Algorithmic Recourse. CoRR abs/2311.11349 (2023) - 2022
- [j7]Man-Chung Yue, Daniel Kuhn, Wolfram Wiesemann:
On linear optimization over Wasserstein balls. Math. Program. 195(1): 1107-1122 (2022) - [c10]Hieu Vu, Toan Tran, Man-Chung Yue, Viet Anh Nguyen:
Distributionally Robust Fair Principal Components via Geodesic Descents. ICLR 2022 - [c9]Yihang Gao, Man-Chung Yue, Michael Ng:
Approximate Secular Equations for the Cubic Regularization Subproblem. NeurIPS 2022 - [c8]Tuan-Duy H. Nguyen, Ngoc Bui, Duy Nguyen, Man-Chung Yue, Viet Anh Nguyen:
Robust Bayesian recourse. UAI 2022: 1498-1508 - [i10]Hieu Vu, Toan Tran, Man-Chung Yue, Viet Anh Nguyen:
Distributionally Robust Fair Principal Components via Geodesic Descents. CoRR abs/2202.03071 (2022) - [i9]Tuan-Duy H. Nguyen, Ngoc Bui, Duy Nguyen, Man-Chung Yue, Viet Anh Nguyen:
Robust Bayesian Recourse. CoRR abs/2206.10833 (2022) - [i8]Yihang Gao, Man-Chung Yue, Michael Kwok-Po Ng:
Approximate Secular Equations for the Cubic Regularization Subproblem. CoRR abs/2209.13268 (2022) - 2021
- [j6]Rujun Jiang, Man-Chung Yue, Zhishuo Zhou:
An accelerated first-order method with complexity analysis for solving cubic regularization subproblems. Comput. Optim. Appl. 79(2): 471-506 (2021) - [j5]Yin Tat Lee, Man-Chung Yue:
Universal Barrier Is n-Self-Concordant. Math. Oper. Res. 46(3): 1129-1148 (2021) - [c7]Bahar Taskesen, Man-Chung Yue, Jose H. Blanchet, Daniel Kuhn, Viet Anh Nguyen:
Sequential Domain Adaptation by Synthesizing Distributionally Robust Experts. ICML 2021: 10162-10172 - [i7]Bahar Taskesen, Man-Chung Yue, Jose H. Blanchet, Daniel Kuhn, Viet Anh Nguyen:
Sequential Domain Adaptation by Synthesizing Distributionally Robust Experts. CoRR abs/2106.00322 (2021) - 2020
- [c6]Zengde Deng, Man-Chung Yue, Anthony Man-Cho So:
An Efficient Augmented Lagrangian-Based Method for Linear Equality-Constrained Lasso. ICASSP 2020: 5760-5764 - [c5]Ho-Cheung Ng, Shuanglong Liu, Izaak Coleman, Ringo S. W. Chu, Man-Chung Yue, Wayne Luk:
Acceleration of Short Read Alignment with Runtime Reconfiguration. FPT 2020: 256-262 - [i6]Man-Chung Yue, Daniel Kuhn, Wolfram Wiesemann:
On Linear Optimization over Wasserstein Balls. CoRR abs/2004.07162 (2020) - [i5]Huikang Liu, Man-Chung Yue, Anthony Man-Cho So:
A Unified Approach to Synchronization Problems over Subgroups of the Orthogonal Group. CoRR abs/2009.07514 (2020)
2010 – 2019
- 2019
- [j4]Man-Chung Yue, Zirui Zhou, Anthony Man-Cho So:
A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property. Math. Program. 174(1-2): 327-358 (2019) - [j3]Man-Chung Yue, Zirui Zhou, Anthony Man-Cho So:
On the Quadratic Convergence of the Cubic Regularization Method under a Local Error Bound Condition. SIAM J. Optim. 29(1): 904-932 (2019) - [c4]Viet Anh Nguyen, Soroosh Shafieezadeh-Abadeh, Man-Chung Yue, Daniel Kuhn, Wolfram Wiesemann:
Calculating Optimistic Likelihoods Using (Geodesically) Convex Optimization. NeurIPS 2019: 13920-13931 - [c3]Viet Anh Nguyen, Soroosh Shafieezadeh-Abadeh, Man-Chung Yue, Daniel Kuhn, Wolfram Wiesemann:
Optimistic Distributionally Robust Optimization for Nonparametric Likelihood Approximation. NeurIPS 2019: 15846-15856 - [i4]Viet Anh Nguyen, Soroosh Shafieezadeh-Abadeh, Man-Chung Yue, Daniel Kuhn, Wolfram Wiesemann:
Calculating Optimistic Likelihoods Using (Geodesically) Convex Optimization. CoRR abs/1910.07817 (2019) - [i3]Viet Anh Nguyen, Soroosh Shafieezadeh-Abadeh, Man-Chung Yue, Daniel Kuhn, Wolfram Wiesemann:
Optimistic Distributionally Robust Optimization for Nonparametric Likelihood Approximation. CoRR abs/1910.10583 (2019) - 2017
- [j2]Huikang Liu, Man-Chung Yue, Anthony Man-Cho So:
On the Estimation Performance and Convergence Rate of the Generalized Power Method for Phase Synchronization. SIAM J. Optim. 27(4): 2426-2446 (2017) - [c2]Sissi Xiaoxiao Wu, Man-Chung Yue, Anthony Man-Cho So, Wing-Kin Ma:
SDR approximation bounds for the robust multicast beamforming problem with interference temperature constraints. ICASSP 2017: 4054-4058 - [c1]Huikang Liu, Man-Chung Yue, Anthony Man-Cho So, Wing-Kin Ma:
A discrete first-order method for large-scale MIMO detection with provable guarantees. SPAWC 2017: 1-5 - 2016
- [j1]Man-Chung Yue, Sissi Xiaoxiao Wu, Anthony Man-Cho So:
A Robust Design for MISO Physical-Layer Multicasting Over Line-of-Sight Channels. IEEE Signal Process. Lett. 23(7): 939-943 (2016) - 2015
- [i2]Man-Chung Yue, Sissi Xiaoxiao Wu, Anthony Man-Cho So:
A Robust Design for MISO Physical-Layer Multicasting over Line-of-Sight Channels. CoRR abs/1511.04244 (2015) - 2012
- [i1]Man-Chung Yue, Anthony Man-Cho So:
A Perturbation Inequality for the Schatten-$p$ Quasi-Norm and Its Applications to Low-Rank Matrix Recovery. CoRR abs/1209.0377 (2012)
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-21 00:22 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:
