default search action
Le Dung Muu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i3]Nguyen Anh Minh, Le Dung Muu, Tran Ngoc Thang:
Adaptive multi-gradient methods for quasiconvex vector optimization and applications to multi-task learning. CoRR abs/2402.06224 (2024) - 2023
- [j35]Nguyen Ngoc Hai, Le Dung Muu, Bui Van Dinh
:
An algorithm for quasiconvex equilibrium problems and asymptotically nonexpansive mappings: application to a Walras model with implicit supply-demand. Math. Methods Oper. Res. 98(2): 299-324 (2023) - [j34]Le Dung Muu, Xuan Thanh Le
On the proximal mapping for multi-valued monotone variational inequality problems. Optim. Lett. 17(2): 369-383 (2023) - 2022
- [j33]Dang Van Hieu
One-step optimization method for equilibrium problems. Adv. Comput. Math. 48(3): 29 (2022) - [j32]Dang Van Hieu
Iterative regularization methods with new stepsize rules for solving variational inclusions. J. Appl. Math. Comput. 68(1): 571-599 (2022) - [j31]Dang Van Hieu
Strong convergence of Multi-parameter Projection Methods for variational inequality Problems. Math. Model. Anal. 27(2): 242-262 (2022) - 2021
- [j30]Dang Van Hieu
Modified forward-backward splitting method for variational inclusions. 4OR 19(1): 127-151 (2021) - [j29]Lam Quoc Anh, Tran Quoc Duy
The Tikhonov regularization for vector equilibrium problems. Comput. Optim. Appl. 78(3): 769-792 (2021) - [j28]Dang Van Hieu, Le Dung Muu, Hoang Ngoc Duong:
Iterative regularization methods for solving equilibrium problems. Int. J. Comput. Math. 98(12): 2533-2563 (2021) - 2020
- [j27]Dang Van Hieu, Jean-Jacques Strodiot, Le Dung Muu:
Strongly convergent algorithms by using new adaptive regularization parameter for equilibrium problems. J. Comput. Appl. Math. 376: 112844 (2020) - [j26]Dang Van Hieu
An Explicit Extragradient Algorithm for Solving Variational Inequalities. J. Optim. Theory Appl. 185(2): 476-503 (2020) - [j25]Le Hai Yen
A subgradient method for equilibrium problems involving quasiconvex bifunctions. Oper. Res. Lett. 48(5): 579-583 (2020)
2010 – 2019
- 2019
- [j24]Dang Van Hieu
Modified extragradient-like algorithms with new stepsizes for variational inequalities. Comput. Optim. Appl. 73(3): 913-932 (2019) - [j23]Le Hai Yen
A subgradient algorithm for a class of nonlinear split feasibility problems: application to jointly constrained Nash equilibrium models. J. Glob. Optim. 73(4): 849-868 (2019) - 2017
- [j22]Dang Van Hieu, Pham Ky Anh, Le Dung Muu:
Modified hybrid projection methods for finding common solutions to variational inequality problems. Comput. Optim. Appl. 66(1): 75-96 (2017) - 2016
- [j21]Le Hai Yen
An algorithm for a class of split feasibility problems: application to a model in electricity production. Math. Methods Oper. Res. 84(3): 549-565 (2016) - [j20]Dang Van Hieu, Le Dung Muu, Pham Ky Anh:
Parallel hybrid extragradient methods for pseudomonotone equilibrium problems and nonexpansive mappings. Numer. Algorithms 73(1): 197-217 (2016) - 2015
- [j19]Nguyen Kieu Linh, Le Dung Muu:
A convex Hull algorithm for solving a location problem. RAIRO Oper. Res. 49(3): 589-600 (2015) - 2014
- [j18]Le Dung Muu, Le Quang Thuy:
On DC optimization algorithms for solving minmax flow problems. Math. Methods Oper. Res. 80(1): 83-97 (2014) - [j17]Pham N. Anh, Le Dung Muu:
A hybrid subgradient algorithm for nonexpansive mappings and equilibrium problems. Optim. Lett. 8(2): 727-738 (2014) - 2012
- [j16]Tran Dinh Quoc, Le Dung Muu:
Iterative methods for solving monotone equilibrium problems via dual gap functions. Comput. Optim. Appl. 51(2): 709-728 (2012) - [j15]Tran Dinh Quoc, Pham N. Anh, Le Dung Muu:
Dual extragradient algorithms extended to equilibrium problems. J. Glob. Optim. 52(1): 139-159 (2012) - [j14]Pham N. Anh, J. K. Kim, Le Dung Muu:
An extragradient algorithm for solving bilevel pseudomonotone variational inequalities. J. Glob. Optim. 52(3): 627-639 (2012) - 2011
- [j13]Dinh Bui Van
On Penalty and Gap Function Methods for Bilevel Equilibrium Problems. J. Appl. Math. 2011: 646452:1-646452:14 (2011)
2000 – 2009
- 2009
- [j12]Le Dung Muu, Tran Dinh Quoc:
Regularization Algorithms for Solving Monotone Ky Fan Inequalities with Application to a Nash-Cournot Equilibrium Model. J. Optimization Theory and Applications 142(1): 185-204 (2009) - 2008
- [j11]Le Dung Muu, V. H. Nguyen, N. V. Quy:
On Nash-Cournot oligopolistic market equilibrium models with concave cost functions. J. Glob. Optim. 41(3): 351-364 (2008) - 2003
- [j10]Le Dung Muu, Nguyen Van Quy:
A Global Optimization Method for Solving Convex Quadratic Bilevel Programming Problems. J. Glob. Optim. 26(2): 199-219 (2003) - 2001
- [j9]Hoang Q. Tuyen, Le Dung Muu:
Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem. Oper. Res. Lett. 28(2): 81-92 (2001)
1990 – 1999
- 1998
- [j8]Le Thi Hoai An
A Combined D.C. Optimization - Ellipsoidal Branch-and-Bound Algorithm for Solving Nonconvex Quadratic Programming Problems. J. Comb. Optim. 2(1): 9-28 (1998) - 1997
- [i2]Reiner Horst, Le Dung Muu, Nguyen V. Thoai:
A Decomposition Algorithm for Optimization over Efficient Sets. Universität Trier, Mathematik/Informatik, Forschungsbericht 97-04 (1997) - 1996
- [j7]Le Thi Hoai An
Numerical solution for optimization over the efficient set by d.c. optimization algorithms. Oper. Res. Lett. 19(3): 117-128 (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]Le Dung Muu, Bui T. Tam, Siegfried Schaible:
Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions. J. Glob. Optim. 6(2): 179-191 (1995) - 1993
- [j4]Le Dung Muu, Werner Oettli:
Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems. J. Glob. Optim. 3(3): 377-391 (1993) - [j3]Le Dung Muu:
An algorithm for solving convex programs with an additional convex-concave constraint. Math. Program. 61: 75-87 (1993) - [i1]Reiner Horst, Le Dung Muu, M. Nast:
A Branch-and-Bound Decomposition Approach for Solving Quasiconvex-Concave Programs. Universität Trier, Mathematik/Informatik, Forschungsbericht 93-11 (1993) - 1991
- [j2]Le Dung Muu, Werner Oettli:
An algorithm for indefinite quadratic programming with convex constraints. Oper. Res. Lett. 10(6): 323-327 (1991)
1980 – 1989
- 1985
- [j1]Le Dung Muu:
A convergent algorithm for solving linear programs with an additional reverse convex constraint. Kybernetika 21(6): 428-435 (1985)
Coauthor Index
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-04-24 23:14 CEST 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: