Deren Han
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Deren Han has a total of 152 co-authors. Here are the top co-authors by number of shared publications:
- Xingju Cai
School of Mathematical Sciences, Nanjing Normal University, Nanjing, People’s Republic of China
23 shared publications - Jiaxin Xie
School of Mathematical Sciences, Beihang University, Beijing, China
16 shared publications - Cairong Chen
School of Mathematics and Statistics & Key Laboratory of Analytical Mathematics and Applications (Ministry of Education) & Fujian Provincial Key Laboratory of Statistics and Artificial Intelligence & Fujian Key Laboratory of Analytical Mathematics and Applications (FJKLAMA) & Center for Applied Mathematics of Fujian Province (FJNU), Fujian Normal University, Fuzhou, People’s Republic of China
12 shared publications - Dongmei Yu
Institute for Optimization and Decision Analytics Liaoning Technical University 123000 Fuxin P.R. China
12 shared publications - Xiaoming Yuan
The University of Hong Kong
8 shared publications - Yansheng Su
School of Mathematical Sciences, Beihang University, Beijing, China
8 shared publications
Latest Publications
- 1 October 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 109 (3) , 67
A Variable Metric Douglas–Rachford Splitting Method for Nonconvex Composite Optimization
- 1 October 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 109 (3) , 67
A Variable Metric Douglas–Rachford Splitting Method for Nonconvex Composite Optimization
- 29 August 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 109 (1) , 30
The Variance Reduced Douglas-Rachford Splitting Method for Large-Scale Optimization Problems
- 29 August 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 109 (1) , 30
The Variance Reduced Douglas-Rachford Splitting Method for Large-Scale Optimization Problems
- 22 July 2026
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 95 (1) , 481-483
Correction: A relaxed scalable modulus-based matrix splitting method for vertical nonlinear complementarity problems
- 22 July 2026
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 95 (1) , 481-483
Correction: A relaxed scalable modulus-based matrix splitting method for vertical nonlinear complementarity problems
- 22 July 2026
- Published by Springer Nature in Journal of Global Optimization
- Vol. 95 (4) , 893-926
An improved inertial stochastic proximal alternating linearized minimization for nonconvex optimization in machine learning
- 22 July 2026
- Published by Springer Nature in Journal of Global Optimization
- Vol. 95 (4) , 893-926
An improved inertial stochastic proximal alternating linearized minimization for nonconvex optimization in machine learning
- 30 May 2026
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 209 (3) , 80
Hyperspectral Super-Resolution Via Tensor CP Decomposition with Total Variation Regularization
- 30 May 2026
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 209 (3) , 80
Hyperspectral Super-Resolution Via Tensor CP Decomposition with Total Variation Regularization
- Open Access
- 7 May 2026
- Published by Global Science Press in Numerical Mathematics: Theory, Methods and Applications
- Vol. 19 (2) , 275-297
A Resampling-Free Stochastic Projection Contraction Algorithm for Solving Stochastic Variational Inequalities
Sampling is a major computational bottleneck in stochastic algorithms. This paper proposes a stochastic projection contraction algorithm for stochastic variational inequality problems, significantly reducing runtime by eliminating resampling in the correction step. We introduce an adjustable offset weight to optimize search direction, along with different adaptive step size strategies in prediction and correction steps. We further present discrete differential equation interpretations for specific offset weight values. To address bias due to the absence of resampling in the correction step, we develop an error control scheme and provide convergence guarantees. Numerical experiments demonstrate the algorithm’s efficiency
- 7 May 2026
- Published by Global Science Press in Numerical Mathematics: Theory, Methods and Applications
- Vol. 19 (2) , 275-297
Open AccessA Resampling-Free Stochastic Projection Contraction Algorithm for Solving Stochastic Variational Inequalities
Sampling is a major computational bottleneck in stochastic algorithms. This paper proposes a stochastic projection contraction algorithm for stochastic variational inequality problems, significantly reducing runtime by eliminating resampling in the correction step. We introduce an adjustable offset weight to optimize search direction, along with different adaptive step size strategies in prediction and correction steps. We further present discrete differential equation interpretations for specific offset weight values. To address bias due to the absence of resampling in the correction step, we develop an error control scheme and provide convergence guarantees. Numerical experiments demonstrate the algorithm’s efficiency
- 28 February 2026
- Published by Springer Nature in Science China Mathematics
- p. 1-22
An improved SDP rounding approximation algorithm for the max hypergraph bisection
- 28 February 2026
- Published by Springer Nature in Science China Mathematics
- p. 1-22
An improved SDP rounding approximation algorithm for the max hypergraph bisection
- 17 February 2026
- Published by Springer Nature in Journal of Global Optimization
- Vol. 94 (3) , 755-782
A Bregman ADMM for Robust Fused Lasso Estimation with Doubly Nonconvex Regularizers
- 17 February 2026
- Published by Springer Nature in Journal of Global Optimization
- Vol. 94 (3) , 755-782
A Bregman ADMM for Robust Fused Lasso Estimation with Doubly Nonconvex Regularizers
- 11 February 2026
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 208 (3) , 92
Revisit Iterative Complexity of Some Projection-type Methods for Monotone Linear Variational Inequality Problems
- 11 February 2026
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 208 (3) , 92
Revisit Iterative Complexity of Some Projection-type Methods for Monotone Linear Variational Inequality Problems