An Alternating Direction Algorithm for Matrix Completion with Nonnegative Factors - Yangyang Xu 005; Wotao Yin; Zaiwen Wen; Yin Zhang 010 (CoRR, 2011)

Decentralized low-rank matrix completion. - Qing Ling 001; Yangyang Xu 005; Wotao Yin; Zaiwen Wen (ICASSP, 2012)

Parallel matrix factorization for low-rank tensor completion. - Yangyang Xu 005; Ruru Hao; Wotao Yin; Zhixun Su (CoRR, 2013)

A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion. - Yangyang Xu 005; Wotao Yin (SIAM J. Imaging Sci., 2013)

Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed 퓁q Minimization. - Ming-Jun Lai; Yangyang Xu 005; Wotao Yin (SIAM J. Numer. Anal., 2013)

A fast patch-dictionary method for whole image recovery. - Yangyang Xu 005; Wotao Yin (CoRR, 2014)

Local-Structure Adaptive Sparse Subspace Learning: An Iterative Approach to Unsupervised Feature Selection. - Nan Zhou 010; Yangyang Xu 005; Hong Cheng 002; Jun Fang 001; Witold Pedrycz (CoRR, 2015)

Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization. - Yangyang Xu 005; Wotao Yin (SIAM J. Optim., 2015)

Coordinate Friendly Structures, Algorithms and Applications. - Zhimin Peng; Tianyu Wu; Yangyang Xu 005; Ming Yan 006; Wotao Yin (CoRR, 2016)

On the Convergence of Asynchronous Parallel Iteration with Arbitrary Delays. - Zhimin Peng; Yangyang Xu 005; Ming Yan 006; Wotao Yin (CoRR, 2016)

Global and local structure preserving sparse subspace learning: An iterative approach to unsupervised feature selection. - Nan Zhou 010; Yangyang Xu 005; Hong Cheng 002; Jun Fang 001; Witold Pedrycz (Pattern Recognit., 2016)

ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates. - Zhimin Peng; Yangyang Xu 005; Ming Yan 006; Wotao Yin (SIAM J. Sci. Comput., 2016)

A Globally Convergent Algorithm for Nonconvex Optimization Based on Block Coordinate Update. - Yangyang Xu 005; Wotao Yin (J. Sci. Comput., 2017)

Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs. - Yangyang Xu 005 (Comput. Optim. Appl., 2019)

Maximum Correntropy Criterion-Based Sparse Subspace Learning for Unsupervised Feature Selection. - Nan Zhou 010; Yangyang Xu 005; Hong Cheng 002; Zejian Yuan; Badong Chen (IEEE Trans. Circuits Syst. Video Technol., 2019)

Markov chain block coordinate descent. - Tao Sun 005; Yuejiao Sun; Yangyang Xu 005; Wotao Yin (Comput. Optim. Appl., 2020)

Asynchronous parallel adaptive stochastic gradient methods. - Yangyang Xu 005; Colin Sutcher-Shepard; Yibo Xu; Jie Chen 007 (CoRR, 2020)

Maximum Correntropy Criterion-Based Robust Semisupervised Concept Factorization for Image Representation. - Nan Zhou 010; Badong Chen; Yuanhua Du; Tao Jiang 014; Jun Liu 046; Yangyang Xu 005 (IEEE Trans. Neural Networks Learn. Syst., 2020)

Rate-improved inexact augmented Lagrangian method for constrained nonconvex optimization. - Zichong Li; Pin-Yu Chen; Sijia Liu 001; Songtao Lu; Yangyang Xu 005 (AISTATS, 2021)

Distributed stochastic inertial methods with delayed derivatives. - Yangyang Xu 005; Yibo Xu; Yonggui Yan; Jie Chen 007 (CoRR, 2021)

Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems. - Yuyuan Ouyang; Yangyang Xu 005 (Math. Program., 2021)

Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming. - Yangyang Xu 005 (Math. Program., 2021)

First-Order Methods for Constrained Convex Programming Based on Linearized Augmented Lagrangian Function. - Yangyang Xu 005 (INFORMS J. Optim., 2021)

