Year |
Citation |
Score |
2020 |
Hong M, Chang T, Wang X, Razaviyayn M, Ma S, Luo Z. A Block Successive Upper Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization Mathematics of Operations Research. 45: 833-861. DOI: 10.1287/Moor.2019.1010 |
0.497 |
|
2020 |
Chen S, Ma S, Xue L, Zou H. An Alternating Manifold Proximal Gradient Method for Sparse Principal Component Analysis and Sparse Canonical Correlation Analysis Informs Journal On Optimization. 2: 192-208. DOI: 10.1287/ijoo.2019.0032 |
0.472 |
|
2020 |
Chen S, Ma S, So AM, Zhang T. Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold Siam Journal On Optimization. 30: 210-239. DOI: 10.1137/18M122457X |
0.469 |
|
2020 |
Tan C, Qian Y, Ma S, Zhang T. Accelerated dual-averaging primal–dual method for composite convex minimization Optimization Methods & Software. 35: 741-766. DOI: 10.1080/10556788.2020.1713779 |
0.352 |
|
2020 |
Ma S, Wang F, Wei L, Wolkowicz H. Robust Principal Component Analysis using Facial Reduction Optimization and Engineering. 21: 1195-1219. DOI: 10.1007/S11081-019-09476-9 |
0.534 |
|
2019 |
Liu Y, Liu X, Ma S. On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming Mathematics of Operations Research. 44: 632-650. DOI: 10.1287/Moor.2018.0939 |
0.44 |
|
2019 |
Jiang B, Lin T, Ma S, Zhang S. Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis Computational Optimization and Applications. 72: 115-157. DOI: 10.1007/S10589-018-0034-Y |
0.565 |
|
2019 |
Zhang J, Ma S, Zhang S. Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis Mathematical Programming. 1-46. DOI: 10.1007/S10107-019-01418-8 |
0.562 |
|
2018 |
Aybat NS, Wang Z, Lin T, Ma S. Distributed Linearized Alternating Direction Method of Multipliers for Composite Convex Consensus Optimization Ieee Transactions On Automatic Control. 63: 5-20. DOI: 10.1109/Tac.2017.2713046 |
0.35 |
|
2018 |
Jiang B, Ma S, Zhang S. Low-M-Rank Tensor Completion and Robust Tensor PCA Ieee Journal of Selected Topics in Signal Processing. 12: 1390-1404. DOI: 10.1109/Jstsp.2018.2873144 |
0.327 |
|
2018 |
Ma S, Aybat NS. Efficient Optimization Algorithms for Robust Principal Component Analysis and Its Variants Proceedings of the Ieee. 106: 1411-1426. DOI: 10.1109/JPROC.2018.2846606 |
0.325 |
|
2018 |
Gu Y, Fan J, Kong L, Ma S, Zou H. ADMM for High-Dimensional Sparse Penalized Quantile Regression Technometrics. 60: 319-331. DOI: 10.1080/00401706.2017.1345703 |
0.447 |
|
2018 |
Lin T, Ma S, Zhang S. Global Convergence of Unmodified 3-Block ADMM for a Class of Convex Minimization Problems Journal of Scientific Computing. 76: 69-88. DOI: 10.1007/S10915-017-0612-7 |
0.509 |
|
2017 |
Wang X, Ma S, Goldfarb D, Liu W. Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization Siam Journal On Optimization. 27: 927-956. DOI: 10.1137/15M1053141 |
0.586 |
|
2016 |
Jiang B, Ma S, Causey J, Qiao L, Hardin MP, Bitts I, Johnson D, Zhang S, Huang X. SparRec: An effective matrix completion framework of missing data imputation for GWAS. Scientific Reports. 6: 35534. PMID 27762341 DOI: 10.1038/Srep35534 |
0.379 |
|
2016 |
Wang X, Ma S, Yuan Y. Penalty methods with stochastic approximation for stochastic nonlinear programming Ieee Communications Magazine. 86: 1793-1820. DOI: 10.1090/Mcom/3178 |
0.484 |
|
2016 |
Ma S, Yang J. Applications of gauge duality in robust principal component analysis and semidefinite programming Science China-Mathematics. 59: 1579-1592. DOI: 10.1007/S11425-016-0312-1 |
0.485 |
|
2016 |
Lin T, Ma S, Zhang S. Iteration Complexity Analysis of Multi-block ADMM for a Family of Convex Minimization Without Strong Convexity Journal of Scientific Computing. 1-30. DOI: 10.1007/S10915-016-0182-0 |
0.507 |
|
2015 |
Chen C, Chan RH, Ma S, Yang J. Inertial proximal admm for linearly constrained separable convex optimization Siam Journal On Imaging Sciences. 8: 2239-2267. DOI: 10.1137/15100463X |
0.535 |
|
2015 |
Chen C, Ma S, Yang J. A general inertial proximal point algorithm for mixed variational inequality problem Siam Journal On Optimization. 25: 2120-2142. DOI: 10.1137/140980910 |
0.558 |
|
2015 |
Lin T, Ma S, Zhang S. On the Global Linear Convergence of the ADMM with MultiBlock Variables Siam Journal On Optimization. 25: 1478-1497. DOI: 10.1137/140971178 |
0.454 |
|
2015 |
Liu YF, Dai YH, Ma S. Joint power and admission control: Non-Convex Lq approximation and an effective polynomial time deflation approach Ieee Transactions On Signal Processing. 63: 3681-3696. DOI: 10.1109/Tsp.2015.2428224 |
0.443 |
|
2015 |
Qin ZT, Goldfarb D, Ma S. An alternating direction method for total variation denoising Optimization Methods & Software. 30: 594-615. DOI: 10.1080/10556788.2014.955100 |
0.712 |
|
2015 |
Ma S. Alternating Proximal Gradient Method for Convex Minimization Journal of Scientific Computing. 1-27. DOI: 10.1007/S10915-015-0150-0 |
0.543 |
|
2015 |
Lin T, Ma S, Zhang S. An Extragradient-Based Alternating Direction Method for Convex Minimization Foundations of Computational Mathematics. DOI: 10.1007/S10208-015-9282-8 |
0.541 |
|
2015 |
Liu YF, Ma S, Dai YH, Zhang S. A smoothing SQP framework for a class of composite Lq minimization over polyhedron Mathematical Programming. DOI: 10.1007/S10107-015-0939-5 |
0.488 |
|
2015 |
Jiang B, Ma S, Zhang S. Tensor principal component analysis via convex optimization Mathematical Programming. 150: 423-457. DOI: 10.1007/S10107-014-0774-0 |
0.538 |
|
2014 |
Hong M, Chang TH, Wang X, Razaviyayn M, Ma S, Luo ZQ. A block coordinate descent method of multipliers: Convergence analysis and applications Icassp, Ieee International Conference On Acoustics, Speech and Signal Processing - Proceedings. 7689-7693. DOI: 10.1109/ICASSP.2014.6855096 |
0.505 |
|
2014 |
Jiang B, Ma S, Zhang S. Alternating direction method of multipliers for real and complex polynomial optimization models Optimization. 63: 883-898. DOI: 10.1080/02331934.2014.895901 |
0.534 |
|
2014 |
Aybat NS, Goldfarb D, Ma S. Efficient algorithms for robust and stable principal component pursuit problems Computational Optimization and Applications. 58: 1-29. DOI: 10.1007/S10589-013-9613-0 |
0.666 |
|
2013 |
Ma S, Xue L, Zou H. Alternating direction methods for latent variable gaussian graphical model selection. Neural Computation. 25: 2172-98. PMID 23607561 DOI: 10.1162/Neco_A_00379 |
0.566 |
|
2013 |
Ma S. Alternating Direction Method of Multipliers for Sparse Principal Component Analysis Journal of the Operations Research Society of China. 1: 253-274. DOI: 10.1007/S40305-013-0016-9 |
0.523 |
|
2013 |
Huang B, Ma S, Goldfarb D. Accelerated Linearized Bregman Method Journal of Scientific Computing. 54: 428-453. DOI: 10.1007/S10915-012-9592-9 |
0.704 |
|
2013 |
Goldfarb D, Ma S, Scheinberg K. Fast alternating linearization methods for minimizing the sum of two convex functions Mathematical Programming. 141: 349-382. DOI: 10.1007/S10107-012-0530-2 |
0.66 |
|
2012 |
Goldfarb D, Ma S. Fast Multiple-Splitting Algorithms for Convex Optimization Siam Journal On Optimization. 22: 533-556. DOI: 10.1137/090780705 |
0.653 |
|
2012 |
Xue L, Ma S, Zou H. Positive-Definite ℓ1-Penalized Estimation of Large Covariance Matrices Journal of the American Statistical Association. 107: 1480-1491. DOI: 10.1080/01621459.2012.725386 |
0.339 |
|
2011 |
Goldfarb D, Ma S. Convergence of Fixed-Point Continuation Algorithms for Matrix Rank Minimization Foundations of Computational Mathematics. 11: 183-210. DOI: 10.1007/S10208-011-9084-6 |
0.682 |
|
2011 |
Ma S, Goldfarb D, Chen L. Fixed point and Bregman iterative methods for matrix rank minimization Mathematical Programming. 128: 321-353. DOI: 10.1007/S10107-009-0306-5 |
0.718 |
|
2009 |
Wang Y, Ma S. A fast subspace method for image deblurring Applied Mathematics and Computation. 215: 2359-2377. DOI: 10.1016/J.Amc.2009.08.033 |
0.472 |
|
2009 |
Wang Y, Ma S, Yang H, Wang J, Li X. On the effective inversion by imposing a priori information for retrieval of land surface parameters Science in China Series D: Earth Sciences. 52: 540-549. DOI: 10.1007/S11430-009-0036-9 |
0.449 |
|
2004 |
Ma SM. A fast algorithm for curve singularities Bulletin of the Australian Mathematical Society. 69: 403-414. |
0.306 |
|
Show low-probability matches. |