Wei Bian

Orcid: 0000-0003-4252-047X

Affiliations:
  • Harbin Institute of Technology, Institute of Advanced Study in Mathematics, China
  • Harbin Institute of Technology, School of Mathematics, China (PhD 2009)


According to our database1, Wei Bian authored at least 26 papers between 2007 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Smoothing Proximal Gradient Block-coordinate Algorithms for Group Sparse ℓ <sub>0</sub> Regularized Nonsmooth Convex Regression Problem.
J. Optim. Theory Appl., April, 2026

Extrapolated hard thresholding algorithms with finite length for composite ℓ <sub>0</sub> penalized problems.
Comput. Optim. Appl., March, 2026

2025
On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models.
Math. Program., July, 2025

An extra gradient Anderson-accelerated algorithm for pseudomonotone variational inequalities.
Math. Comput., 2025

2024
Point Clouds Matching Based on Discrete Optimal Transport.
IEEE Trans. Image Process., 2024

2023
A subgradient-based neural network to constrained distributed convex optimization.
Neural Comput. Appl., May, 2023

Smoothing Accelerated Proximal Gradient Method with Fast Convergence Rate for Nonsmooth Convex Optimization Beyond Differentiability.
J. Optim. Theory Appl., May, 2023

2022
Anderson Acceleration for Nonsmooth Fixed Point Problems.
SIAM J. Numer. Anal., 2022

Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems.
SIAM J. Optim., 2022

Neural network for a class of sparse optimization with L0-regularization.
Neural Networks, 2022

Fast inertial dynamic algorithm with smoothing method for nonsmooth convex optimization.
Comput. Optim. Appl., 2022

2021
A Simple Neural Network for Sparse Optimization With $l_1$ Regularization.
IEEE Trans. Netw. Sci. Eng., 2021

A Novel Multiagent Neurodynamic Approach to Constrained Distributed Convex Optimization.
IEEE Trans. Cybern., 2021

Smoothing neural network for L0 regularized optimization problem with general convex constraints.
Neural Networks, 2021

Projection neural network for a class of sparse regression problems with cardinality penalty.
Neurocomputing, 2021

2020
Projected Neural Network for a Class of Non-Lipschitz Optimization Problems With Linear Constraints.
IEEE Trans. Neural Networks Learn. Syst., 2020

Accelerated iterative hard thresholding algorithm for l<sub>0</sub> regularized regression problem.
J. Glob. Optim., 2020

Projected Neural Network for a Class of Sparse Regression with Cardinality Penalty.
CoRR, 2020

A Neural Network for Distributed Optimization over Multiagent Networks.
Proceedings of the Advances in Neural Networks - ISNN 2020, 2020

2018
Neural network for nonsmooth pseudoconvex optimization with general convex constraints.
Neural Networks, 2018

2013
Neural Network for Solving Constrained Convex Optimization Problems With Global Attractivity.
IEEE Trans. Circuits Syst. I Regul. Pap., 2013

A new one-layer recurrent neural network for nonsmooth pseudoconvex optimization.
Neurocomputing, 2013

2009
Subgradient-Based Neural Networks for Nonsmooth Nonconvex Optimization Problems.
IEEE Trans. Neural Networks, 2009

A project neural network for solving degenerate quadratic minimax problem with linear constraints.
Neurocomputing, 2009

2008
Subgradient-Based Neural Networks for Nonsmooth Convex Optimization Problems.
IEEE Trans. Circuits Syst. I Regul. Pap., 2008

2007
A project neural network for solving degenerate convex quadratic program.
Neurocomputing, 2007


  Loading...