Augmented Lagrangian-Based First-Order Methods for Convex-Constrained Programs with Weakly Convex Objective. - Zichong Li; Yangyang Xu 005 (INFORMS J. Optim., 2021)

Katyusha Acceleration for Convex Finite-Sum Compositional Optimization. - Yibo Xu; Yangyang Xu 005 (INFORMS J. Optim., 2021)

Zeroth-Order Optimization for Composite Problems with Functional Constraints. - Zichong Li; Pin-Yu Chen; Sijia Liu 001; Songtao Lu; Yangyang Xu 005 (AAAI, 2022)

Distributed Stochastic Inertial-Accelerated Methods with Delayed Derivatives for Nonconvex Problems. - Yangyang Xu 005; Yibo Xu; Yonggui Yan; Jie Chen 007 (SIAM J. Imaging Sci., 2022)

Proximal Stochastic Recursive Momentum Methods for Nonconvex Composite Decentralized Optimization. - Gabriel Mancino-Ball; Shengnan Miao; Yangyang Xu 005; Jie Chen 007 (AAAI, 2023)

Momentum-Based Variance-Reduced Proximal Stochastic Gradient Method for Composite Nonconvex Stochastic Optimization. - Yangyang Xu 005; Yibo Xu (J. Optim. Theory Appl., 2023)

A Decentralized Primal-Dual Framework for Non-Convex Smooth Consensus Optimization. - Gabriel Mancino-Ball; Yangyang Xu 005; Jie Chen 007 (IEEE Trans. Signal Process., 2023)

Correntropy based model predictive controller with multi-constraints for robust path trajectory tracking of self-driving vehicle. - Nan Zhou 010; Hao Qin; Kup-Sze Choi; Yuanhua Du; Jun Liu 046; Ping Li 008; Xiaoyan Huang; Kaibo Shi; Yangyang Xu 005 (J. Frankl. Inst., 2023)

Parallel and distributed asynchronous adaptive stochastic gradient methods. - Yangyang Xu 005; Yibo Xu; Yonggui Yan; Colin Sutcher-Shepard; Leopold Grinberg; Jie Chen 007 (Math. Program. Comput., 2023)

Correntropy-Based Low-Rank Matrix Factorization With Constraint Graph Learning for Image Clustering. - Nan Zhou 010; Kup-Sze Choi; Badong Chen; Yuanhua Du; Jun Liu 046; Yangyang Xu 005 (IEEE Trans. Neural Networks Learn. Syst., 2023)

Jointly Improving the Sample and Communication Complexities in Decentralized Stochastic Minimax Optimization. - Xuan Zhang; Gabriel Mancino-Ball; Necdet Serhat Aybat; Yangyang Xu 005 (AAAI, 2024)

Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization. - Zichong Li; Pin-Yu Chen; Sijia Liu 001; Songtao Lu; Yangyang Xu 005 (Comput. Optim. Appl., 2024)

Decentralized Gradient Descent Maximization Method for Composite Nonconvex Strongly-Concave Minimax Problems. - Yangyang Xu 005 (SIAM J. Optim., 2024)

Correction to: Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization. - Zichong Li; Pin-Yu Chen; Sijia Liu 001; Songtao Lu; Yangyang Xu 005 (Comput. Optim. Appl., 2024)

A stochastic smoothing framework for nonconvex-nonconcave min-sum-max problems with applications to Wasserstein distributionally robust optimization. - Wei Liu; Khan Muhammad 001; Gabriel Mancino-Ball; Yangyang Xu 005 (CoRR, 2025)

Lower Complexity Bounds of First-Order Methods for Affinely Constrained Composite Nonconvex Problems. - Wei Liu; Qihang Lin; Yangyang Xu 005 (Math. Oper. Res., 2026)

Variance-reduced accelerated methods for decentralized stochastic double-regularized nonconvex strongly-concave minimax problems. - Gabriel Mancino-Ball; Yangyang Xu 005 (Trans. Mach. Learn. Res., 2026)