Defeng Sun

8.8k total citations · 1 hit paper
125 papers, 5.7k citations indexed

About

Defeng Sun is a scholar working on Numerical Analysis, Computational Theory and Mathematics and Computational Mechanics. According to data from OpenAlex, Defeng Sun has authored 125 papers receiving a total of 5.7k indexed citations (citations by other indexed papers that have themselves been cited), including 96 papers in Numerical Analysis, 83 papers in Computational Theory and Mathematics and 65 papers in Computational Mechanics. Recurrent topics in Defeng Sun's work include Advanced Optimization Algorithms Research (93 papers), Optimization and Variational Analysis (57 papers) and Sparse and Compressive Sensing Techniques (56 papers). Defeng Sun is often cited by papers focused on Advanced Optimization Algorithms Research (93 papers), Optimization and Variational Analysis (57 papers) and Sparse and Compressive Sensing Techniques (56 papers). Defeng Sun collaborates with scholars based in Singapore, China and Hong Kong. Defeng Sun's co-authors include Liqun Qi, Kim-Chuan Toh, Jie Sun, Wen‐Quan Tao, Houduo Qi, Xudong Li, Guanglu Zhou, Xinyuan Zhao, Ting Kei Pong and Paul Tseng and has published in prestigious journals such as International Journal of Heat and Mass Transfer, Mathematics of Computation and Statistics in Medicine.

In The Last Decade

Defeng Sun

118 papers receiving 5.2k citations

Hit Papers

Hankel Matrix Rank Minimization with Applications to Syst... 2013 2026 2017 2021 2013 100 200 300

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Defeng Sun Singapore 43 3.5k 3.0k 2.6k 531 394 125 5.7k
Jean‐Baptiste Hiriart‐Urruty France 26 2.5k 0.7× 3.0k 1.0× 1.2k 0.4× 734 1.4× 324 0.8× 79 5.3k
Paul Tseng United States 42 3.4k 1.0× 3.5k 1.1× 2.3k 0.9× 646 1.2× 604 1.5× 103 6.7k
J. Frédéric Bonnans France 26 2.1k 0.6× 2.6k 0.9× 1.0k 0.4× 995 1.9× 260 0.7× 119 4.9k
Ya-xiang Yuan China 28 2.1k 0.6× 1.5k 0.5× 1.2k 0.5× 447 0.8× 317 0.8× 89 3.8k
Hongchao Zhang United States 22 2.1k 0.6× 1.3k 0.4× 1.6k 0.6× 276 0.5× 373 0.9× 61 3.5k
Kim-Chuan Toh Singapore 37 2.3k 0.7× 2.1k 0.7× 2.7k 1.0× 1.1k 2.1× 1000 2.5× 142 6.9k
Jonathan Eckstein United States 22 1.4k 0.4× 1.5k 0.5× 1.4k 0.6× 227 0.4× 584 1.5× 58 3.5k
Renato D. C. Monteiro United States 32 2.8k 0.8× 2.5k 0.8× 1.6k 0.6× 428 0.8× 250 0.6× 107 4.2k
Hédy Attouch France 22 1.3k 0.4× 1.9k 0.6× 1.5k 0.6× 242 0.5× 465 1.2× 44 3.3k
Henry Wolkowicz Canada 35 2.5k 0.7× 2.8k 0.9× 1.2k 0.5× 636 1.2× 301 0.8× 126 5.1k

Countries citing papers authored by Defeng Sun

Since Specialization
Citations

This map shows the geographic impact of Defeng Sun's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Defeng Sun with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Defeng Sun more than expected).

Fields of papers citing papers by Defeng Sun

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Defeng Sun. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Defeng Sun. The network helps show where Defeng Sun may publish in the future.

Co-authorship network of co-authors of Defeng Sun

