Jianchao Bai

Orcid: 0000-0002-2394-8852

According to our database1, Jianchao Bai authored at least 24 papers between 2015 and 2024.

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

2024
A New Insight on Augmented Lagrangian Method with Applications in Machine Learning.
J. Sci. Comput., May, 2024

A General Preconditioner for Tensor Complementarity Problems.
J. Sci. Comput., January, 2024

Reweighted Alternating Direction Method of Multipliers for DNN weight pruning.
Neural Networks, 2024

A systematic DNN weight pruning framework based on symmetric accelerated stochastic ADMM.
Neurocomputing, 2024

An accelerated stochastic ADMM for nonconvex and nonsmooth finite-sum optimization.
Autom., 2024

2022
An inexact accelerated stochastic ADMM for separable convex optimization.
Comput. Optim. Appl., 2022

2021
A Joint Analysis of Multi-Paradigm fMRI Data With Its Application to Cognitive Study.
IEEE Trans. Medical Imaging, 2021

A Projected Extrapolated Gradient Method with Larger Step Size for Monotone Variational Inequalities.
J. Optim. Theory Appl., 2021

A New Insight on Augmented Lagrangian Method and Its Extensions.
CoRR, 2021

Iteration complexity analysis of a partial LQP-based alternating direction method of multipliers.
CoRR, 2021

Convergence on a symmetric accelerated stochastic ADMM with larger stepsizes.
CoRR, 2021

2019
General parameterized proximal point algorithm with applications in statistical learning.
Int. J. Comput. Math., 2019

Accelerated Symmetric ADMM and Its Applications in Signal Processing.
CoRR, 2019

Convergence Revisit on Generalized Symmetric ADMM.
CoRR, 2019

New error bounds for linear complementarity problems of S-Nekrasov matrices and B-S-Nekrasov matrices.
Comput. Appl. Math., 2019

A preconditioned two-step modulus-based matrix splitting iteration method for linear complementarity problem.
Appl. Math. Comput., 2019

A Family of Multi-Parameterized Proximal Point Algorithms.
IEEE Access, 2019

2018
A parameterized proximal point algorithm for separable convex optimization.
Optim. Lett., 2018

A novel method for a class of structured low-rank minimizations with equality constraint.
J. Comput. Appl. Math., 2018

A class of multilevel structured low-rank approximation arising in material processing.
Int. J. Comput. Math., 2018

Generalized symmetric ADMM for separable convex optimization.
Comput. Optim. Appl., 2018

2017
A general preconditioner for linear complementarity problem with an M-matrix.
J. Comput. Appl. Math., 2017

2016
On the low rank solution of the Q-weighted nearest correlation matrix problem.
Numer. Linear Algebra Appl., 2016

2015
A Class of Weighted Low Rank Approximation of the Positive Semidefinite Hankel Matrix.
J. Appl. Math., 2015


  Loading...