Le Dung Muu

According to our database1, Le Dung Muu authored at least 37 papers between 1985 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.



In proceedings 
PhD thesis 


On csauthors.net:


An algorithm for quasiconvex equilibrium problems and asymptotically nonexpansive mappings: application to a Walras model with implicit supply-demand.
Math. Methods Oper. Res., October, 2023

On the proximal mapping for multi-valued monotone variational inequality problems.
Optim. Lett., March, 2023

Iterative regularization methods with new stepsize rules for solving variational inclusions.
J. Appl. Math. Comput., February, 2022

Strong convergence of Multi-parameter Projection Methods for variational inequality Problems.
Math. Model. Anal., 2022

One-step optimization method for equilibrium problems.
Adv. Comput. Math., 2022

Iterative regularization methods for solving equilibrium problems.
Int. J. Comput. Math., 2021

The Tikhonov regularization for vector equilibrium problems.
Comput. Optim. Appl., 2021

Modified forward-backward splitting method for variational inclusions.
4OR, 2021

A subgradient method for equilibrium problems involving quasiconvex bifunctions.
Oper. Res. Lett., 2020

An Explicit Extragradient Algorithm for Solving Variational Inequalities.
J. Optim. Theory Appl., 2020

Strongly convergent algorithms by using new adaptive regularization parameter for equilibrium problems.
J. Comput. Appl. Math., 2020

A subgradient algorithm for a class of nonlinear split feasibility problems: application to jointly constrained Nash equilibrium models.
J. Glob. Optim., 2019

Modified extragradient-like algorithms with new stepsizes for variational inequalities.
Comput. Optim. Appl., 2019

Modified hybrid projection methods for finding common solutions to variational inequality problems.
Comput. Optim. Appl., 2017

Parallel hybrid extragradient methods for pseudomonotone equilibrium problems and nonexpansive mappings.
Numer. Algorithms, 2016

An algorithm for a class of split feasibility problems: application to a model in electricity production.
Math. Methods Oper. Res., 2016

A convex Hull algorithm for solving a location problem.
RAIRO Oper. Res., 2015

A hybrid subgradient algorithm for nonexpansive mappings and equilibrium problems.
Optim. Lett., 2014

On DC optimization algorithms for solving minmax flow problems.
Math. Methods Oper. Res., 2014

Dual extragradient algorithms extended to equilibrium problems.
J. Glob. Optim., 2012

An extragradient algorithm for solving bilevel pseudomonotone variational inequalities.
J. Glob. Optim., 2012

Iterative methods for solving monotone equilibrium problems via dual gap functions.
Comput. Optim. Appl., 2012

On Penalty and Gap Function Methods for Bilevel Equilibrium Problems.
J. Appl. Math., 2011

Regularization Algorithms for Solving Monotone Ky Fan Inequalities with Application to a Nash-Cournot Equilibrium Model.
J. Optimization Theory and Applications, 2009

On Nash-Cournot oligopolistic market equilibrium models with concave cost functions.
J. Glob. Optim., 2008

A Global Optimization Method for Solving Convex Quadratic Bilevel Programming Problems.
J. Glob. Optim., 2003

Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem.
Oper. Res. Lett., 2001

A Combined D.C. Optimization - Ellipsoidal Branch-and-Bound Algorithm for Solving Nonconvex Quadratic Programming Problems.
J. Comb. Optim., 1998

A Decomposition Algorithm for Optimization over Efficient Sets
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1997

Numerical solution for optimization over the efficient set by d.c. optimization algorithms.
Oper. Res. Lett., 1996

Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions.
J. Glob. Optim., 1995

Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions.
Comput. Optim. Appl., 1995

A Branch-and-Bound Decomposition Approach for Solving Quasiconvex-Concave Programs
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

An algorithm for solving convex programs with an additional convex-concave constraint.
Math. Program., 1993

Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems.
J. Glob. Optim., 1993

An algorithm for indefinite quadratic programming with convex constraints.
Oper. Res. Lett., 1991

A convergent algorithm for solving linear programs with an additional reverse convex constraint.
Kybernetika, 1985