Lê Dũng Mưu


GS. TSKH. NCVCC

Phòng Tối ưu và điều khiển
Hướng nghiên cứu: Tối ưu hóa, bất đẳng thức biến phân, các bài toán cân bằng


Liên hệ
Phòng làm việc: 210, Nhà A5
Điện thoại: +84 (0)4 37563474/210
Email: ldmuu AT math.ac.vn

Lý lịch khoa học

Năm sinh:   1949
Nơi sinh: Thanh Hóa

  • Đại học: 1973 tại  Trường Đại học Khoa học Budapest, Hungary
  • Tiến sĩ khoa học:  1999, Viện Toán học, Viện Hàn lâm khoa học, Việt Nam
  • Phó giáo sư: năm phong: 1996
  • Giáo sư: năm phong: 2003


Chuyên ngành: Tối ưu hóa

Các vị trí công tác đã qua:  Trưởng phòng Tối ưu

Các lĩnh vực quan tâm: Tối ưu hóa, bất đẳng thức biến phân, các bài toán cân bằng

DANH SÁCH CÔNG TRÌNH



Danh sách trong Mathscinet

 

 

Danh sách gần đây
1Le Quang Thuy, Pham Ky Anh, Lê Dũng Mưu, Trinh Ngoc Hai, Novel Hybrid Methods for Pseudomonotone Equilibrium Problems and Common Fixed Point Problems, Numerical Functional Analysis and Optimization, 38 (2017), 443–465.
2Pham Ky Anh, Tran Viet Anh, Lê Dũng Mưu, On Bilevel Split Pseudomonotone Variational Inequality Problems with Applications, Acta Mathematica Vietnamica, 42 (2017), 413–429.
3Dang Van Hieu, Pham Ky Anh, Lê Dũng Mưu, Modified hybrid projection methods for finding common solutions to variational inequality problems, Computational Optimization and Applications, 66 (2017), 75–96.
4Phung Minh Duc , Lê Dũng Mưu, A splitting algorithm for a class of bilevel equilibrium problems involving nonexpansive mappings, Optimization, 65 (2016), 1855-1866.
5Lê Hải Yến, Lê Dũng Mưu, Nguyen Thi Thanh Huyen, An algorithm for a class of split feasibility problems: application to a model in electricity production, Mathematical Methods of Operations Research, 84, (2016), 549-565.
6Phung Minh Duc, Lê Dũng Mưu, Nguyen Van Quy, Solution-Existence and Algorithms with Their Convergence Rate for Strongly Pseudomonotone Equilibrium Problems, Pacific Journal of Optimization12 (2016), 833-845.
7Dang Van Hieu, Lê Dũng Mưu, Pham Ky Anh, Parallel hybrid extragradient methods for pseudomonotone equilibrium problems and nonexpansive mappings, Numerical Algorithms, 73 (2016), 197-217.
8Tran Viet Anh, Lê Dũng Mưu, A projection-fixed point method for a class of bilevel variational inequalities with split fixed point constraints. Optimization 65 (2016), 1229–1243.
9Le Quang Thuy, Lê Dũng Mưu, A Hybrid method for a system involving equilibrium problems, variational inequalitíes and nonexpansive semigroup, Journal of the Korean Mathematical Society, 28 (2015), 457-478.
10Bui Van Dinh, Lê Dũng Mưu, A projection algorithm for solving pseudomonotone equilibrium problems and its application to a class of bilevel equilibria, Optimization 64 (2015), 559–575.
11Nguyen Kieu Linh, Lê Dũng Mưu, A convex hull algorithm for solving a location problem. RAIRO - Operations Research 49 (2015), 589–600.
12Lê Dũng Mưu, Nguyen Van Quy, On Existence and Solution Methods for Strongly Pseudomonotone Equilibrium Problems, Vietnam Journal of Mathematics, 43(2015), 229-238.
13Lê Dũng Mưu, Le Quang Thuy, DC optimization algorithms for solving mimax flow problems, Mathematical Methods of Operations Research, 80 (2014), 83-97.
14Bui Van Dinh, Pham Gia Hung, Lê Dũng Mưu, Bilevel optimization as a regularization approach to pseudomonotone equilibrium problems. Numer. Funct. Anal. Optim. 35 (2014), 539–563.
15P. N. Anh, Lê Dũng Mưu, A hybrid subgradient algorithm for nonexpansive mappings and equilibrium problems, Optim. Lett. 8 (2014), 727–738.
16Lê Dũng Mưu, Bui Van Dinh, Algorithms for a class of bilevel programs involving pseudomonotone variational inequalities, Acta Mathematica Vietnamica 38 (2013), 529 - 540.
17Lê Dũng Mưu, Pham Gia Hung, On  inexact Tikhonov and proximal point regularization methods for solving pseudomonotone equilibrium problems,  Vietnam Journal of Mathematics,  40 (2012), 255 -- 274.
18Lê Dũng Mưu, Q. Tran Dinh, L. T. H. An and P. D. Tao, A New decomposition algorithms for globally solving mathematical programs with affine equilibrium constraints,  Acta Math. Viet., 37 (2012), 201 -- 217.
19Lê Dũng Mưu, Bui Van Dinh, On Penalty and gap function methods for bilevel pseudomonotone equilibrium problems,  Journal of Applied Mathematics, 2011 (2011), 14p.
20Lê Dũng Mưu, Tran D. Quoc and Pham N. Anh, Dual extragradient algorithms extendeded to equilibrium problems,  J. Glob. Optim., 52 (2012), 139 -- 159.
21Tran D. Quoc, Lê Dũng Mưu, Iterative methods for solving equilibrium problems via dual gap function,  Computtational Optimization and Applications, 51 (2012), 709 -- 728.
22Lê Dũng Mưu, Pham N. Anh and J. Kim, An extragradient algorithm for solving pseudomonotone variational inequalities,  J. Glob. Optim., 52 (2012), 252 -- 269.
23Lê Dũng Mưu, L. Q. Thuy, Smooth optimization algorithms for optimizing over the Pareto efficient set and their application to minmax flow problem,  Vietnam Journal of Math.  39 (2011), 31 - 48.
24Lê Dũng Mưu, P. G. Hung, The Tikhonov regularization extended to equilibrium problems involving pseudomonotone bifunctions,  Nonlinear Analyzis: Theory, Methods & Applications, 74 (2011), 6121 - 6129.
25Lê Dũng Mưu, Tran Dinh Quoc, A splitting proximal method Nash-Cournot equilibrium models involving nonconvex cost functions,  Journal of Nonlinear and Convex Analysis 12, 501 -- 519.
26Lê Dũng Mưu, D. X. Luong, Combining the projection method and the penalty function to solve the variational inequalities with monotone mappings, J. Optim. Theory Appl., 147 (2010), 124 -- 137.
27Lê Dũng Mưu, T. D. Quoc, One step from DC optimization to DC mixed variational inequalities,Optimization, 59 (2010), 63 -- 76.
28Lê Dũng Mưu, L. T. H. An, P. D. Tao and N. C. Nam), Methods for optimization over the efficient and weakly efficient sets of an affine fractional vector optimization program, Optimization, 59 (2010), 77 -- 93.
29Lê Dũng Mưu, T. D. Quoc, Regularization algorithms for solving monotone Ky Fan inequalities with application to a Nash-Cournot equilibria model, J. Optimization Theory and Application, 142 (2009), 185-204.
30Lê Dũng Mưu, P.N.Anh and J-J. Strodiot, Generalized projection method for non-Lipschitz multivalued monotone variational inequalities, Acta Math. Vietnamica, 34 (2009), 67-80.
31Lê Dũng Mưu, N. V. Hien and N. V. Quy, On Nash-Cournot oligopolistic market equilibrium models with concave cost functions, J. Global Optim. 41 (2008), 351 - 364.
32T. D. Quoc, Lê Dũng Mưu, and N. V. Hien, Extragradient algorithms extended to equilibrium problems, Optimization 57 (2008), 749 - 776.
33Lê Dũng Mưu, Nguyen Van Quy, On branch-and-bound algorithms for global optimal solutions to mathematical programs with affine equilibrium constraints, Vietnam J. Math. 35 (2007),  523 - 539.
34Pham Ngoc Anh, Lê Dũng Mưu, Contraction mapping fixed point algorithms for solving multivalued mixed variational inequalities,  Optimization with multivalued mappings, 231 - 249, Springer Optim. Appl. 2, Springer, New York, 2006.
35Pham Ngoc Anh, Lê Dũng Mưu, Lagrangian duality algorithms for finding a global optimal solution to mathematical programs with affine equilibrium constraints, Nonlinear Dyn. Syst. Theory 6 (2006), N0 3, 225 - 244.
36 P. N. Anh, Lê Dũng Mưu, V. H. Nguyen, J. J. Strodiot, Using the Banach contraction principle to implement the proximal point method for multivalued monotone variational inequalities. J. Optim. Theory Appl. 124 (2005),  285–306.
37Pham Ngoc Anh, Lê Dũng Mưu, Van Hien Nguyen, Jean-Jacques Strodiot, On the contraction and nonexpansiveness properties of the marginal mappings in generalized variational inequalities involving co-coercive operators. In: Generalized convexity, generalized monotonicity and applications, 89-111, Nonconvex Optim. Appl. 77, Springer, New York, 2005.
38Tran Dinh Quoc, Lê Dũng Mưu, Implementable quadratic regularization methods for solving pseudomonotone equilibrium problems. East-West J. Math. 6 (2004), 101–123.
39Pham Ngoc Anh, Lê Dũng Mưu, Coupling the Banach contraction mapping principle and the proximal point algorithm for solving monotone variational inequalities,Acta Math. Vietnam. 29 (2004), 119 - 133.
40H.A. Le Thi, T. Pham Dinh, Lê Dũng Mưu, Simplicially-constrained DC optimization over efficient and weakly efficient sets, J. Optim. Theory Appl. 117 (2003), 503 - 531.
41Lê Dũng Mưu, Nguyen Van Quy, A global optimization method for solving convex quadratic bilevel programming problems, J. Global Optim. 26 (2003), 199 - 219.
42Lê Dũng Mưu, Hoang Quang Tuyen, Bilinear programming approach to optimization over the efficient set of a vector affine fractional problem, Acta Math. Vietnam. 27 (2002), 119 - 139.
43Lê Dũng Mưu, Nguyen Van Quy, Methods for finding global optimal solutions to linear programs with equilibrium constraintsVietnam J. Math. 30 (2002), 189 - 194.
44Nguyen Thi Bach Kim, Lê Dũng Mưu, On the projection of the efficient set and potential applications, Optimization 51 (2002), 401 - 421.
45Nguyen Van Quy, Lê Dũng Mưu, On penalty function method for a class of nonconvex constrained optimization problems. Vietnam J. Math. 29 (2001), 235 - 256.
46Lê Dũng Mưu, Nguyen Van Quy, Methods for finding global optimal solutions to linear programs with equilibrium constraints. Dedicated to Pham Huu Sach on the occasion of his sixtieth birthday. Acta Math. Vietnam. 26 (2001), 333 - 347.
47Lê Dũng Mưu, Werner. Oettli, Optimization over equilibrium sets. In celebration of Prof. Dr. Alfred Gopfert 65th birthday. Optimization 49 (2001), N0 1-2, 179 - 189.
48Hoang Q. Tuyen, Lê Dũng Mưu, Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem. Oper. Res. Lett. 28 (2001), 81 - 92.
49Lê Dũng Mưu, On the construction of initial polyhedral convex set for optimization problems over the efficient set and bilevel linear programsVietnam J. Math. 28 (2000), 177 - 182.
50J. Fülöp, Lê Dũng Mưu, Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem. J. Optim. Theory Appl. 105 (2000), 37 - 54.
51Lê Dũng Mưu, A convex-concave programming method for optimizing over the efficient set. Acta Math. Vietnam. 25 (2000), 67 - 85.
52Le Thi Hoai An, Pham Dinh Tao, Lê Dũng Mưu, Exact penalty in DC programming. Vietnam J. Math. 27 (1999), 169 - 178.
53Le Thi Hoai An, Pham Dinh Tao, Lê Dũng Mưu, A combined D.C. optimization-ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems. J. Comb. Optim. 2 (1998), 9 - 28.
54Le Tu Luc, Lê Dũng Mưu, Global optimization approach to optimization over the efficient set. In: the Proceeding of 8th French-German Conference on Optimization. Springer Verlag, Berlin, 1997, 213 - 221.
55Lê Dũng Mưu, N. V. Tien, A relaxation algorithm for solving mixed integer programming problems. Acta Math. Vietnam. 22 (1997), 367 - 378.
56Lê Dũng Mưu, Le Tu Luc, On equivalence between convex maximization and optimization over the efficient set. Vietnam J. Math. 24 (1996), 439 - 445.
57Le Thi Hoai An, Pham Dinh Tao, Lê Dũng Mưu, Numerical solution for optimization over the efficient set by D. C. optimization algorithm. Operations Research Letters 19 (1996), 117 - 128.
58Nguyen Dinh Dan, Lê Dũng Mưu, Parametric simplex method for optimizing a linear function over the efficient set of a bicriteria linear problem. Acta Math. Vietnam. 21 (1996), 59 - 67.
59Nguyen Anh Tuan, Lê Dũng Mưu, Pham Canh Duong, A decomposition method for finding a global optimal solution to a water distribution network. Acta Math. Vietnam. 21 (1996), 309 - 333.
60Lê Dũng Mưu, Computational aspects of optimization over the efficient set. Vietnam J. Math. 23 (1995), 85 - 106.
61Lê Dũng Mưu, Thai Quynh Phong, Pham Dinh Tao, Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic function. Comput. Optim. Appl. 4 (1995), 203 - 216.
62Lê Dũng Mưu, Bui The Tam, S. Schaible, Efficient algorithms for solving certain nonconvex optimization problems dealing with the product of two affine fractional functions. J. Global Optim. 6 (1995), 179 - 191.
63Lê Dũng Mưu, Bui The Tam, Efficient methods for solving certain bilinear programming problems. Acta Math. Vietnam. 19(1994), 97 - 110.
64R. Horst, Lê Dũng Mưu, M. Nast, Branch-and-bound decomposition approach for solving quasiconvex-concave programs. J. Optim. Theory Appl. 82 (1994), 267 - 293.
65Lê Dũng Mưu, Convex-concave programming as a decomposition approach to global optimization. Acta Math. Vietnam. 18 (1993), 61 - 77.
66W. Oettli, Lê Dũng Mưu, Combimed branch-and-bound and cutting plane method for solving a certain class of nonconvex optimization problems. J. Global Optim. 3 (1993), 377 - 391.
67Lê Dũng Mưu, An algorithm for solving convex programs with an additional convex-concave constraint. Math. Programming 61 (1993), 75 - 87.
68Lê Dũng Mưu, Bui The Tam, Minimizing the sum of a convex function and the product of two affine functions over a convex set. Optimization 24 (1992), 57 - 62.
69Lê Dũng Mưu, W. Oettli, Convergence of an adaptive penalty method for monotone variational inequalities and convex optimization. Nonlinear Analysis: Theory, Methods and Applications 18 (1992), 1159 - 1166.
70Lê Dũng Mưu, On a Lagrangian penalty function method for convex programs. Appl. Math. Optim. 25 (1992), 1 - 9.
71Lê Dũng Mưu, W. Oettli, An algorithm for indefinite quadratic programming with convex constraints. Operations Resarch Letters 10 (1991), 323 - 327.
72Lê Dũng Mưu, W. Oettli, A method for minimizing a convex-concave function over a convex set. J. Optim. Theory Appl. 70 (1990), 377 - 384.
73Lê Dũng Mưu, W. Oettli, A Lagrangian penalty function method for monotone variational inequalities. Numer. Funct. Anal. Optim. 10 (1989), 1003 - 1017.
74Lê Dũng Mưu, An augmented penalty function method for solving a class of variational inequalities. Soviet Computational Mathematics and Mathematical Physics 12 (1986), 1788 - 1796.
75Lê Dũng Mưu, A convergent algorithm for solving linear programs with an additional reverse convex constraint. Kybernetika 91 (1986), 418 - 425 (in Russian).
76Lê Dũng Mưu, Stability property of a class of variational inequalities. Optimization 15 (1984), 347 - 351.
77Lê Dũng Mưu, Do Ba Khang, Asymtotic regularity and the strong convergence of the proximal point algorithm. Acta Math. Vietnam. 8 (1983), 3 - 11 (1984).
78Hoàng Tụy, N. V. Thoai, Lê Dũng Mưu, A modification of Scarf's algorithm allowing restarting, Math. Oper. Stati. Ser. Optim. 9 (1978), 357 - 372.
79Hoàng Tụy, N. V. Thoai, Lê Dũng Mưu, Un nouvel algorithme de point fixe. C. R. Acad. Sci. Paris 286 (1978), Ser. A, 783 - 785.
Tiền ấn phẩm
1IMH20161203, P.T. Hoai, Lê Dũng Mưu, T.N. Thang, Finding the Edgeworth-Pareto hull and its application to optimization over the efficient set of multiple objective discrete linear programs
2IMH2014/02/01, Lê Dũng Mưu, Nguyen Van Quy, On Equilibrium Problems Involving, Strongly Pseudomonotone Bifunctions