| Projection Robust Wasserstein Barycenters | 0 | 0.34 | 2021 |
| A Riemannian Block Coordinate Descent Method For Computing The Projection Robust Wasserstein Distance | 0 | 0.34 | 2021 |
| A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization. | 0 | 0.34 | 2020 |
| Accelerated Dual-Averaging Primal-Dual Method for Composite Convex Minimization | 0 | 0.34 | 2020 |
| Structured Nonconvex and Nonsmooth Optimization: Algorithms and Iteration Complexity Analysis. | 12 | 0.52 | 2019 |
| Manifold Proximal Point Algorithms for Dual Principal Component Pursuit and Orthogonal Dictionary Learning | 0 | 0.34 | 2019 |
| On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming | 0 | 0.34 | 2019 |
| An Alternating Manifold Proximal Gradient Method for Sparse PCA and Sparse CCA. | 0 | 0.34 | 2019 |
| Stochastic Primal-Dual Method for Empirical Risk Minimization with O(1) Per-Iteration Complexity. | 0 | 0.34 | 2018 |
| Distributed Linearized Alternating Direction Method of Multipliers for Composite Convex Consensus Optimization | 23 | 0.75 | 2018 |
| ADMM for High-Dimensional Sparse Penalized Quantile Regression. | 2 | 0.38 | 2018 |
| Low-M-Rank Tensor Completion and Robust Tensor PCA. | 2 | 0.37 | 2018 |
| Efficient Optimization Algorithms for Robust Principal Component Analysis and Its Variants. | 4 | 0.38 | 2018 |
| Highly Accurate Model For Prediction Of Lung Nodule Malignancy With Ct Scans | 5 | 0.63 | 2018 |
| Geometric Descent Method for Convex Composite Minimization | 0 | 0.34 | 2017 |
| PENALTY METHODS WITH STOCHASTIC APPROXIMATION FOR STOCHASTIC NONLINEAR PROGRAMMING | 1 | 0.36 | 2017 |
| Adaptive Proximal Average Approximation for Composite Convex Minimization. | 1 | 0.35 | 2017 |
| An Extragradient-Based Alternating Direction Method for Convex Minimization | 12 | 0.71 | 2017 |
| GSOS: Gauss-Seidel Operator Splitting Algorithm for Multi-Term Nonsmooth Convex Composite Optimization. | 0 | 0.34 | 2017 |
| Iteration Complexity Analysis of Multi-Block ADMM for a Family of Convex Minimization without Strong Convexity | 12 | 0.54 | 2016 |
| Barzilai-Borwein Step Size for Stochastic Gradient Descent. | 11 | 0.53 | 2016 |
| A smoothing SQP framework for a class of composite $$L_q$$Lq minimization over polyhedron | 1 | 0.35 | 2016 |
| Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization | 13 | 0.54 | 2016 |
| Alternating Proximal Gradient Method for Convex Minimization | 7 | 0.58 | 2016 |
| Sparse Subspace Clustering for Incomplete Images | 0 | 0.34 | 2015 |
| Global Convergence of Unmodified 3-Block ADMM for a Class of Convex Minimization Problems | 11 | 0.54 | 2015 |
| An Alternating Direction Method for Total Variation Denoising | 13 | 0.57 | 2015 |
| Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization | 15 | 0.59 | 2015 |
| Low-Rank Similarity Metric Learning In High Dimensions | 13 | 0.52 | 2015 |
| A General Inertial Proximal Point Algorithm for Mixed Variational Inequality Problem. | 2 | 0.36 | 2015 |
| On the Global Linear Convergence of the ADMM with MultiBlock Variables. | 39 | 1.07 | 2015 |
| Tensor principal component analysis via convex optimization. | 16 | 0.81 | 2015 |
| A block coordinate descent method of multipliers: Convergence analysis and applications | 4 | 0.42 | 2014 |
| Efficient algorithms for robust and stable principal component pursuit problems. | 10 | 0.62 | 2014 |
| SOLVING MULTIPLE-BLOCK SEPARABLE CONVEX MINIMIZATION PROBLEMS USING TWO-BLOCK ALTERNATING DIRECTION METHOD OF MULTIPLIERS | 27 | 1.09 | 2013 |
| Joint Power and Admission Control: Non-Convex $L_q$ Approximation and An Effective Polynomial Time Deflation Approach | 8 | 0.47 | 2013 |
| Alternating direction methods for latent variable gaussian graphical model selection. | 25 | 1.16 | 2013 |
| Fast alternating linearization methods for minimizing the sum of two convex functions. | 79 | 3.68 | 2013 |
| Fast Multiple-Splitting Algorithms for Convex Optimization. | 35 | 2.32 | 2012 |
| Accelerated Linearized Bregman Method | 10 | 0.70 | 2011 |
| Sparse Inverse Covariance Selection via Alternating Linearization Methods | 54 | 4.01 | 2010 |
| Semi-supervised sparse metric learning using alternating linearization optimization | 36 | 1.28 | 2010 |
| Fixed point and Bregman iterative methods for matrix rank minimization | 384 | 21.36 | 2009 |
| Convergence of Fixed-Point Continuation Algorithms for Matrix Rank Minimization | 49 | 4.39 | 2009 |
| A fast subspace method for image deblurring | 3 | 0.69 | 2009 |
| An efficient algorithm for compressed MR imaging using total variation and wavelets | 129 | 6.10 | 2008 |
