IDEAS home Printed from https://ideas.repec.org/f/ple493.html
   My authors  Follow this author

Hoai An Le Thi

Personal Details

First Name:Hoai An
Middle Name:
Last Name:Le Thi
Suffix:
RePEc Short-ID:ple493
[This author has chosen not to make the email address public]
http://lita.sciences.univ-metz.fr/~lethi/index.html

Affiliation

université Paul Verlaine - Metz (Paul Verlaine university of Metz)

http://www.univ-metz.fr/
Metz, France

Research output

as
Jump to: Articles

Articles

  1. Hoai Le & Hoai Le Thi & Tao Pham Dinh & Pascal Bouvry, 2010. "A combined DCA: GA for constructing highly nonlinear balanced boolean functions in cryptography," Journal of Global Optimization, Springer, vol. 47(4), pages 597-613, August.
  2. Tao Pham Dinh & Nam Nguyen Canh & Hoai Le Thi, 2010. "An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs," Journal of Global Optimization, Springer, vol. 48(4), pages 595-632, December.
  3. Tao Pham Dinh & Nguyen Nam & Hoai Le Thi, 2009. "DC programming and DCA for globally solving the value-at-risk," Computational Management Science, Springer, vol. 6(4), pages 477-501, October.
  4. Hoai Le Thi & Mahdi Moeini & Tao Pham Dinh, 2009. "Portfolio selection under downside risk measures and cardinality constraints based on DC programming and DCA," Computational Management Science, Springer, vol. 6(4), pages 459-475, October.
  5. Hoai Le Thi & Tao Pham Dinh & Gunter Ritter, 2008. "Preface for the special issue of ADAC on ‘Optimisation and Non-Convex Programming in Data Mining’," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 2(3), pages 209-210, December.
  6. Hoai Le Thi & Hoai Le & Van Nguyen & Tao Pham Dinh, 2008. "A DC programming approach for feature selection in support vector machines learning," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 2(3), pages 259-278, December.
  7. Hoai An, Le Thi & Phuc, Nguyen Trong & Tao, Pham Dinh, 2007. "A continuous DC programming approach to the strategic supply chain design problem from qualified partner set," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1001-1012, December.
  8. Hoai An, Le Thi & Minh, Le Hoai & Tao, Pham Dinh, 2007. "Optimization based DC programming and DCA for hierarchical clustering," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1067-1085, December.
  9. An, Le Thi Hoai & Tao, Pham Dinh & Thoai, Nguyen Van, 2007. "Editorial," European Journal of Operational Research, Elsevier, vol. 183(3), pages 949-949, December.
  10. Le Thi, Hoai An & Pham, Dinh Tao & Thoai, Nguyen V., 2002. "Combination between global and local methods for solving an optimization problem over the efficient set," European Journal of Operational Research, Elsevier, vol. 142(2), pages 258-270, October.

Citations

Many of the citations below have been collected in an experimental project, CitEc, where a more detailed citation analysis can be found. These are citations from works listed in RePEc that could be analyzed mechanically. So far, only a minority of all works could be analyzed. See under "Corrections" how you can help improve the citation analysis.

