Min Sun

Dr. Min Sun


Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
6 August 2015 in Calcolo
Verified
Journal Article
Closed access
PDF file
MSMin Sun
Min Sun
JLJing Liu
Jing Liu

1 January 2023 in Journal of Industrial and Management Optimization
Verified
Journal Article
Closed access
PDF file
AIAbdulkarim Hassan Ibrahim
Abdulkarim Hassan Ibrahim
Poom KumamPoom Kumam
Poom Kumam
MSMin Sun
Min Sun
PCParin Chaipunya
Parin Chaipunya
AAAuwal Bala Abubakar
Auwal Bala Abubakar
In this paper, using the concept of inertial extrapolation, we introduce a globally convergent inertial extrapolation method for solving nonlinear equations with convex constraints for which the underlying mapping is monotone and Lipschitz continuous. The method can be viewed as a combination of the efficient three-term derivative-free method of Gao and He [Calcolo. 55(4), 1-17, 2018] with the inertial extrapolation step. Moreover, the algorithm is designed such that at every iteration, the method is free from derivative evaluations. Under standard assumptions, we establish the global convergence results for the proposed method. Numerical implementations illustrate the performance and advantage of this new method. Moreover, we also extend this method to solve the LASSO problems to decode a sparse signal in compressive sensing. Performance comparisons illustrate the effectiveness and competitiveness of our algorithm.

22 September 2017 in Journal of Inequalities and Applications
Verified
Journal Article
Open access
PDF file
DFDexiang Feng
Dexiang Feng
MSMin Sun
Min Sun
XWXueyong Wang
Xueyong Wang
In this paper, we present a family of conjugate gradient projection methods for solving large-scale nonlinear equations. At each iteration, it needs low storage and the subproblem can be easily solved. Compared with the existing solution methods for solving the problem, its global convergence is established without the restriction of the Lipschitz continuity on the underlying mapping. Preliminary numerical results are reported to show the efficiency of the proposed method.

10 February 2016 in Calcolo
Verified
Journal Article
Closed access
PDF file
MSMin Sun
Min Sun
YWYiju Wang
Yiju Wang
JLJing Liu
Jing Liu

28 April 2014 in Journal of Applied Mathematics and Computing
Verified
Journal Article
Closed access
PDF file
MSMin Sun
Min Sun
JLJing Liu
Jing Liu

5 May 2020 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
MSMin Sun
Min Sun
JLJing Liu
Jing Liu
YWYaru Wang
Yaru Wang
To solve the monotone equations with convex constraints, a novel multiparameterized conjugate gradient method (MPCGM) is designed and analyzed. This kind of conjugate gradient method is derivative-free and can be viewed as a modified version of the famous Fletcher–Reeves (FR) conjugate gradient method. Under approximate conditions, we show that the proposed method has global convergence property. Furthermore, we generalize the MPCGM to solve unconstrained optimization problem and offer another novel conjugate gradient method (NCGM), which satisfies the sufficient descent property without any line search. Global convergence of the NCGM is also proved. Finally, we report some numerical results to show the efficiency of two novel methods. Specifically, their practical applications in compressive sensing and motion control of robot manipulator are also investigated.