# Le Dung Muu

According to our database

Collaborative distances:

^{1}, Le Dung Muu authored at least 28 papers between 1985 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

J. Optim. Theory Appl., 2020

Strongly convergent algorithms by using new adaptive regularization parameter for equilibrium problems.

J. Comput. Appl. Math., 2020

2019

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

2017

Modified hybrid projection methods for finding common solutions to variational inequality problems.

Comput. Optim. Appl., 2017

2016

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

2015

RAIRO Oper. Res., 2015

2014

A hybrid subgradient algorithm for nonexpansive mappings and equilibrium problems.

Optim. Lett., 2014

Math. Methods Oper. Res., 2014

2012

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

2011

J. Appl. Math., 2011

2009

Regularization Algorithms for Solving Monotone Ky Fan Inequalities with Application to a Nash-Cournot Equilibrium Model.

J. Optimization Theory and Applications, 2009

2008

On Nash-Cournot oligopolistic market equilibrium models with concave cost functions.

J. Glob. Optim., 2008

2003

A Global Optimization Method for Solving Convex Quadratic Bilevel Programming Problems.

J. Glob. Optim., 2003

2001

Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem.

Oper. Res. Lett., 2001

1998

A Combined D.C. Optimization - Ellipsoidal Branch-and-Bound Algorithm for Solving Nonconvex Quadratic Programming Problems.

J. Comb. Optim., 1998

1997

A Decomposition Algorithm for Optimization over Efficient Sets

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1997

1996

Numerical solution for optimization over the efficient set by d.c. optimization algorithms.

Oper. Res. Lett., 1996

1995

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

1993

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

1991

Oper. Res. Lett., 1991

1985

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

Kybernetika, 1985