default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTao Pham Dinh
Pham Dinh Tao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j84]Hoai An Le Thi
, Tao Pham Dinh:
Open issues and recent advances in DC programming and DCA. J. Glob. Optim. 88(3): 533-590 (2024)- [j83]Hoai An Le Thi, Ngai Van Huynh, Tao Pham Dinh:
Minimizing Compositions of Differences-of-Convex Functions with Smooth Mappings. Math. Oper. Res. 49(2): 1140-1168 (2024) - [j82]Yi-Shuai Niu, Hoai An Le Thi, Tao Pham Dinh:
On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials. SIAM J. Optim. 34(2): 1852-1878 (2024) - [j81]Hoai An Le Thi, Hoang Phuc Hau Luu, Tao Pham Dinh:
Online Stochastic DCA With Applications to Principal Component Analysis. IEEE Trans. Neural Networks Learn. Syst. 35(5): 7035-7047 (2024) - 2023
- [j80]Hoai An Le Thi, Thi-Minh-Tam Nguyen, Tao Pham Dinh:
On solving difference of convex functions programs with linear complementarity constraints. Comput. Optim. Appl. 86(1): 163-197 (2023) - 2022
- [j79]Hoai An Le Thi, Tao Pham Dinh, Yaroslav D. Sergeyev:
Preface to the special issue dedicated to the 6th World Congress on Global Optimization held in Metz, France, July 8-10, 2019. J. Glob. Optim. 82(4): 655-657 (2022) - [j78]Tao Pham Dinh, Ngai Van Huynh, Hoai An Le Thi, Vinh Thanh Ho:
Alternating DC algorithm for partial DC programming problems. J. Glob. Optim. 82(4): 897-928 (2022) - [j77]Hoai An Le Thi, Hoang Phuc Hau Luu, Hoai Minh Le, Tao Pham Dinh:
Stochastic DCA with Variance Reduction and Applications in Machine Learning. J. Mach. Learn. Res. 23: 206:1-206:44 (2022) - [j76]Hoai An Le Thi, Ngai Van Huynh, Tao Pham Dinh, Hoang Phuc Hau Luu:
Stochastic Difference-of-Convex-Functions Algorithms for Nonconvex Programming. SIAM J. Optim. 32(3): 2263-2293 (2022) - [e6]Hoai An Le Thi, Tao Pham Dinh, Hoai Minh Le:
Modelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 4th International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences - MCO 2021, Hanoi, Vietnam, 13-14 December 2021. Lecture Notes in Networks and Systems 363, Springer 2022, ISBN 978-3-030-92665-6 [contents] - 2021
- [j75]Hoai An Le Thi, Duy Nhat Phan, Tao Pham Dinh:
DCA based approaches for bi-level variable selection and application for estimate multiple sparse covariance matrices. Neurocomputing 466: 162-177 (2021) - [j74]Vinh Thanh Ho, Hoai An Le Thi, Tao Pham Dinh:
DCA-based algorithms for DC fitting. J. Comput. Appl. Math. 389: 113353 (2021) - [j73]Hoai An Le Thi, Tao Pham Dinh, Yaroslav D. Sergeyev:
Preface to the special issue dedicated to the 6th World Congress on Global Optimization held in Metz, France, July 8-10, 2019. Optim. Lett. 15(7): 2347-2349 (2021) - [j72]Thi Thuy Tran, Hoai An Pham Thi, Tao Pham Dinh, Nhu Tuan Nguyen:
DC programming and DCA for enhancing physical layer security via relay beamforming strategies. Optim. Lett. 15(7): 2377-2405 (2021) - 2020
- [e5]Hoai An Le Thi, Hoai Minh Le, Tao Pham Dinh, Ngoc Thanh Nguyen:
Advanced Computational Methods for Knowledge Engineering - Proceedings of the 6th International Conference on Computer Science, Applied Mathematics and Applications, ICCSAMA 2019, Hanoi, Vietnam, December 19-20, 2019. Advances in Intelligent Systems and Computing 1121, Springer 2020, ISBN 978-3-030-38363-3 [contents] - [e4]Hoai An Le Thi, Hoai Minh Le, Tao Pham Dinh:
Optimization of Complex Systems: Theory, Models, Algorithms and Applications, WCGO 2019, World Congress on Global Optimization, Metz, France, 8-10 July, 2019. Advances in Intelligent Systems and Computing 991, Springer 2020, ISBN 978-3-030-21802-7 [contents]
2010 – 2019
- 2019
- [j71]Yi-Shuai Niu, Joaquim Júdice, Hoai An Le Thi, Pham Dinh Tao:
Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem. Appl. Math. Comput. 353: 95-113 (2019) - [j70]Hoai An Le Thi, Vinh Thanh Ho, Tao Pham Dinh:
A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning. J. Glob. Optim. 73(2): 279-310 (2019) - [c44]Vinh Thanh Ho, Hoai An Le Thi, Tao Pham Dinh:
DCA with Successive DC Decomposition for Convex Piecewise-Linear Fitting. ICCSAMA 2019: 39-51 - [c43]Anh Son Ta, Hoai An Le Thi, Tao Pham Dinh:
Solving Efficient Target-Oriented Scheduling in Directional Sensor Networks by DCA. ICCSAMA 2019: 52-63 - [i2]Le Thi Hoai An, Ngai Van Huynh, Pham Dinh Tao:
Stochastic Difference-of-Convex Algorithms for Solving nonconvex optimization problems. CoRR abs/1911.04334 (2019) - 2018
- [j69]Hoai An Le Thi, Ta Anh Son, Tao Pham Dinh:
An efficient DCA based algorithm for power control in large scale wireless networks. Appl. Math. Comput. 318: 215-226 (2018) - [j68]Hoai An Le Thi, Ngai Van Huynh, Tao Pham Dinh:
Convergence Analysis of Difference-of-Convex Algorithm with Subanalytic Data. J. Optim. Theory Appl. 179(1): 103-126 (2018) - [j67]Hoai An Le Thi, Tao Pham Dinh:
Preface. Math. Program. 169(1): 1-4 (2018) - [j66]Hoai An Le Thi, Tao Pham Dinh:
DC programming and DCA: thirty years of developments. Math. Program. 169(1): 5-68 (2018) - 2017
- [j65]Le Thi Hoai An, Pham Dinh Tao:
Modeling and Computational Optimization for Complex System Management. Comput. Oper. Res. 87: 195 (2017) - [j64]Tao Pham Dinh, Vinh Thanh Ho, Hoai An Le Thi:
DC programming and DCA for solving Brugnano-Casulli piecewise linear systems. Comput. Oper. Res. 87: 196-204 (2017) - [j63]Thi Thuy Tran, Hoai An Le Thi, Tao Pham Dinh:
DC programming and DCA for enhancing physical layer security via cooperative jamming. Comput. Oper. Res. 87: 235-244 (2017) - [j62]Phan Duy Nhat, Hoai An Le Thi, Tao Pham Dinh:
Sparse Covariance Matrix Estimation by DCA-Based Algorithms. Neural Comput. 29(11) (2017) - [c42]Vo Xuanthanh, Bach Tran, Hoai An Le Thi, Tao Pham Dinh:
Ramp Loss Support Vector Data Description. ACIIDS (1) 2017: 421-431 - [c41]Phan Duy Nhat, Hoai An Le Thi, Tao Pham Dinh:
Efficient Bi-level Variable Selection and Application to Estimation of Multiple Covariance Matrices. PAKDD (1) 2017: 304-316 - 2016
- [j61]Hoai An Le Thi, Tao Pham Dinh, Mamadou Thiao:
Efficient approaches for ℓ 2-ℓ 0 regularization and applications to feature selection in SVM. Appl. Intell. 45(2): 549-565 (2016) - [j60]Hoai An Le Thi, Ngai Van Huynh, Tao Pham Dinh:
Error Bounds Via Exact Penalization with Applications to Concave and Quadratic Systems. J. Optim. Theory Appl. 171(1): 228-250 (2016) - [j59]Hoai An Le Thi, Xuan Thanh Vo, Tao Pham Dinh:
Efficient Nonnegative Matrix Factorization by DC Programming and DCA. Neural Comput. 28(6): 1163-1216 (2016) - [j58]Tao Pham Dinh, Hoai An Le Thi, Viet Nga Pham, Yi-Shuai Niu:
DC programming approaches for discrete portfolio optimization under concave transaction costs. Optim. Lett. 10(2): 261-282 (2016) - [c40]Xuan Thanh Vo, Hoai An Le Thi, Tao Pham Dinh:
Robust Optimization for Clustering. ACIIDS (2) 2016: 671-680 - [c39]Le Thi Hoai An, Tran Thi Thuy, Tao Pham Dinh, Alain Gély:
DC Programming and DCA for Transmit Beamforming and Power Allocation in Multicasting Relay Network. ICCSAMA 2016: 29-41 - 2015
- [j57]Hoai An Le Thi, Tao Pham Dinh, Hoai Minh Le, Xuan Thanh Vo:
DC approximation approaches for sparse optimization. Eur. J. Oper. Res. 244(1): 26-46 (2015) - [j56]Hoai An Le Thi, Le Hoai Minh, Tao Pham Dinh:
Feature selection in machine learning: an exact penalty approach using a Difference of Convex function Algorithm. Mach. Learn. 101(1-3): 163-186 (2015) - [c38]Xuan Thanh Vo, Hoai An Le Thi, Tao Pham Dinh, Bich Thuy Nguyen Thi:
DC Programming and DCA for Dictionary Learning. ICCCI (1) 2015: 295-304 - [c37]Thi Thuy Tran, Hoai An Le Thi, Tao Pham Dinh:
DC Programming and DCA for a Novel Resource Allocation Problem in Emerging Area of Cooperative Physical Layer Security. ICCSAMA 2015: 57-68 - [c36]Hoai An Le Thi, Duc Manh Nguyen, Tao Pham Dinh:
A Based-DC Programming Approach for Planning a Multisensor Multizone Search for a Moving Target. MCO (1) 2015: 107-118 - [c35]Phan Duy Nhat, Hoai An Le Thi, Tao Pham Dinh:
A DC Programming Approach for Sparse Estimation of a Covariance Matrix. MCO (1) 2015: 131-142 - [c34]Yi-Shuai Niu, Joaquim Júdice, Hoai An Le Thi, Tao Pham Dinh:
Solving the Quadratic Eigenvalue Complementarity Problem by DC Programming. MCO (1) 2015: 203-214 - [e3]Hoai An Le Thi, Tao Pham Dinh, Ngoc Thanh Nguyen:
Modelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences - MCO 2015, Metz, France, May 11-13, 2015, Part I. Advances in Intelligent Systems and Computing 359, Springer 2015, ISBN 978-3-319-18160-8 [contents] - [e2]Hoai An Le Thi, Tao Pham Dinh, Ngoc Thanh Nguyen:
Modelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences - MCO 2015, Metz, France, May 11-13, 2015, Part II. Advances in Intelligent Systems and Computing 360, Springer 2015, ISBN 978-3-319-18166-0 [contents] - 2014
- [j55]Hoai An Le Thi, Tao Pham Dinh, Moulay Belghiti:
DCA based algorithms for multiple sequence alignment (MSA). Central Eur. J. Oper. Res. 22(3): 501-524 (2014) - [j54]Le Thi Hoai An, Duc Manh Nguyen, Tao Pham Dinh:
A DC programming approach for planning a multisensor multizone search for a target. Comput. Oper. Res. 41: 231-239 (2014) - [j53]Duc Manh Nguyen, Hoai An Le Thi, Tao Pham Dinh:
Solving the Multidimensional Assignment Problem by a Cross-Entropy method. J. Comb. Optim. 27(4): 808-823 (2014) - [j52]Hoai An Le Thi, Ngai Van Huynh, Tao Pham Dinh, A. Ismael F. Vaz, Luís Nunes Vicente:
Globally convergent DC trust-region methods. J. Glob. Optim. 59(2-3): 209-225 (2014) - [j51]Le Thi Hoai An, Manh Cuong Nguyen, Tao Pham Dinh:
A DC Programming Approach for Finding Communities in Networks. Neural Comput. 26(12): 2827-2854 (2014) - [j50]Hoai An Le Thi, Xuan Thanh Vo, Tao Pham Dinh:
Feature selection for linear SVMs under uncertain data: Robust optimization based on difference of convex functions algorithms. Neural Networks 59: 36-50 (2014) - [j49]Le Thi Hoai An, Le Hoai Minh, Pham Dinh Tao:
New and efficient DCA based algorithms for minimum sum-of-squares clustering. Pattern Recognit. 47(1): 388-401 (2014) - [j48]Tao Pham Dinh, Le Hoai Minh, Hoai An Le Thi, Fabien Lauer:
A Difference of Convex Functions Algorithm for Switched Linear Regression. IEEE Trans. Autom. Control. 59(8): 2277-2282 (2014) - [j47]Tao Pham Dinh, Le Thi Hoai An:
Recent Advances in DC Programming and DCA. Trans. Comput. Collect. Intell. 13: 1-37 (2014) - [j46]Hoai An Le Thi, Tao Pham Dinh:
DC programming in communication systems: challenging problems and methods. Vietnam. J. Comput. Sci. 1(1): 15-28 (2014) - [c33]Tao Pham Dinh, Viet Nga Pham, Hoai An Le Thi:
DC Programming and DCA for Portfolio Optimization with Linear and Fixed Transaction Costs. ACIIDS (2) 2014: 392-402 - [c32]Le Thi Hoai An, Tao Pham Dinh, Xuan Thanh Vo:
DC Programming and DCA for Nonnegative Matrix Factorization. ICCCI 2014: 573-582 - [c31]Hoai An Le Thi, Ngai Van Huynh, Tao Pham Dinh:
DC Programming and DCA for General DC Programs. ICCSAMA 2014: 15-35 - [c30]Yi-Shuai Niu, Tao Pham Dinh:
DC Programming Approaches for BMI and QMI Feasibility Problems. ICCSAMA 2014: 37-63 - [i1]Hoai An Le Thi, Tao Pham Dinh, Le Hoai Minh, Xuan Thanh Vo:
DC approximation approaches for sparse optimization. CoRR abs/1407.0286 (2014) - 2013
- [j45]Le Thi Hoai An, Le Hoai Minh, Tao Pham Dinh, Ngai Van Huynh:
Binary classification via spherical separator by DC programming and DCA. J. Glob. Optim. 56(4): 1393-1407 (2013) - [j44]Le Hoai Minh, Le Thi Hoai An, Tao Pham Dinh, Ngai Van Huynh:
Block Clustering Based on Difference of Convex Functions (DC) Programming and DC Algorithms. Neural Comput. 25(10): 2776-2807 (2013) - [j43]Yi-Shuai Niu, Tao Pham Dinh, Hoai An Le Thi, Joaquim João Júdice:
Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem. Optim. Methods Softw. 28(4): 812-829 (2013) - [c29]Le Thi Hoai An, Nguyen Quang Thuan, Khoa Tran Phan, Tao Pham Dinh:
DC Programming and DCA Based Cross-Layer Optimization in Multi-hop TDMA Networks. ACIIDS (2) 2013: 398-408 - [c28]Le Thi Hoai An, Xuan Thanh Vo, Tao Pham Dinh:
Robust Feature Selection for SVMs under Uncertain Data. ICDM 2013: 151-165 - [p2]Hoai An Le Thi, Tao Pham Dinh:
DC Programming Approaches for Distance Geometry Problems. Distance Geometry 2013: 225-290 - [p1]Viet Nga Pham, Hoai An Le Thi, Pham Dinh Tao:
A DC Programming Framework for Portfolio Selection by Minimizing the Transaction Costs. Advanced Computational Methods for Knowledge Engineering 2013: 31-40 - 2012
- [j42]Le Thi Hoai An, Mahdi Moeini, Tao Pham Dinh, Joaquim Júdice:
A DC programming approach for solving the symmetric Eigenvalue Complementarity Problem. Comput. Optim. Appl. 51(3): 1097-1117 (2012) - [j41]Babacar Mbaye Ndiaye, Le Thi Hoai An, Tao Pham Dinh:
Single straddle carrier routing problem in port container terminals: mathematical model and solving approaches. Int. J. Intell. Inf. Database Syst. 6(6): 532-554 (2012) - [j40]Le Thi Hoai An, Pham Dinh Tao, Ngai Van Huynh:
Exact penalty and error bounds in DC programming. J. Glob. Optim. 52(3): 509-535 (2012) - [j39]Le Thi Hoai An, Pham Dinh Tao, Nguyen Dong Yen:
Behavior of DCA sequences for solving the trust-region subproblem. J. Glob. Optim. 53(2): 317-329 (2012) - [j38]Pham Dinh Tao, Shashi Kant Mishra, Nguyen Dong Yen:
Preface. Optim. Lett. 6(2): 219-220 (2012) - [j37]Le Thi Hoai An, Duc Manh Nguyen, Pham Dinh Tao:
Globally solving a nonlinear UAV task assignment problem by stochastic and deterministic optimization approaches. Optim. Lett. 6(2): 315-329 (2012) - [c27]Babacar Mbaye Ndiaye, Le Thi Hoai An, Pham Dinh Tao, Yi-Shuai Niu:
DC Programming and DCA for Large-Scale Two-Dimensional Packing Problems. ACIIDS (2) 2012: 321-330 - [c26]Le Hoai Minh, Le Thi Hoai An, Pham Dinh Tao:
Gaussian Kernel Minimum Sum-of-Squares Clustering and Solution Method Based on DCA. ACIIDS (2) 2012: 331-340 - [c25]Viet Nga Pham, Le Thi Hoai An, Tao Pham Dinh:
Solving Nurse Rostering Problems by a Multiobjective Programming Approach. ICCCI (1) 2012: 544-552 - [c24]Ta Anh Son, Pham Dinh Tao, Le Thi Hoai An, Djamel Khadraoui:
Solving Many to many multicast QoS routing problem using DCA and proximal decomposition technique. ICNC 2012: 809-814 - 2011
- [j36]Le Thi Hoai An, Pham Dinh Tao:
On solving Linear Complementarity Problems by DC programming and DCA. Comput. Optim. Appl. 50(3): 507-524 (2011) - [j35]Tao Pham Dinh, Yi-Shuai Niu:
An efficient DC programming approach for portfolio decision with higher moments. Comput. Optim. Appl. 50(3): 525-554 (2011) - [j34]Pham Dinh Tao, Le Thi Hoai An:
Preface. J. Glob. Optim. 49(3): 363-364 (2011) - [j33]Le Thi Hoai An, Pham Dinh Tao, Nguyen Dong Yen:
Properties of two DC algorithms in quadratic programming. J. Glob. Optim. 49(3): 481-495 (2011) - [c23]Le Hoai Minh, Le Thi Hoai An, Pham Dinh Tao, Ngai Van Huynh:
An Efficient DCA for Spherical Separation. ACIIDS (2) 2011: 421-431 - [c22]Duc Manh Nguyen, Le Thi Hoai An, Pham Dinh Tao:
A Cross-Entropy Method for Value-at-Risk Constrained Optimization. ACIIDS (2) 2011: 442-451 - 2010
- [j32]Le Hoai Minh, Le Thi Hoai An, Pham Dinh Tao, Pascal Bouvry:
A combined DCA: GA for constructing highly nonlinear balanced boolean functions in cryptography. J. Glob. Optim. 47(4): 597-613 (2010) - [j31]Pham Dinh Tao, Nam Nguyen Canh, Le Thi Hoai An:
An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs. J. Glob. Optim. 48(4): 595-632 (2010) - [c21]Ta Anh Son, Le Thi Hoai An, Djamel Khadraoui, Pham Dinh Tao:
Solving Multicast QoS Routing Problem in the Context V2I Communication Services Using DCA. ACIS-ICIS 2010: 471-476 - [c20]Ta Anh Son, Le Thi Hoai An, Djamel Khadraoui, Pham Dinh Tao:
Solving QoS Routing Problems by DCA. ACIIDS (2) 2010: 460-470 - [c19]Mamadou Thiao, Pham Dinh Tao, Le Thi Hoai An:
A DC Programming Approach for Sparse Eigenvalue Problem. ICML 2010: 1063-1070 - [c18]Le Thi Hoai An, Nguyen Trong Phuc, Pham Dinh Tao:
Discrete Tomography Based on DC Programming and DCA. RIVF 2010: 1-6 - [c17]Duc Manh Nguyen, Le Thi Hoai An, Pham Dinh Tao:
A Cross-Entropy Method for Nonlinear UAV Task Assignment Problem. RIVF 2010: 1-5
2000 – 2009
- 2009
- [j30]Hoai An Le Thi, Mahdi Moeini, Tao Pham Dinh:
Portfolio selection under downside risk measures and cardinality constraints based on DC programming and DCA. Comput. Manag. Sci. 6(4): 459-475 (2009) - [j29]Tao Pham Dinh, Nam Nguyen Canh, Hoai An Le Thi:
DC programming and DCA for globally solving the value-at-risk. Comput. Manag. Sci. 6(4): 477-501 (2009) - [j28]Le Thi Hoai An, Pham Dinh Tao, Nam Nguyen Canh, Nguyen V. Thoai:
DC programming techniques for solving a class of nonlinear bilevel programs. J. Glob. Optim. 44(3): 313-337 (2009) - [c16]Le Thi Hoai An, Moulay Belghiti, Pham Dinh Tao:
Multiple Alignment of Sequences by a Continuous Optimisation Approach based on DC Programming and DCA. BIOCOMP 2009: 109-115 - [c15]Le Thi Hoai An, Pham Dinh Tao, Sarra Bouallagui:
Cryptanalysis of an Identification Scheme Based on the Perceptron Problem using a Hybridization of Deterministic Optimization and Genetic Algorithm. Security and Management 2009: 117-123 - [c14]Le Thi Hoai An, Pham Dinh Tao:
Minimum Sum-of-Squares Clustering by DC Programming and DCA. ICIC (2) 2009: 327-340 - [c13]Le Thi Hoai An, Nguyen Quang Thuan, Nguyen Huynh Tuong, Pham Dinh Tao:
A time-indexed formulation of earliness tardiness scheduling via DC programming and DCA. IMCSIT 2009: 779-784 - [c12]Le Thi Hoai An, Le Hoai Minh, Pham Dinh Tao, Pascal Bouvry:
Solving the Perceptron Problem by deterministic optimization approach based on DC programming and DCA. INDIN 2009: 222-226 - 2008
- [j27]Le Thi Hoai An, Pham Dinh Tao, Gunter Ritter:
Preface for the special issue of ADAC on 'Optimisation and Non-Convex Programming in Data Mining'. Adv. Data Anal. Classif. 2(3): 209-210 (2008) - [j26]Le Thi Hoai An, Le Hoai Minh, Van Vinh Nguyen, Pham Dinh Tao:
A DC programming approach for feature selection in support vector machines learning. Adv. Data Anal. Classif. 2(3): 259-278 (2008) - [j25]Le Thi Hoai An, Pham Dinh Tao:
A continuous approach for the concave cost supply problem via DC programming and DCA. Discret. Appl. Math. 156(3): 325-338 (2008) - [j24]Tao Pham Dinh, Hoai An Le Thi, F. Akoa:
Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming. Optim. Methods Softw. 23(4): 609-629 (2008) - [c11]Le Thi Hoai An, Le Hoai Minh, Nguyen Trong Phuc, Pham Dinh Tao:
Noisy Image Segmentation by a Robust Clustering Algorithm Based on DC Programming and DCA. ICDM 2008: 72-86 - [c10]Babacar Mbaye Ndiaye, Pham Dinh Tao, Le Thi Hoai An:
Single Straddle Carrier Routing Problem in Port Container Terminals: Mathematical Model and Solving Approaches. MCO 2008: 21-31 - [c9]Yi-Shuai Niu, Pham Dinh Tao:
A DC Programming Approach for Mixed-Integer Linear Programs. MCO 2008: 244-253 - [c8]Mamadou Thiao, Pham Dinh Tao, Le Thi Hoai An:
DC Programming Approach for a Class of Nonconvex Programs Involving l0 Norm. MCO 2008: 348-357 - [c7]Sarra Bouallagui, Le Thi Hoai An, Pham Dinh Tao:
Design of Highly Nonlinear Balanced Boolean Functions Using an Hybridation of DCA and Simulated Annealing Algorithm. MCO 2008: 579-588 - [c6]Le Thi Hoai An, Babacar Mbaye Ndiaye, Pham Dinh Tao:
Solving a multimodal transport problem by DCA. RIVF 2008: 49-56 - [c5]Le Thi Hoai An, Le Hoai Minh, Van Vinh Nguyen, Pham Dinh Tao:
Combined feature selection and classification using DCA. RIVF 2008: 233-239 - [e1]Le Thi Hoai An, Pascal Bouvry, Pham Dinh Tao:
Modelling, Computation and Optimization in Information Systems and Management Sciences, Second International Conference, MCO 2008, Metz, France - Luxembourg, September 8-10, 2008. Proceedings. Communications in Computer and Information Science 14, Springer 2008, ISBN 978-3-540-87476-8 [contents] - 2007
- [j23]Le Thi Hoai An, Le Hoai Minh, Pham Dinh Tao:
Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms. Adv. Data Anal. Classif. 1(2): 85-104 (2007) - [j22]Le Thi Hoai An, Pham Dinh Tao, Nguyen V. Thoai:
Editorial. Eur. J. Oper. Res. 183(3): 949 (2007) - [j21]Le Thi Hoai An, Nguyen Trong Phuc, Pham Dinh Tao:
A continuous DC programming approach to the strategic supply chain design problem from qualified partner set. Eur. J. Oper. Res. 183(3): 1001-1012 (2007) - [j20]Le Thi Hoai An, Le Hoai Minh, Pham Dinh Tao:
Optimization based DC programming and DCA for hierarchical clustering. Eur. J. Oper. Res. 183(3): 1067-1085 (2007) - [j19]Le Thi Hoai An, M. Tayeb Belghiti, Pham Dinh Tao:
A new efficient algorithm based on DC programming and DCA for clustering. J. Glob. Optim. 37(4): 593-608 (2007) - [j18]Akoa François, Hachemi Abdelkader, Le Thi Hoai An, Mouhtamid Said, Pham Dinh Tao:
Application of lower bound direct method to engineering structures. J. Glob. Optim. 37(4): 609-630 (2007) - [c4]Le Thi Hoai An, Le Hoai Minh, Pham Dinh Tao:
Une nouvelle approche de la programmation DC et DCA pour la classification floue. EGC 2007: 703-714 - 2006
- [c3]Le Hoai Minh, Le Thi Hoai An, Tao Pham Dinh, Pascal Bouvry:
A Deterministic Optimization Approach for Generating Highly Nonlinear Balanced Boolean Functions in Cryptography. HPSC 2006: 381-391 - [c2]Nguyen Nam, Le Thi Hoai An, Pham Dinh Tao:
A Branch and Bound Algorithm Based on DC Programming and DCA for Strategic Capacity Planning in Supply Chain Design for a New Market Opportunity. OR 2006: 515-520 - [c1]Le Hoai Minh, Le Thi Hoai An, Pham Dinh Tao:
Hierarchical Clustering Based on Mathematical Optimization. PAKDD 2006: 160-173 - 2005
- [j17]Le Thi Hoai An, Pham Dinh Tao:
The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization Problems. Ann. Oper. Res. 133(1-4): 23-46 (2005) - 2003
- [j16]Le Thi Hoai An, Pham Dinh Tao, Dinh Nho Hào:
Solving an Inverse Problem for an Elliptic Equation by d.c. Programming. J. Glob. Optim. 25(4): 407-423 (2003) - [j15]Le Thi Hoai An, Pham Dinh Tao:
Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach. SIAM J. Optim. 14(1): 77-114 (2003) - 2002
- [j14]Le Thi Hoai An, Pham Dinh Tao, Nguyen V. Thoai:
Combination between global and local methods for solving an optimization problem over the efficient set. Eur. J. Oper. Res. 142(2): 258-270 (2002) - [j13]Le Thi Hoai An, Pham Dinh Tao:
D.C. programming approach for multicommodity network optimization problems with step increasing cost functions. J. Glob. Optim. 22(1-4): 205-232 (2002)
1990 – 1999
- 1998
- [j12]Le Thi Hoai An, Pham Dinh Tao, Le Dung Muu:
A Combined D.C. Optimization - Ellipsoidal Branch-and-Bound Algorithm for Solving Nonconvex Quadratic Programming Problems. J. Comb. Optim. 2(1): 9-28 (1998) - [j11]Le Thi Hoai An, Pham Dinh Tao:
A Branch and Bound Method via d.c. Optimization Algorithms and Ellipsoidal Technique for Box Constrained Nonconvex Quadratic Problems. J. Glob. Optim. 13(2): 171-206 (1998) - [j10]Pham Dinh Tao, Le Thi Hoai An:
A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem. SIAM J. Optim. 8(2): 476-505 (1998) - 1997
- [j9]Le Thi Hoai An, Pham Dinh Tao:
Solving a Class of Linearly Constrained Indefinite Quadratic Problems by D.C. Algorithms. J. Glob. Optim. 11(3): 253-285 (1997) - 1996
- [j8]Le Thi Hoai An, Pham Dinh Tao, Le Dung Muu:
Numerical solution for optimization over the efficient set by d.c. optimization algorithms. Oper. Res. Lett. 19(3): 117-128 (1996) - [j7]Pham Dinh Tao, Le Thi Hoai An:
Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres. Oper. Res. Lett. 19(5): 207-216 (1996) - 1995
- [j6]Le Dung Muu, Thai Quynh Phong, Pham Dinh Tao:
Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions. Comput. Optim. Appl. 4(3): 203-216 (1995) - [j5]Thai Quynh Phong, Radu Horaud, Adnan Yassine, Pham Dinh Tao:
Object pose from 2-D to 3-D point and line correspondences. Int. J. Comput. Vis. 15(3): 225-243 (1995) - [j4]Thai Quynh Phong, Pham Dinh Tao, Le Thi Hoai An:
A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem. J. Glob. Optim. 6(1): 87-105 (1995) - [j3]Thai Quynh Phong, Le Thi Hoai An, Pham Dinh Tao:
Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems. Oper. Res. Lett. 17(5): 215-220 (1995) - [j2]Philippe Mahey, Said Oualibouch, Pham Dinh Tao:
Proximal Decomposition on the Graph of a Maximal Monotone Operator. SIAM J. Optim. 5(2): 454-466 (1995)
1980 – 1989
- 1988
- [j1]Pham Dinh Tao, Souad El Bernoussi:
Iterative behaviour, fixed point of a class of monotone operators. Application to non-symmetric threshold function. Discret. Math. 70(1): 85-101 (1988)
1970 – 1979
- 1972
- [b1]Tao Pham Dinh:
Etude d'une classe de normes dans les espaces vectoriels à dimension finie générées par les normes des espaces fonctionnels de Banach. Joseph Fourier University, Grenoble, France, 1972
Coauthor Index
Le Thi Hoai An
aka: Hoai An Le Thi
aka: Hoai An Le Thi
[j84] [j83] [j82] [j81] [j80] [j79] [j78] [j77] [j76] [e6] [j75] [j74] [j73] [e5] [e4] [j71] [j70] [c44] [c43] [i2] [j69] [j68] [j67] [j66] [j65] [j64] [j63] [j62] [c42] [c41] [j61] [j60] [j59] [j58] [c40] [c39] [j57] [j56] [c38] [c37] [c36] [c35] [c34] [e3] [e2] [j55] [j54] [j53] [j52] [j51] [j50] [j49] [j48] [j47] [j46] [c33] [c32] [c31] [i1] [j45] [j44] [j43] [c29] [c28] [p2] [p1] [j42] [j41] [j40] [j39] [j37] [c27] [c26] [c25] [c24] [j36] [j34] [j33] [c23] [c22] [j32] [j31] [c21] [c20] [c19] [c18] [c17] [j30] [j29] [j28] [c16] [c15] [c14] [c13] [c12] [j27] [j26] [j25] [j24] [c11] [c10] [c8] [c7] [c6] [c5] [e1] [j23] [j22] [j21] [j20] [j19] [j18] [c4] [c3] [c2] [c1] [j17] [j16] [j15] [j14] [j13] [j12] [j11] [j10] [j9] [j8] [j7] [j4] [j3]
Le Hoai Minh
aka: Hoai Minh Le
aka: Hoai Minh Le
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
