| Convex analysis approach to dc programming: Theory, algorithms and applications PD Tao, LT Hoai An Acta Mathematica Vietnamica 22 (1), 289-355, 1997 | 771 | 1997 |
| The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems LT Hoai An, PD Tao Annals of Operations Research 133 (1-4), 23-46, 2005 | 746 | 2005 |
| “DC Optimization Algorithms for Solving the Trust Region Subproblem.” PD Tao, LT Hoai An SIAM J. Optim 8, 476-505, 1998 | 550 | 1998 |
| " Solving a Class of Linearly Constrained Indefinite Quadratic Problems by DC Algorithms LT Hoai An, PD Tao J. Global Optimization 11, 253-285, 1997 | 320 | 1997 |
| 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 | 217 | 1995 |
| Recent advances in DC programming and DCA TP Dinh, HA Le Thi Transactions on computational intelligence XIII, 1-37, 2014 | 143 | 2014 |
| Duality in dc (difference of convex functions) optimization. Subgradient methods PD Tao Trends in mathematical optimization, 277-293, 1988 | 140 | 1988 |
| 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 | 129 | 2015 |
| Exact penalty and error bounds in DC programming HA Le Thi, T Pham Dinh, HV Ngai Journal of Global Optimization, 1-27, 2011 | 116 | 2011 |
| Algorithms for solving a class of nonconvex optimization problems. Methods of subgradients PD Tao North-Holland Mathematics Studies 129, 249-271, 1986 | 115 | 1986 |
| DC programming and DCA: thirty years of developments HA Le Thi, TP Dinh Mathematical Programming 169 (1), 5-68, 2018 | 112 | 2018 |
| Large-scale molecular optimization from distance matrices by a dc optimization approach LT Hoai An, PD Tao SIAM Journal on Optimization 14, 77, 2003 | 109 | 2003 |
| Exact penalty in DC programming HA Le Thi, TP Dinh, M Le Dung Vietnam Journal of Mathematics 27 (2), 169-178, 1999 | 105 | 1999 |
| Branch and Bound Method via dc Optimization Algorithms andEllipsoidal Technique for Box Constrained Nonconvex Quadratic Problems LT Hoai An, PD Tao Journal of Global Optimization 13 (2), 171-206, 1998 | 104 | 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 | 97 | 2008 |
| Numerical solution for optimization over the efficient set by dc optimization algorithms PD Tao Operations Research Letters 19 (3), 117-128, 1996 | 94 | 1996 |
| Numerical solution for optimization over the efficient set by dc optimization algorithm PDT Tao, M Le Dung, LT Hoai An Operations Research Letters 19, 117--128, 1996 | 94 | 1996 |
| An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints LT Hoai An Mathematical programming 87 (3), 401-426, 2000 | 92 | 2000 |
| A new efficient algorithm based on DC programming and DCA for clustering MT Belghiti, PD Tao Journal of Global Optimization 37 (4), 593-608, 2007 | 86 | 2007 |
| Proximal decomposition on the graph of a maximal monotone operator P Mahey, S Oualibouch, PD Tao SIAM Journal on Optimization 5 (2), 454-466, 1995 | 85 | 1995 |
Pham Dinh TaoProfessor Emeritus of Applied Mathematics, Laboratory of Mathematics, INSA-Rouen, Normandie, 76801Verified email at insa-rouen.fr
