default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJianchao Bai
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Yuxuan Zeng, Zhiguo Wang, Jianchao Bai, Xiaojing Shen:
An accelerated stochastic ADMM for nonconvex and nonsmooth finite-sum optimization. Autom. 163: 111554 (2024)- [j18]Ming Yuan, Jianchao Bai, Feng Jiang, Lin Du:
A systematic DNN weight pruning framework based on symmetric accelerated stochastic ADMM. Neurocomputing 575: 127327 (2024) - [j17]Ping-Fan Dai, Jianchao Bai, Jicheng Li:
A General Preconditioner for Tensor Complementarity Problems. J. Sci. Comput. 98(1): 3 (2024) - [j16]Jianchao Bai, Linyuan Jia, Zheng Peng
:
A New Insight on Augmented Lagrangian Method with Applications in Machine Learning. J. Sci. Comput. 99(2): 53 (2024) - [j15]Ming Yuan, Lin Du, Feng Jiang, Jianchao Bai, Guanrong Chen:
Reweighted Alternating Direction Method of Multipliers for DNN weight pruning. Neural Networks 179: 106534 (2024) - 2022
- [j14]Jianchao Bai, William W. Hager, Hongchao Zhang:
An inexact accelerated stochastic ADMM for separable convex optimization. Comput. Optim. Appl. 81(2): 479-518 (2022) - 2021
- [j13]Xiaokai Chang, Jianchao Bai:
A Projected Extrapolated Gradient Method with Larger Step Size for Monotone Variational Inequalities. J. Optim. Theory Appl. 190(2): 602-627 (2021) - [j12]Yuntong Bai, Yun Gong, Jianchao Bai, Jingyu Liu, Hong-Wen Deng, Vince D. Calhoun, Yu-Ping Wang:
A Joint Analysis of Multi-Paradigm fMRI Data With Its Application to Cognitive Study. IEEE Trans. Medical Imaging 40(3): 951-962 (2021) - [i6]Jianchao Bai, Deren Han, Hao Sun, Hongchao Zhang:
Convergence on a symmetric accelerated stochastic ADMM with larger stepsizes. CoRR abs/2103.16154 (2021) - [i5]Jianchao Bai, Yuxue Ma, Hao Sun, Miao Zhang:
Iteration complexity analysis of a partial LQP-based alternating direction method of multipliers. CoRR abs/2103.16752 (2021) - [i4]Jianchao Bai:
A New Insight on Augmented Lagrangian Method and Its Extensions. CoRR abs/2108.11125 (2021)
2010 – 2019
- 2019
- [j11]Jianchao Bai, Ke Guo, Xiaokai Chang:
A Family of Multi-Parameterized Proximal Point Algorithms. IEEE Access 7: 164021-164028 (2019) - [j10]Ping-Fan Dai, Jicheng Li, Jianchao Bai, Jinming Qiu:
A preconditioned two-step modulus-based matrix splitting iteration method for linear complementarity problem. Appl. Math. Comput. 348: 542-551 (2019) - [j9]Ping-Fan Dai, Jicheng Li, Jianchao Bai, Liqiang Dong:
New error bounds for linear complementarity problems of S-Nekrasov matrices and B-S-Nekrasov matrices. Comput. Appl. Math. 38(2) (2019) - [j8]Jianchao Bai, Jicheng Li, Pingfan Dai, Jiaofen Li:
General parameterized proximal point algorithm with applications in statistical learning. Int. J. Comput. Math. 96(1): 199-215 (2019) - [i3]Jianchao Bai, Xiaokai Chang, Jicheng Li, Fengmin Xu:
Convergence Revisit on Generalized Symmetric ADMM. CoRR abs/1906.07888 (2019) - [i2]Jianchao Bai, Junli Liang, Ke Guo, Yang Jing:
Accelerated Symmetric ADMM and Its Applications in Signal Processing. CoRR abs/1906.12015 (2019) - [i1]Jianchao Bai, Ke Guo, Xiaokai Chang:
A family of multi-parameterized proximal point algorithms. CoRR abs/1907.04469 (2019) - 2018
- [j7]Jianchao Bai, Jicheng Li, Fengmin Xu, Hongchao Zhang:
Generalized symmetric ADMM for separable convex optimization. Comput. Optim. Appl. 70(1): 129-170 (2018) - [j6]Jianchao Bai, Jicheng Li, Junkai Deng:
A class of multilevel structured low-rank approximation arising in material processing. Int. J. Comput. Math. 95(2): 329-340 (2018) - [j5]Jianchao Bai, Jicheng Li, Fengmin Xu, Pingfan Dai:
A novel method for a class of structured low-rank minimizations with equality constraint. J. Comput. Appl. Math. 330: 475-487 (2018) - [j4]Jianchao Bai, Hongchao Zhang, Jicheng Li:
A parameterized proximal point algorithm for separable convex optimization. Optim. Lett. 12(7): 1589-1608 (2018) - 2017
- [j3]Ping-Fan Dai, Jicheng Li, Yao-Tang Li, Jianchao Bai:
A general preconditioner for linear complementarity problem with an M-matrix. J. Comput. Appl. Math. 317: 100-112 (2017) - 2016
- [j2]Xue-Feng Duan, Jianchao Bai, Jiao-Fen Li, Jing-Jing Peng:
On the low rank solution of the Q-weighted nearest correlation matrix problem. Numer. Linear Algebra Appl. 23(2): 340-355 (2016) - 2015
- [j1]Jianchao Bai, Xuefeng Duan, Kexin Cheng, Xuewei Zhang:
A Class of Weighted Low Rank Approximation of the Positive Semidefinite Hankel Matrix. J. Appl. Math. 2015: 937573:1-937573:7 (2015)
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 2024-08-23 18:32 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:
