A project neural network for solving degenerate convex quadratic program. - Xiaoping Xue 001; Wei Bian 001 (Neurocomputing, 2007)

Subgradient-Based Neural Networks for Nonsmooth Convex Optimization Problems. - Xiaoping Xue 001; Wei Bian 001 (IEEE Trans. Circuits Syst. I Regul. Pap., 2008)

A project neural network for solving degenerate quadratic minimax problem with linear constraints. - Xiaoping Xue 001; Wei Bian 001 (Neurocomputing, 2009)

Subgradient-Based Neural Networks for Nonsmooth Nonconvex Optimization Problems. - Wei Bian 001; Xiaoping Xue 001 (IEEE Trans. Neural Networks, 2009)

A new one-layer recurrent neural network for nonsmooth pseudoconvex optimization. - Sitian Qin; Wei Bian 001; Xiaoping Xue 001 (Neurocomputing, 2013)

Neural Network for Solving Constrained Convex Optimization Problems With Global Attractivity. - Wei Bian 001; Xiaoping Xue 001 (IEEE Trans. Circuits Syst. I Regul. Pap., 2013)

Neural network for nonsmooth pseudoconvex optimization with general convex constraints. - Wei Bian 001; Litao Ma; Sitian Qin; Xiaoping Xue 001 (Neural Networks, 2018)

A Neural Network for Distributed Optimization over Multiagent Networks. - Jiazhen Wei; Sitian Qin; Wei Bian 001 (ISNN, 2020)

Projected Neural Network for a Class of Sparse Regression with Cardinality Penalty. - Wenjing Li; Wei Bian 001 (CoRR, 2020)

Accelerated iterative hard thresholding algorithm for l0 regularized regression problem. - Fan Wu; Wei Bian 001 (J. Glob. Optim., 2020)

Projected Neural Network for a Class of Non-Lipschitz Optimization Problems With Linear Constraints. - Wenjing Li; Wei Bian 001; Xiaoping Xue 001 (IEEE Trans. Neural Networks Learn. Syst., 2020)

Projection neural network for a class of sparse regression problems with cardinality penalty. - Wenjing Li; Wei Bian 001 (Neurocomputing, 2021)

Smoothing neural network for L0 regularized optimization problem with general convex constraints. - Wenjing Li; Wei Bian 001 (Neural Networks, 2021)

A Novel Multiagent Neurodynamic Approach to Constrained Distributed Convex Optimization. - Litao Ma; Wei Bian 001 (IEEE Trans. Cybern., 2021)

A Simple Neural Network for Sparse Optimization With $l_1$ Regularization. - Litao Ma; Wei Bian 001 (IEEE Trans. Netw. Sci. Eng., 2021)

Fast inertial dynamic algorithm with smoothing method for nonsmooth convex optimization. - Xin Qu; Wei Bian 001 (Comput. Optim. Appl., 2022)

Neural network for a class of sparse optimization with L0-regularization. - Zhe Wei; Qingfa Li; Jiazhen Wei; Wei Bian 001 (Neural Networks, 2022)

Difference-of-Convex Algorithms for a Class of Sparse Group $ ell_0$ Regularized Optimization Problems. - Wenjing Li; Wei Bian 001; Kim-Chuan Toh (SIAM J. Optim., 2022)

Anderson Acceleration for Nonsmooth Fixed Point Problems. - Wei Bian 001; Xiaojun Chen (SIAM J. Numer. Anal., 2022)

Smoothing Accelerated Proximal Gradient Method with Fast Convergence Rate for Nonsmooth Convex Optimization Beyond Differentiability. - Fan Wu; Wei Bian 001 (J. Optim. Theory Appl., 2023)

A subgradient-based neural network to constrained distributed convex optimization. - Zhe Wei; Wenwen Jia; Wei Bian 001; Sitian Qin (Neural Comput. Appl., 2023)

Point Clouds Matching Based on Discrete Optimal Transport. - Litao Ma; Wei Bian 001; Xiaoping Xue 001 (IEEE Trans. Image Process., 2024)

An extra gradient Anderson-accelerated algorithm for pseudomonotone variational inequalities. - Xin Qu; Wei Bian 001; Xiaojun Chen (Math. Comput., 2025)

On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models. - Wenjing Li; Wei Bian 001; Kim-Chuan Toh (Math. Program., 2025)

Extrapolated hard thresholding algorithms with finite length for composite ℓ 0 penalized problems. - Fan Wu; Jiazhen Wei; Wei Bian 001 (Comput. Optim. Appl., 2026)

Smoothing Proximal Gradient Block-coordinate Algorithms for Group Sparse ℓ 0 Regularized Nonsmooth Convex Regression Problem. - Xue Li; Wei Bian 001 (J. Optim. Theory Appl., 2026)