Articles

  1. Hoai Le & Hoai Le Thi & Tao Pham Dinh & Pascal Bouvry, 2010. "A combined DCA: GA for constructing highly nonlinear balanced boolean functions in cryptography," Journal of Global Optimization, Springer, vol. 47(4), pages 597-613, August.

    Cited by:

    1. Hoai Le Thi & Tao Pham Dinh & Huynh Ngai, 2012. "Exact penalty and error bounds in DC programming," Journal of Global Optimization, Springer, vol. 52(3), pages 509-535, March.

  2. Tao Pham Dinh & Nam Nguyen Canh & Hoai Le Thi, 2010. "An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs," Journal of Global Optimization, Springer, vol. 48(4), pages 595-632, December.

    Cited by:

    1. Yitian Qian & Shaohua Pan & Shujun Bi, 2023. "A matrix nonconvex relaxation approach to unconstrained binary polynomial programs," Computational Optimization and Applications, Springer, vol. 84(3), pages 875-919, April.
    2. Tao Pham Dinh & Yi-Shuai Niu, 2011. "An efficient DC programming approach for portfolio decision with higher moments," Computational Optimization and Applications, Springer, vol. 50(3), pages 525-554, December.
    3. Hoai Le Thi & Tao Pham Dinh & Huynh Ngai, 2012. "Exact penalty and error bounds in DC programming," Journal of Global Optimization, Springer, vol. 52(3), pages 509-535, March.
    4. Gili Rosenberg & Mohammad Vazifeh & Brad Woods & Eldad Haber, 2016. "Building an iterative heuristic solver for a quantum annealer," Computational Optimization and Applications, Springer, vol. 65(3), pages 845-869, December.
    5. Mohand Bentobache & Mohamed Telli & Abdelkader Mokhtari, 2022. "New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming," Journal of Global Optimization, Springer, vol. 82(4), pages 659-689, April.
    6. Gary Kochenberger & Jin-Kao Hao & Fred Glover & Mark Lewis & Zhipeng Lü & Haibo Wang & Yang Wang, 2014. "The unconstrained binary quadratic programming problem: a survey," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 58-81, July.
    7. Hoai An Le Thi & Thi Tuyet Trinh Nguyen & Hoang Phuc Hau Luu, 2022. "A DC programming approach for solving a centralized group key management problem," Journal of Combinatorial Optimization, Springer, vol. 44(5), pages 3165-3193, December.
    8. Le Thi, H.A. & Pham Dinh, T. & Le, H.M. & Vo, X.T., 2015. "DC approximation approaches for sparse optimization," European Journal of Operational Research, Elsevier, vol. 244(1), pages 26-46.

  3. Hoai Le Thi & Mahdi Moeini & Tao Pham Dinh, 2009. "Portfolio selection under downside risk measures and cardinality constraints based on DC programming and DCA," Computational Management Science, Springer, vol. 6(4), pages 459-475, October.

    Cited by:

    1. Hoai An Le Thi & Mahdi Moeini, 2014. "Long-Short Portfolio Optimization Under Cardinality Constraints by Difference of Convex Functions Algorithm," Journal of Optimization Theory and Applications, Springer, vol. 161(1), pages 199-224, April.
    2. Mahdi Moeini, 2022. "Solving the index tracking problem: a continuous optimization approach," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 30(2), pages 807-835, June.

  4. Hoai Le Thi & Hoai Le & Van Nguyen & Tao Pham Dinh, 2008. "A DC programming approach for feature selection in support vector machines learning," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 2(3), pages 259-278, December.

    Cited by:

    1. Guan, Wei & Gray, Alexander, 2013. "Sparse high-dimensional fractional-norm support vector machine via DC programming," Computational Statistics & Data Analysis, Elsevier, vol. 67(C), pages 136-148.
    2. Hoai Le Thi & Hoai Le & Tao Pham Dinh & Ngai Van Huynh, 2013. "Binary classification via spherical separator by DC programming and DCA," Journal of Global Optimization, Springer, vol. 56(4), pages 1393-1407, August.
    3. Hoai Le Thi & Tao Pham Dinh & Huynh Ngai, 2012. "Exact penalty and error bounds in DC programming," Journal of Global Optimization, Springer, vol. 52(3), pages 509-535, March.
    4. Hoai An Le Thi & Manh Cuong Nguyen, 2017. "DCA based algorithms for feature selection in multi-class support vector machine," Annals of Operations Research, Springer, vol. 249(1), pages 273-300, February.
    5. Jun Sun & Wentao Qu, 2022. "DCA for Sparse Quadratic Kernel-Free Least Squares Semi-Supervised Support Vector Machine," Mathematics, MDPI, vol. 10(15), pages 1-17, August.
    6. Paola Cerchiello & Paolo Giudici, 2012. "Non parametric statistical models for on-line text classification," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 6(4), pages 277-288, December.
    7. Liming Yang & Laisheng Wang, 2013. "A class of semi-supervised support vector machines by DC programming," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 7(4), pages 417-433, December.
    8. Le Thi, H.A. & Pham Dinh, T. & Le, H.M. & Vo, X.T., 2015. "DC approximation approaches for sparse optimization," European Journal of Operational Research, Elsevier, vol. 244(1), pages 26-46.
    9. Welington Oliveira, 2020. "Sequential Difference-of-Convex Programming," Journal of Optimization Theory and Applications, Springer, vol. 186(3), pages 936-959, September.

  5. Hoai An, Le Thi & Phuc, Nguyen Trong & Tao, Pham Dinh, 2007. "A continuous DC programming approach to the strategic supply chain design problem from qualified partner set," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1001-1012, December.

    Cited by:

    1. Thanh, Phuong Nga & Bostel, Nathalie & Péton, Olivier, 2012. "A DC programming heuristic applied to the logistics network design problem," International Journal of Production Economics, Elsevier, vol. 135(1), pages 94-105.

  6. Hoai An, Le Thi & Minh, Le Hoai & Tao, Pham Dinh, 2007. "Optimization based DC programming and DCA for hierarchical clustering," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1067-1085, December.

    Cited by:

    1. Hoai Le Thi & Hoai Le & Tao Pham Dinh & Ngai Van Huynh, 2013. "Binary classification via spherical separator by DC programming and DCA," Journal of Global Optimization, Springer, vol. 56(4), pages 1393-1407, August.
    2. Hoai Le Thi & Tao Pham Dinh & Huynh Ngai, 2012. "Exact penalty and error bounds in DC programming," Journal of Global Optimization, Springer, vol. 52(3), pages 509-535, March.
    3. Hoai An Le Thi & Manh Cuong Nguyen, 2017. "DCA based algorithms for feature selection in multi-class support vector machine," Annals of Operations Research, Springer, vol. 249(1), pages 273-300, February.
    4. Jun Sun & Wentao Qu, 2022. "DCA for Sparse Quadratic Kernel-Free Least Squares Semi-Supervised Support Vector Machine," Mathematics, MDPI, vol. 10(15), pages 1-17, August.
    5. Hoai Le Thi & Hoai Le & Van Nguyen & Tao Pham Dinh, 2008. "A DC programming approach for feature selection in support vector machines learning," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 2(3), pages 259-278, December.
    6. Le Thi, H.A. & Pham Dinh, T. & Le, H.M. & Vo, X.T., 2015. "DC approximation approaches for sparse optimization," European Journal of Operational Research, Elsevier, vol. 244(1), pages 26-46.

  7. Le Thi, Hoai An & Pham, Dinh Tao & Thoai, Nguyen V., 2002. "Combination between global and local methods for solving an optimization problem over the efficient set," European Journal of Operational Research, Elsevier, vol. 142(2), pages 258-270, October.

    Cited by:

    1. Le An & Pham Tao, 2005. "The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization Problems," Annals of Operations Research, Springer, vol. 133(1), pages 23-46, January.
    2. Zerdani, Ouiza & Moulai, Mustapha, 2011. "Optimization over an integer efficient set of a Multiple Objective Linear Fractional Problem," MPRA Paper 35579, University Library of Munich, Germany.
    3. R. Horst & N. V. Thoai & Y. Yamamoto & D. Zenke, 2007. "On Optimization over the Efficient Set in Linear Multicriteria Programming," Journal of Optimization Theory and Applications, Springer, vol. 134(3), pages 433-443, September.
    4. M. V. Dolgopolik, 2022. "DC Semidefinite programming and cone constrained DC optimization I: theory," Computational Optimization and Applications, Springer, vol. 82(3), pages 649-671, July.
    5. Le Thi, H.A. & Pham Dinh, T. & Le, H.M. & Vo, X.T., 2015. "DC approximation approaches for sparse optimization," European Journal of Operational Research, Elsevier, vol. 244(1), pages 26-46.

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. For general information on how to correct material on RePEc, see these instructions.

To update listings or check citations waiting for approval, Hoai An Le Thi should log into the RePEc Author Service.

To make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.

To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.

Please note that most corrections can take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.