Deren Han

Deren Han

Auto-generated profile, based on publicly available information

Deren Han

School of Mathematical Sciences, Beihang University, Beijing, People’s Republic of China

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 February 2012 in Journal of Optimization Theory and Applications
Verified
Journal Article
Closed access
PDF file
DHDeren Han
Deren Han
XYXiaoming Yuan
Xiaoming Yuan

1 January 2022 in Journal of the Operations Research Society of China
Verified
Journal Article
Open access
PDF file
DHDe-Ren Han
De-Ren Han
Recently, alternating direction method of multipliers (ADMM) attracts much attentions from various fields and there are many variant versions tailored for different models. Moreover, its theoretical studies such as rate of convergence and extensions to nonconvex problems also achieve much progress. In this paper, we give a survey on some recent developments of ADMM and its variants.

28 July 2016 in International Journal of Computer Mathematics
Verified
Journal Article
Closed access
KGK. Guo
K. Guo
DHD. R. Han
D. R. Han
TWT. T. Wu
T. T. Wu
The efficiency of the classic alternating direction method of multipliers has been exhibited by various applications for large-scale separable optimization problems, both for convex objective functions and for nonconvex objective functions. While there are a lot of convergence analysis for the convex case, the nonconvex case is still an open problem and the research for this case is in its infancy. In this paper, we give a partial answer on this problem. Specially, under the assumption that the associated function satisfies the Kurdyka–Łojasiewicz inequality, we prove that the iterative sequence generated by the alternating direction method converges to a critical point of the problem, provided that the penalty parameter is greater than 2L, where L is the Lipschitz constant of the gradient of one of the involved functions. Under some further conditions on the problem's data, we also analyse the convergence rate of the algorithm.

3 March 2009 in Frontiers of Mathematics in China
Verified
Journal Article
Open access
PDF file
LQLiqun Qi
Liqun Qi
HDHui-Hui Dai
Hui-Hui Dai
DHDeren Han
Deren Han
The strong ellipticity condition plays an important role in nonlinear elasticity and in materials. In this paper, we define M-eigenvalues for an elasticity tensor. The strong ellipticity condition holds if and only if the smallest M-eigenvalue of the elasticity tensor is positive. If the strong ellipticity condition holds, then the elasticity tensor is rank-one positive definite. The elasticity tensor is rank-one positive definite if and only if the smallest Z-eigenvalue of the elasticity tensor is positive. A Z-eigenvalue of the elasticity tensor is an M-eigenvalue but not vice versa. If the elasticity tensor is second-order positive definite, then the strong ellipticity condition holds. The converse conclusion is not right. Computational methods for finding M-eigenvalues are presented.

27 July 2016 in Computational Optimization and Applications
Verified
Journal Article
Closed access
PDF file
XCXingju Cai
Xingju Cai
DHDeren Han
Deren Han
XYXiaoming Yuan
Xiaoming Yuan

20 May 2009 in Journal of Elasticity
Verified
Journal Article
Closed access
PDF file
DHDeren Han
Deren Han
HDH. H. Dai
H. H. Dai
LQLiqun Qi
Liqun Qi