This figure shows the co-authorship network connecting the top 25 collaborators of Defeng Sun. A scholar is included among the top collaborators of Defeng Sun based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Defeng Sun. Defeng Sun is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Liang, Chen, et al.. (2025). Characterizations of the Aubin property of the solution mapping for nonlinear semidefinite programming. Mathematical Programming. 215(1-2). 637–668.
2.
Chen, Liang, et al.. (2025). Aubin Property and Strong Regularity Are Equivalent for Nonlinear Second-Order Cone Programming. SIAM Journal on Optimization. 35(2). 712–738. 1 indexed citations
3.
Sun, Defeng, et al.. (2025). Accelerating Preconditioned ADMM via Degenerate Proximal Point Mappings. SIAM Journal on Optimization. 35(2). 1165–1193. 4 indexed citations
4.
Sun, Defeng, et al.. (2025). HPR-LP: An implementation of an HPR method for solving linear programming. Mathematical Programming Computation. 18(1). 183–210.
5.
Hu, Shenglong, Defeng Sun, & Kim-Chuan Toh. (2024). Quantifying low rank approximations of third order symmetric tensors. Mathematical Programming. 213(1-2). 1119–1168.
6.
Li, Qian, Defeng Sun, & Yancheng Yuan. (2024). An Efficient Sieving-Based Secant Method for Sparse Optimization Problems with Least-Squares Constraints. SIAM Journal on Optimization. 34(2). 2038–2066.
8.
Cui, Ying, et al.. (2021). On Degenerate Doubly Nonnegative Projection Problems. Mathematics of Operations Research. 47(3). 2219–2239.
9.
Sun, Defeng, et al.. (2020). A sparse semismooth Newton based proximal majorization-minimization algorithm for nonconvex square-root-loss regression problems. PolyU Institutional Research Archive (Hong Kong Polytechnic University). 21(226). 1–38. 1 indexed citations
10.
Chen, Liang, Xudong Li, Defeng Sun, & Kim-Chuan Toh. (2019). On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming. Mathematical Programming. 185(1-2). 111–161. 28 indexed citations
11.
Li, Xudong, Defeng Sun, & Kim-Chuan Toh. (2018). On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope. Mathematical Programming. 179(1-2). 419–446. 18 indexed citations
12.
Cui, Ying, Defeng Sun, & Kim-Chuan Toh. (2018). On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming. Mathematical Programming. 178(1-2). 381–415. 25 indexed citations
13.
Han, Deren, Defeng Sun, & Liwei Zhang. (2017). Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming. Mathematics of Operations Research. 43(2). 622–637. 77 indexed citations
14.
Sun, Defeng, Kim-Chuan Toh, & Liuqin Yang. (2014). A Convergent Proximal Alternating Direction Method of Multipliers for Conic Programming with 4-Block Constraints. arXiv (Cornell University). 10 indexed citations
15.
Jiang, Kaifeng, Defeng Sun, & Kim-Chuan Toh. (2014). A partial proximal point algorithm for nuclear norm regularized matrix least squares problems. Mathematical Programming Computation. 6(3). 281–325. 21 indexed citations
16.
Zhao, Xinyuan, et al.. (2008). A NEWTON-CG AUGMENTED LAGRANGIAN METHOD FOR SEMIDEFINITE PROGRAMMING. DSpace@MIT (Massachusetts Institute of Technology). 238 indexed citations
17.
Han, Deren, Xun Li, Defeng Sun, & Jie Sun. (2005). Bounding Option Prices of Multi-Assets: A Semidefinite Programming Approach. eSpace (Curtin University). 1. 59–79. 5 indexed citations
18.
Qi, Liqun, Defeng Sun, & Guanglu Zhou. (2002). A primal–dual algorithm for minimizing a sum of Euclidean norms. Journal of Computational and Applied Mathematics. 138(1). 127–150. 13 indexed citations
19.
Sun, Defeng & Liqun Qi. (2001). Solving variational inequality problems via smoothing-nonsmooth reformulations. Journal of Computational and Applied Mathematics. 129(1-2). 37–62. 30 indexed citations
20.
Jiang, Houyuan, Masao Fukushima, Liqun Qi, & Defeng Sun. (1998). A Trust Region Method for Solving Generalized Complementarity Problems. SIAM Journal on Optimization. 8(1). 140–157. 59 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026