Weak sharp minima revisited Part I: basic theory J Burke, S Deng Control and Cybernetics 31 (3), 439-469, 2002 | 157 | 2002 |
Weak sharp minima revisited, part II: application to linear regularity and error bounds JV Burke, S Deng Mathematical programming 104, 235-261, 2005 | 108 | 2005 |
Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization S Deng Journal of Optimization Theory and Applications 96, 123-131, 1998 | 67 | 1998 |
Weak sharp minima revisited, Part III: Error bounds for differentiable convex inclusions JV Burke, S Deng Mathematical Programming 116 (1), 37-56, 2009 | 66 | 2009 |
Global error bounds for convex inequality systems in Banach spaces S Deng SIAM journal on control and optimization 36 (4), 1240-1249, 1998 | 63 | 1998 |
On approximate solutions in convex vector optimization S Deng SIAM Journal on Control and Optimization 35 (6), 2128-2136, 1997 | 60 | 1997 |
Computable error bounds for convex inequality systems in reflexive Banach spaces S Deng SIAM Journal on Optimization 7 (1), 274-279, 1997 | 55 | 1997 |
An optimization technique for damped model updating with measured data satisfying quadratic orthogonality constraint BN Datta, S Deng, VO Sokolov, DR Sarkissian Mechanical Systems and Signal Processing 23 (6), 1759-1772, 2009 | 45 | 2009 |
Coercivity properties and well-posedness in vector optimization S Deng RAIRO-Operations Research 37 (3), 195-208, 2003 | 44 | 2003 |
On efficient solutions in vector optimization S Deng Journal of optimization theory and applications 96, 201-209, 1998 | 32 | 1998 |
Boundedness and nonemptiness of the efficient solution sets in multiobjective optimization S Deng Journal of optimization theory and applications 144, 29-42, 2010 | 30 | 2010 |
Weak sharp minima in multicriteria linear programming S Deng, XQ Yang SIAM Journal on Optimization 15 (2), 456-460, 2005 | 30 | 2005 |
Computable error bounds for semidefinite programming S Deng, H Hu Journal of Global Optimization 14, 105-115, 1999 | 24 | 1999 |
Characterizations of the nonemptiness and boundedness of weakly efficient solution sets of convex vector optimization problems in real reflexive Banach spaces S Deng Journal of optimization theory and applications 140, 1-7, 2009 | 23 | 2009 |
Perturbation analysis of a condition number for convex inequality systems and global error bounds for analytic systems S Deng Mathematical programming 83, 263-276, 1998 | 23 | 1998 |
Well-posed problems and error bounds in optimization S Deng Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods …, 1999 | 12 | 1999 |
The equivalence of three types of error bounds for weakly and approximately convex functions S Bai, M Li, C Lu, D Zhu, S Deng Journal of Optimization Theory and Applications 194 (1), 220-245, 2022 | 11 | 2022 |
Level-set subdifferential error bounds and linear convergence of Bregman proximal gradient method D Zhu, S Deng, M Li, L Zhao Journal of Optimization Theory and Applications 189 (3), 889-918, 2021 | 10 | 2021 |
On uniqueness of Lagrange multipliers in composite optimization S Deng Journal of mathematical analysis and applications 201 (3), 689-696, 1996 | 8 | 1996 |
On well-posedness and Hausdorff convergence of solution sets of vector optimization problems LJ Kettner, S Deng Journal of Optimization Theory and Applications 153, 619-632, 2012 | 7 | 2012 |