default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMing Yan 0006
Person information
- affiliation: Chinese University of Hong Kong-Shenzhen (CUHK-SZ), Shenzhen, China
- affiliation (former): Michigan State University, Department of Mathematical Sciences / Department of Computational Mathematics, Science and Engineering, East Lansing, MI, USA
- affiliation (PhD 2012): University of California Los Angeles, Department of Mathematics, CA, USA
Other persons with the same name
- Ming Yan — disambiguation page
- Ming Yan 0001 — University of California, San Diego, Center for Wireless Communication, CA, USA
- Ming Yan 0002 — Nanyang Technological University, School of Electrical and Electronic Engineering, Singapore
- Ming Yan 0003 — Northwest Institute of Nuclear Technology, Xi'an, China (and 1 more)
- Ming Yan 0004
![[0000-0002-6919-4689]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-6919-4689")
— Jinan University, Management School, Guangzhou, Chian (and 2 more) - Ming Yan 0005 — Communication University of China, Beijing, China
- Ming Yan 0007 — A*STAR, Centre for Frontier AI Research, Singapore (and 1 more)
Other persons with a similar name
- Yan Ming Cheng
- Yan-Ming Chiou
- Philex Ming-Yan Fan
- Yan-Ming Fu
- Yan-Ming Lai
- Tzung-Ming Yan
- Wen-Ming Yan
- Dong-Ming Yan 0001 (aka: Dongming Yan 0001) — Chinese Academy of Sciences, Institute of Automation, National Laboratory of Pattern Recognition (NLPR), Beijing, China (and 1 more)
- Yanming Zhang (aka: Yan-Ming Zhang) — disambiguation page
- Yan-Ming Zhang 0001 (aka: Yanming Zhang 0001) — Chinese Academy of Sciences, Institute of Automation, National Laboratory of Pattern Recognition, Beijing, China
- show all similar names
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Ming Yan, Yao Li:
On the Improved Conditions for Some Primal-Dual Algorithms. J. Sci. Comput. 99(3): 74 (2024)- [j28]Zhuoqing Song, Lei Shi, Shi Pu, Ming Yan:
Optimal gradient tracking for decentralized optimization. Math. Program. 207(1): 1-53 (2024) - [j27]Zhuoqing Song, Lei Shi, Shi Pu, Ming Yan:
Provably Accelerated Decentralized Gradient Methods Over Unbalanced Directed Graphs. SIAM J. Optim. 34(1): 1131-1156 (2024) - [i29]Weihong Guo, Yifei Lou, Jing Qin, Ming Yan:
Time-Varying Graph Signal Recovery Using High-Order Smoothness and Adaptive Low-rankness. CoRR abs/2405.09752 (2024) - 2023
- [j26]Mengqi Hu, Yifei Lou, Bao Wang, Ming Yan, Xiu Yang, Qiang Ye:
Accelerated Sparse Recovery via Gradient Descent with Nonlinear Conjugate Gradient Momentum. J. Sci. Comput. 95(1): 33 (2023) - 2022
- [j25]Zhi Li, Ming Yan, Tieyong Zeng, Guixu Zhang:
Phase retrieval from incomplete data via weighted nuclear norm minimization. Pattern Recognit. 125: 108537 (2022) - [j24]Zhuoqing Song, Lei Shi, Shi Pu, Ming Yan:
Compressed Gradient Tracking for Decentralized Optimization Over General Directed Networks. IEEE Trans. Signal Process. 70: 1775-1787 (2022) - [c14]Zhuoqing Song, Weijian Li, Kexin Jin, Lei Shi, Ming Yan, Wotao Yin, Kun Yuan:
Communication-Efficient Topologies for Decentralized Learning with $O(1)$ Consensus Rate. NeurIPS 2022 - [i28]Yao Li, Ming Yan:
On the improved conditions for some primal-dual algorithms. CoRR abs/2201.00139 (2022) - [i27]Zhuoqing Song, Weijian Li, Kexin Jin, Lei Shi, Ming Yan, Wotao Yin, Kun Yuan:
Communication-Efficient Topologies for Decentralized Learning with O(1) Consensus Rate. CoRR abs/2210.07881 (2022) - 2021
- [j23]Zhi Li, Ming Yan:
New convergence analysis of a primal-dual algorithm with large stepsizes. Adv. Comput. Math. 47(1): 9 (2021) - [j22]Yao Li, Ming Yan:
On the Linear Convergence of Two Decentralized Algorithms. J. Optim. Theory Appl. 189(1): 271-290 (2021) - [j21]Weihong Guo, Yifei Lou, Jing Qin, Ming Yan:
A Novel Regularization Based on the Error Function for Sparse Recovery. J. Sci. Comput. 87(1): 31 (2021) - [j20]Jun Liu, Ming Yan, Tieyong Zeng:
Surface-Aware Blind Image Deblurring. IEEE Trans. Pattern Anal. Mach. Intell. 43(3): 1041-1055 (2021) - [j19]Sulaiman A. Alghunaim, Qi Lyu, Ming Yan, Ali H. Sayed:
Dual Consensus Proximal Algorithm for Multi-Agent Sharing Problems. IEEE Trans. Signal Process. 69: 5568-5579 (2021) - [j18]Hassna Ouassal, Ming Yan, Jeffrey A. Nanzer:
Decentralized Frequency Alignment for Collaborative Beamforming in Distributed Phased Arrays. IEEE Trans. Wirel. Commun. 20(10): 6269-6281 (2021) - [c13]Xiaorui Liu, Yao Li, Rongrong Wang, Jiliang Tang, Ming Yan:
Linear Convergent Decentralized Optimization with Compression. ICLR 2021 - [c12]Xiaorui Liu, Wei Jin, Yao Ma, Yaxin Li, Hua Liu, Yiqi Wang, Ming Yan, Jiliang Tang:
Elastic Graph Neural Networks. ICML 2021: 6837-6849 - [c11]Hanlin Tang, Yao Li, Ji Liu, Ming Yan:
ErrorCompensatedX: error compensation for variance reduced algorithms. NeurIPS 2021: 18102-18113 - [i26]Zhuoqing Song, Lei Shi, Shi Pu, Ming Yan:
Compressed Gradient Tracking for Decentralized Optimization Over General Directed Networks. CoRR abs/2106.07243 (2021) - [i25]Xiaorui Liu, Wei Jin, Yao Ma, Yaxin Li, Hua Liu, Yiqi Wang, Ming Yan, Jiliang Tang:
Elastic Graph Neural Networks. CoRR abs/2107.06996 (2021) - [i24]Zhuoqing Song, Lei Shi, Shi Pu, Ming Yan:
Provably Accelerated Decentralized Gradient Method Over Unbalanced Directed Graphs. CoRR abs/2107.12065 (2021) - [i23]Hanlin Tang, Yao Li, Ji Liu, Ming Yan:
ErrorCompensatedX: error compensation for variance reduced algorithms. CoRR abs/2108.02102 (2021) - [i22]Yao Li, Xiaorui Liu, Jiliang Tang, Ming Yan, Kun Yuan:
Decentralized Composite Optimization with Compression. CoRR abs/2108.04448 (2021) - 2020
- [j17]Chao Wang, Ming Yan, Yaghoub Rahimi, Yifei Lou:
Accelerated Schemes for the $L_1/L_2$ Minimization. IEEE Trans. Signal Process. 68: 2660-2669 (2020) - [c10]Xiaorui Liu, Yao Li, Jiliang Tang, Ming Yan:
A Double Residual Compression Algorithm for Efficient Distributed Learning. AISTATS 2020: 133-143 - [c9]Sulaiman A. Alghunaim, Ming Yan, Ali H. Sayed:
A Multi-Agent Primal-Dual Strategy for Composite Optimization over Distributed Features. EUSIPCO 2020: 2095-2099 - [i21]Sulaiman A. Alghunaim, Ming Yan, Ali H. Sayed:
A Multi-Agent Primal-Dual Strategy for Composite Optimization over Distributed Features. CoRR abs/2006.08722 (2020) - [i20]Xiaorui Liu, Yao Li, Rongrong Wang, Jiliang Tang, Ming Yan:
Linear Convergent Decentralized Optimization with Compression. CoRR abs/2007.00232 (2020) - [i19]Weihong Guo, Yifei Lou, Jing Qin, Ming Yan:
A Novel Regularization Based on the Error Function for Sparse Recovery. CoRR abs/2007.02784 (2020) - [i18]Ningyu Sha, Lei Shi, Ming Yan:
Fast algorithms for robust principal component analysis with an upper bound on the rank. CoRR abs/2008.07972 (2020)
2010 – 2019
- 2019
- [j16]Yuning Hao, Ming Yan, Blake R. Heath, Yu L. Lei, Yuying Xie:
Fast and robust deconvolution of tumor infiltrating lymphocyte from expression profiles using least trimmed squares. PLoS Comput. Biol. 15(5) (2019) - [j15]Xiaolin Huang, Haiyan Yang, Yixing Huang, Lei Shi, Fan He, Andreas K. Maier, Ming Yan:
Robust mixed one-bit compressive sensing. Signal Process. 162: 161-168 (2019) - [j14]Zhi Li, Wei Shi, Ming Yan:
A Decentralized Proximal-Gradient Method With Network Independent Step-Sizes and Separated Convergence Rates. IEEE Trans. Signal Process. 67(17): 4494-4506 (2019) - [c8]Jun Liu, Ming Yan, Jinshan Zeng, Tieyong Zeng:
Image Smoothing Via Gradient Sparsity and Surface Area Minimization. ICIP 2019: 1114-1118 - [c7]He Lyu, Ningyu Sha, Shuyang Qin, Ming Yan, Yuying Xie, Rongrong Wang:
Manifold denoising by Nonlinear Robust Principal Component Analysis. NeurIPS 2019: 13390-13400 - [i17]Yao Li, Ming Yan:
On linear convergence of two decentralized algorithms. CoRR abs/1906.07225 (2019) - [i16]Xiaorui Liu, Yao Li, Jiliang Tang, Ming Yan:
A Double Residual Compression Algorithm for Efficient Distributed Learning. CoRR abs/1910.07561 (2019) - [i15]He Lyu, Ningyu Sha, Shuyang Qin, Ming Yan, Yuying Xie, Rongrong Wang:
Manifold Denoising by Nonlinear Robust Principal Component Analysis. CoRR abs/1911.03831 (2019) - 2018
- [j13]Xiaolin Huang, Lei Shi, Ming Yan, Johan A. K. Suykens:
Pinball loss minimization for one-bit compressive sensing: Convex models and algorithms. Neurocomputing 314: 275-283 (2018) - [j12]Yifei Lou, Ming Yan:
Fast L1-L2 Minimization via a Proximal Operator. J. Sci. Comput. 74(2): 767-785 (2018) - [j11]Ming Yan:
A New Primal-Dual Algorithm for Minimizing the Sum of Three Functions with a Linear Operator. J. Sci. Comput. 76(3): 1698-1717 (2018) - [j10]Xiaolin Huang, Ming Yan:
Nonconvex penalties with analytical solutions for one-bit compressive sensing. Signal Process. 144: 341-351 (2018) - [j9]Fan He, Xiaolin Huang, Yipeng Liu, Ming Yan:
Fast Signal Recovery From Saturated Measurements by Linear Loss and Nonconvex Penalties. IEEE Signal Process. Lett. 25(9): 1374-1378 (2018) - [c6]Hanlin Tang, Xiangru Lian, Ming Yan, Ce Zhang, Ji Liu:
D2: Decentralized Training over Decentralized Data. ICML 2018: 4855-4863 - [i14]Hanlin Tang, Xiangru Lian, Ming Yan, Ce Zhang, Ji Liu:
D2: Decentralized Training over Decentralized Data. CoRR abs/1803.07068 (2018) - [i13]Fan He, Xiaolin Huang, Yipeng Liu, Ming Yan:
Fast Signal Recovery from Saturated Measurements by Linear Loss and Nonconvex Penalties. CoRR abs/1809.09219 (2018) - 2017
- [c5]Qianqian Xu, Ming Yan, Chendi Huang, Jiechao Xiong, Qingming Huang, Yuan Yao:
Exploring Outliers in Crowdsourced Ranking for QoE. ACM Multimedia 2017: 1540-1548 - [i12]Xiaolin Huang, Yan Xia, Lei Shi, Yixing Huang, Ming Yan, Joachim Hornegger, Andreas K. Maier:
Mixed one-bit compressive sensing with applications to overexposure correction for CT reconstruction. CoRR abs/1701.00694 (2017) - [i11]Xiaolin Huang, Ming Yan:
Non-convex Penalties with Analytical Solutions for One-bit Compressive Sensing. CoRR abs/1706.01014 (2017) - [i10]Qianqian Xu, Ming Yan, Chendi Huang, Jiechao Xiong, Qingming Huang, Yuan Yao:
Exploring Outliers in Crowdsourced Ranking for QoE. CoRR abs/1707.07539 (2017) - 2016
- [j8]Hui Zhang, Ming Yan, Wotao Yin:
One condition for solution uniqueness and robustness of both l1-synthesis and l1-analysis minimizations. Adv. Comput. Math. 42(6): 1381-1399 (2016) - [j7]Fang Li, Stanley J. Osher, Jing Qin, Ming Yan:
A Multiphase Image Segmentation Based on Fuzzy Membership Functions and L1-Norm Fidelity. J. Sci. Comput. 69(1): 82-106 (2016) - [j6]Zhimin Peng, Yangyang Xu, Ming Yan, Wotao Yin:
ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates. SIAM J. Sci. Comput. 38(5) (2016) - [i9]Zhimin Peng, Tianyu Wu, Yangyang Xu, Ming Yan, Wotao Yin:
Coordinate Friendly Structures, Algorithms and Applications. CoRR abs/1601.00863 (2016) - [i8]Yifei Lou, Ming Yan:
Fast L1-L2 Minimization via a Proximal Operator. CoRR abs/1609.09530 (2016) - [i7]Zhimin Peng, Yangyang Xu, Ming Yan, Wotao Yin:
On the Convergence of Asynchronous Parallel Iteration with Arbitrary Delays. CoRR abs/1612.04425 (2016) - 2015
- [i6]Fang Li, Stanley J. Osher, Jing Qin, Ming Yan:
A Multiphase Image Segmentation Based on Fuzzy Membership Functions and L1-norm Fidelity. CoRR abs/1504.02206 (2015) - [i5]Xiaolin Huang, Lei Shi, Ming Yan, Johan A. K. Suykens:
Pinball Loss Minimization for One-bit Compressive Sensing. CoRR abs/1505.03898 (2015) - [i4]Zhimin Peng, Yangyang Xu, Ming Yan, Wotao Yin:
ARock: an Algorithmic Framework for Asynchronous Parallel Coordinate Updates. CoRR abs/1506.02396 (2015) - 2014
- [i3]Qianqian Xu, Ming Yan, Yuan Yao:
Fast Adaptive Least Trimmed Squares for Robust Evaluation of Quality of Experience. CoRR abs/1407.7636 (2014) - 2013
- [j5]Ming Yan:
Convergence analysis of SART: optimization and statistics. Int. J. Comput. Math. 90(1): 30-47 (2013) - [j4]Ming Yan, Yi Yang, Stanley J. Osher:
Exact Low-Rank Matrix Completion from Sparsely Corrupted Entries Via Adaptive Outlier Pursuit. J. Sci. Comput. 56(3): 433-449 (2013) - [j3]Ming Yan:
Restoration of Images Corrupted by Impulse Noise and Mixed Gaussian Impulse Noise Using Blind Inpainting. SIAM J. Imaging Sci. 6(3): 1227-1245 (2013) - [c4]Zhimin Peng, Ming Yan, Wotao Yin:
Parallel and distributed sparse optimization. ACSSC 2013: 659-646 - [i2]Ming Yan:
Restoration of Images Corrupted by Impulse Noise and Mixed Gaussian Impulse Noise using Blind Inpainting. CoRR abs/1304.1408 (2013) - [i1]Hui Zhang, Ming Yan, Wotao Yin:
One condition for all: solution uniqueness and robustness of ℓ1-synthesis and ℓ1-analysis minimizations. CoRR abs/1304.5038 (2013) - 2012
- [b1]Ming Yan:
Image and Signal Processing with Non-Gaussian Noise: EM-Type Algorithms and Adaptive Outlier Pursuit. University of California, Los Angeles, USA, 2012 - [j2]Jianwen Chen, Jason Cong, Luminita A. Vese, John D. Villasenor, Ming Yan, Yi Zou:
A Hybrid Architecture for Compressive Sensing 3-D CT Reconstruction. IEEE J. Emerg. Sel. Topics Circuits Syst. 2(3): 616-625 (2012) - [j1]Ming Yan, Yi Yang, Stanley J. Osher:
Robust 1-bit Compressive Sensing Using Adaptive Outlier Pursuit. IEEE Trans. Signal Process. 60(7): 3868-3875 (2012) - [c3]Jianwen Chen, Jason Cong, Ming Yan, Yi Zou:
FPGA-accelerated 3D reconstruction using compressive sensing. FPGA 2012: 163-166 - 2011
- [c2]Ming Yan, Jianwen Chen, Luminita A. Vese, John D. Villasenor, Alex A. T. Bui, Jason Cong:
EM+TV Based Reconstruction for Cone-Beam CT with Reduced Radiation. ISVC (1) 2011: 1-10 - [c1]Ming Yan:
EM-Type Algorithms for Image Reconstruction with Background Emission and Poisson Noise. ISVC (1) 2011: 33-42
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-12-10 21:44 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:
