default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWei Bian 0001
Person information
- affiliation: Harbin Institute of Technology, Institute of Advanced Study in Mathematics, China
- affiliation (PhD 2009): Harbin Institute of Technology, School of Mathematics, China
Other persons with the same name
- Wei Bian
- Wei Bian 0002
![[0000-0003-4310-5761]](https://dblp.org/img/orcid-mark.12x12.png "0000-0003-4310-5761")
— Tsinghua University, Department of Chinese Language and Literature, School of Humanities, Beijing, China - Wei Bian 0003 — University of Technology Sydney, Center for Artificial Intelligence, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[j24]Fan Wu, Jiazhen Wei, Wei Bian:
Extrapolated hard thresholding algorithms with finite length for composite ℓ 0 penalized problems. Comput. Optim. Appl. 93(2): 765-794 (2026)- [j23]Xue Li, Wei Bian:
Smoothing Proximal Gradient Block-coordinate Algorithms for Group Sparse ℓ 0 Regularized Nonsmooth Convex Regression Problem. J. Optim. Theory Appl. 209(1): 14 (2026) - 2025
- [j22]Xin Qu, Wei Bian, Xiaojun Chen:
An extra gradient Anderson-accelerated algorithm for pseudomonotone variational inequalities. Math. Comput. 95(359): 1361-1387 (2025) - [j21]Wenjing Li, Wei Bian, Kim-Chuan Toh:
On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models. Math. Program. 212(1): 273-318 (2025) - 2024
- [j20]Litao Ma, Wei Bian, Xiaoping Xue:
Point Clouds Matching Based on Discrete Optimal Transport. IEEE Trans. Image Process. 33: 5650-5662 (2024) - 2023
- [j19]Fan Wu, Wei Bian:
Smoothing Accelerated Proximal Gradient Method with Fast Convergence Rate for Nonsmooth Convex Optimization Beyond Differentiability. J. Optim. Theory Appl. 197(2): 539-572 (2023) - [j18]Zhe Wei, Wenwen Jia, Wei Bian, Sitian Qin:
A subgradient-based neural network to constrained distributed convex optimization. Neural Comput. Appl. 35(14): 9961-9971 (2023) - 2022
- [j17]Xin Qu, Wei Bian:
Fast inertial dynamic algorithm with smoothing method for nonsmooth convex optimization. Comput. Optim. Appl. 83(1): 287-317 (2022) - [j16]Zhe Wei, Qingfa Li, Jiazhen Wei, Wei Bian:
Neural network for a class of sparse optimization with L0-regularization. Neural Networks 151: 211-221 (2022) - [j15]Wenjing Li, Wei Bian, Kim-Chuan Toh:
Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems. SIAM J. Optim. 32(3): 1614-1641 (2022) - [j14]Wei Bian, Xiaojun Chen:
Anderson Acceleration for Nonsmooth Fixed Point Problems. SIAM J. Numer. Anal. 60(5): 2565-2591 (2022) - 2021
- [j13]Wenjing Li, Wei Bian:
Projection neural network for a class of sparse regression problems with cardinality penalty. Neurocomputing 431: 188-200 (2021) - [j12]Wenjing Li, Wei Bian:
Smoothing neural network for L0 regularized optimization problem with general convex constraints. Neural Networks 143: 678-689 (2021) - [j11]Litao Ma, Wei Bian:
A Novel Multiagent Neurodynamic Approach to Constrained Distributed Convex Optimization. IEEE Trans. Cybern. 51(3): 1322-1333 (2021) - [j10]Litao Ma, Wei Bian:
A Simple Neural Network for Sparse Optimization With $l_1$ Regularization. IEEE Trans. Netw. Sci. Eng. 8(4): 3430-3442 (2021) - 2020
- [j9]Fan Wu, Wei Bian:
Accelerated iterative hard thresholding algorithm for l0 regularized regression problem. J. Glob. Optim. 76(4): 819-840 (2020) - [j8]Wenjing Li, Wei Bian, Xiaoping Xue:
Projected Neural Network for a Class of Non-Lipschitz Optimization Problems With Linear Constraints. IEEE Trans. Neural Networks Learn. Syst. 31(9): 3361-3373 (2020) - [c1]Jiazhen Wei, Sitian Qin, Wei Bian:
A Neural Network for Distributed Optimization over Multiagent Networks. ISNN 2020: 85-95 - [i1]Wenjing Li, Wei Bian:
Projected Neural Network for a Class of Sparse Regression with Cardinality Penalty. CoRR abs/2004.00858 (2020)
2010 – 2019
- 2018
- [j7]Wei Bian, Litao Ma, Sitian Qin, Xiaoping Xue:
Neural network for nonsmooth pseudoconvex optimization with general convex constraints. Neural Networks 101: 1-14 (2018) - 2013
- [j6]Sitian Qin, Wei Bian, Xiaoping Xue:
A new one-layer recurrent neural network for nonsmooth pseudoconvex optimization. Neurocomputing 120: 655-662 (2013) - [j5]Wei Bian, Xiaoping Xue:
Neural Network for Solving Constrained Convex Optimization Problems With Global Attractivity. IEEE Trans. Circuits Syst. I Regul. Pap. 60-I(3): 710-723 (2013)
2000 – 2009
- 2009
- [j4]Xiaoping Xue, Wei Bian:
A project neural network for solving degenerate quadratic minimax problem with linear constraints. Neurocomputing 72(7-9): 1826-1838 (2009) - [j3]Wei Bian, Xiaoping Xue:
Subgradient-Based Neural Networks for Nonsmooth Nonconvex Optimization Problems. IEEE Trans. Neural Networks 20(6): 1024-1038 (2009) - 2008
- [j2]Xiaoping Xue, Wei Bian:
Subgradient-Based Neural Networks for Nonsmooth Convex Optimization Problems. IEEE Trans. Circuits Syst. I Regul. Pap. 55-I(8): 2378-2391 (2008) - 2007
- [j1]Xiaoping Xue, Wei Bian:
A project neural network for solving degenerate convex quadratic program. Neurocomputing 70(13-15): 2449-2459 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-04-05 22:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
