| Convex analysis approach to DC programming: theory, algorithms and applications PD Tao, LTH An Acta mathematica vietnamica 22 (1), 289-355, 1997 | 1045 | 1997 |
| The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems LTH An, PD Tao Annals of operations research 133, 23-46, 2005 | 976 | 2005 |
| A DC optimization algorithm for solving the trust-region subproblem PD Tao, LTH An SIAM Journal on Optimization 8 (2), 476-505, 1998 | 649 | 1998 |
| Solving a class of linearly constrained indefinite quadratic problems by DC algorithms L Thi Hoai An, P Dinh Tao Journal of global optimization 11, 253-285, 1997 | 377 | 1997 |
| DC programming and DCA: thirty years of developments HA Le Thi, T Pham Dinh Mathematical Programming 169 (1), 5-68, 2018 | 330 | 2018 |
| Object pose from 2-D to 3-D point and line correspondences TQ Phong, R Horaud, A Yassine, PD Tao International Journal of Computer Vision 15 (3), 225-243, 1995 | 230 | 1995 |
| DC approximation approaches for sparse optimization HA Le Thi, TP Dinh, HM Le, XT Vo European Journal of Operational Research 244 (1), 26-46, 2015 | 214 | 2015 |
| Exact penalty and error bounds in DC programming HA Le Thi, T Pham Dinh, HV Ngai Journal of Global Optimization, 1-27, 2011 | 211 | 2011 |
| Recent advances in DC programming and DCA T Pham Dinh, HA Le Thi Transactions on computational intelligence XIII, 1-37, 2014 | 205 | 2014 |
| Algorithms for solving a class of nonconvex optimization problems. Methods of subgradients PD Tao North-Holland Mathematics Studies 129, 249-271, 1986 | 169 | 1986 |
| Duality in dc (difference of convex functions) optimization. Subgradient methods PD Tao, EB Souad Trends in Mathematical Optimization: 4th French-German Conference on …, 1988 | 161 | 1988 |
| Large-scale molecular optimization from distance matrices by a dc optimization approach LTH An, PD Tao SIAM Journal on Optimization 14 (1), 77-114, 2003 | 131 | 2003 |
| Branch and Bound Method via dc Optimization Algorithms andEllipsoidal Technique for Box Constrained Nonconvex Quadratic Problems PD Le Thi Hoai An, A Tao Journal of Global Optimization 13 (2), 171-206, 1998 | 129* | 1998 |
| A DC programming approach for feature selection in support vector machines learning HA Le Thi, HM Le, VV Nguyen, T Pham Dinh Advances in Data Analysis and Classification 2 (3), 259-278, 2008 | 118 | 2008 |
| An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints LT Hoai An Mathematical programming 87 (3), 401-426, 2000 | 113 | 2000 |
| Convergence analysis of difference-of-convex algorithm with subanalytic data HA Le Thi, VN Huynh, T Pham Dinh Journal of Optimization Theory and Applications 179 (1), 103-126, 2018 | 112* | 2018 |
| Numerical solution for optimization over the efficient set by dc optimization algorithm PDTLDM Le Thi Hoai An Operations Research Letters 19, 117-128, 1996 | 110 | 1996 |
| DC programming and DCA for general DC programs HA Le Thi, VN Huynh, TP Dinh Advanced Computational Methods for Knowledge Engineering: Proceedings of the …, 2014 | 109 | 2014 |
| A new efficient algorithm based on DC programming and DCA for clustering LTH An, MT Belghiti, PD Tao Journal of Global Optimization 37 (4), 593-608, 2007 | 97 | 2007 |
| Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm HA Le Thi, HM Le, T Pham Dinh Machine Learning 101, 163-186, 2015 | 88 | 2015 |
