Defeng Sun
Defeng Sun | |
|---|---|
 | |
| Nationality | Chinese |
| Alma mater | Nanjing University Chinese Academy of Sciences |
| Awards | Beale--Orchard-Hays Prize for Excellence in Computational Mathematical Programming 2018 by the Mathematical Optimization Society[1][2]
Fellow, the Society for Industrial and Applied Mathematics 2020 [3] Fellow, China Society of Industrial and Applied Mathematics 2020 [4][5] RGC Senior Research Fellow Award 2022/23 [6][7][8] Fellow, Operations Research Society of China 2024 [9][10] |
| Scientific career | |
| Fields | Optimization and Machine Learning |
| Institutions | Department of Applied Mathematics, The Hong Kong Polytechnic University |
| Doctoral advisor | Jiye Han (Chinese name: 韩继业)...[11] |
Defeng Sun (Chinese name: 孙德锋) is a Chinese applied mathematician and operations researcher.[12] He holds the position of Chair Professor of Applied Optimization and Operations Research, and has been serving as the Head[13] of Department of Applied Mathematics in The Hong Kong Polytechnic University (PolyU) since 2019. Sun had been the President of The Hong Kong Mathematical Society in 2020-2024.[14][15]
Education
[edit]Sun received his Ph.D. degree in 1995 from Chinese Academy of Sciences in Beijing,[16] after obtaining his bachelor’s and Master’s degree from Nanjing University in 1989 and 1992, respectively.
Research
[edit]Sun’s research interests lie in the broad areas of non-convex continuous optimization and machine learning including mathematical theory, algorithmic developments and real-world applications.[17]
In 2006, he solved the long-standing open question of characterizing the strong regularity of nonlinear semidefinite programming (SDP) problems.[18][19][20][21]
Sun was awarded the triennial 2018 Beale-Orchard-Hays Prize for Excellence in Computational Mathematical Programming by Mathematical Optimization Society[1][2] jointly with his collaborators for the work on software SDPNAL/SDPNAL+ for general purpose large scale semidefinite programming problems [22]
Awards
[edit]Sun was ranked among the World’s Top 2% most-cited scientists by Stanford University from 2021 to 2024[23][24][25][26]
He was named a SIAM Fellow in 2020 , for "contributions to algorithms and software for conic optimization, particularly matrix optimization",[3] and Fellow of China Society for Industrial and Applied Mathematics in 2020 "for contributions to the field of industrial and applied mathematics" [4][5]
He received the RGC Senior Research Fellowship for his project "Nonlinear Conic Programming: Theory, Algorithms and Software" by Hong Kong's University Grants Committee in 2022/23.[6][7][8]
References
[edit]- ^ a b "The Beale — Orchard-Hays Prize, Mathematical Optimization Society".
- ^ a b "The 23rd International Symposium on Mathematical Programming, Bordeaux, France on 2 -6 July 2018".
- ^ a b "Fellows, Society for Industrial and Applied Mathematics, retrieved Oct 25, 2024".
- ^ a b "Fellows of China Society for Industrial and Applied Mathematics Fellow, retrieved Oct 25, 2024".
- ^ a b "Defeng Sun named 2020 CSIAM Fellow".
- ^ a b "List of Awardees, RGC Senior Research Fellow 2022/23, retrieved October 25, 2024".
- ^ a b "RGC Award Presentation Ceremony (2022/23)". YouTube. March 2023.
- ^ a b "Awardees of 2022/23 RGC Senior Research Fellow Scheme, Research Grants Council, Hong Kong". YouTube. 27 March 2023.
- ^ "ORSC2024, retrieved October 25, 2024".
- ^ "Defeng Sun, Fellow of Operations Research Society of China 2024".
- ^ "Jiye Han at the Mathematics Genealogy Project".
- ^ "Defeng Sun, Google Scholar".
- ^ "Defeng Sun, Department of Applied Mathematics, The Hong Kong Polytechnic University. Retrieved October 23, 2024".
- ^ "2020-2022 Council Member, The Hong Kong Mathematical Society".
- ^ "2022-2024 Council Member, The Hong Kong Mathematical Society".
- ^ "Defeng Sun at the Mathematics Genealogy Project".
- ^ "Defeng Sun,The Hong Kong Polytechnic University, Retrieved October 25, 2024".
- ^ "Defeng Sun, (2006) The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications. Mathematics of Operations Research 31(4):761-776". doi:10.1287/moor.1060.0195.
- ^ Bolte, Jérôme; Pauwels, Edouard; Silveti-Falls, Antonio (31 March 2024). "Bolte, J., Pauwels, E., & Silveti-Falls, A. (2024). Differentiating nonsmooth solutions to parametric monotone inclusion problems. SIAM Journal on Optimization, 34(1), 71-97". SIAM Journal on Optimization. 34 (1): 71–97. arXiv:2212.07844. doi:10.1137/22M1541630.
- ^ Mordukhovich, B. S.; Nghia, T. T. A.; Rockafellar, R. T. (February 2015). "Mordukhovich, B. S., Nghia, T. T., & Rockafellar, R. T. (2015). Full stability in finite-dimensional optimization. Mathematics of Operations Research, 40(1), 226-252". Mathematics of Operations Research. 40 (1): 226–252. doi:10.1287/moor.2014.0669.
- ^ Q. Tran Dinh, S. Gumussoy, W. Michiels and M. Diehl, "Combining Convex–Concave Decompositions and Linearization Approaches for Solving BMIs, With Application to Static Output Feedback," in IEEE Transactions on Automatic Control, vol. 57, no. 6, pp. 1377-1390, June 2012, doi: 10.1109/TAC.2011.2176154
- ^ "Liuqin Yang, Defeng Sun, and Kim Chuan Toh, "SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints", Mathematical Programming Computation Vol. 7, Issue 3 (2015) 331–366" (PDF).
- ^ "Top 2% Most-Cited Scientists by Stanford University, 2021".
- ^ "Top 2% Most-Cited Scientists by Stanford University, 2022".
- ^ "Top 2% Most-Cited Scientists by Stanford University, 2023".
- ^ "Top 2% Most-Cited Scientists by Stanford University, 2024".
