The following pages link to Le Dung Muu (Q312191):
Displaying 50 items.
- (Q195453) (redirect page) (← links)
- Parallel hybrid extragradient methods for pseudomonotone equilibrium problems and nonexpansive mappings (Q312192) (← links)
- On DC optimization algorithms for solving minmax flow problems (Q406644) (← links)
- On penalty and gap function methods for bilevel equilibrium problems (Q410808) (← links)
- An extragradient algorithm for solving bilevel pseudomonotone variational inequalities (Q427380) (← links)
- Iterative methods for solving monotone equilibrium problems via dual gap functions (Q429462) (← links)
- A new decomposition algorithm for globally solving mathematical programs with affine equilibrium constraints (Q445789) (← links)
- Algorithms for a class of bilevel programs involving pseudomonotone variational inequalities (Q489985) (← links)
- An algorithm for a class of split feasibility problems: application to a model in electricity production (Q510436) (← links)
- (Q592152) (redirect page) (← links)
- The Tikhonov regularization extended to equilibrium problems involving pseudomonotone bifunctions (Q640139) (← links)
- Dual extragradient algorithms extended to equilibrium problems (Q656844) (← links)
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems (Q686998) (← links)
- An algorithm for solving convex programs with an additional convex- concave constraint (Q689151) (← links)
- Methods for finding global optimal solutions to linear programs with equilibrium constraints. (Q696138) (← links)
- Global optimization from concave minimization to concave mixed variational inequality (Q778156) (← links)
- On branch-and-bound algorithms for global optimal solutions to mathematical programs with affine equilibrium constraints (Q934187) (← links)
- On Nash-Cournot oligopolistic market equilibrium models with concave cost functions (Q934791) (← links)
- Regularization algorithms for solving monotone Ky Fan inequalities with application to a Nash-Cournot equilibrium model (Q1035902) (← links)
- Asymptotic regularity and the strong convergence of the proximal point algorithm (Q1069272) (← links)
- Method for minimizing a convex-concave function over a convex set (Q1176848) (← links)
- An algorithm for indefinite quadratic programming with convex constraints (Q1180839) (← links)
- On a Lagrangian penalty function method for nonlinear programming problems (Q1186086) (← links)
- Branch-and-bound decomposition approach for solving quasiconvex-concave programs (Q1333350) (← links)
- Convex-concave programming as a decomposition approach to global optimization (Q1373016) (← links)
- A parametric simplex method for optimizing a linear function over the efficient set of bicriteria linear problem (Q1373064) (← links)
- Efficient methods for solving certain bilinear programming problems (Q1376672) (← links)
- A relaxation algorithm for solving mixed integer programming problems (Q1384441) (← links)
- A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems (Q1386483) (← links)
- Simplicially-constrained DC optimization over efficient and weakly efficient sets (Q1411519) (← links)
- A global optimization method for solving convex quadratic bilevel programming problems (Q1422881) (← links)
- Computational aspects of optimization problems over the efficient set (Q1423543) (← links)
- Exact penalty in d. c. programming (Q1573084) (← links)
- A convex-concave programming method for optimizing over the efficient set. (Q1577612) (← links)
- Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem (Q1579631) (← links)
- On the construction of initial polyhedral convex set for optimization problems over the efficient set and bilevel linear programs (Q1593702) (← links)
- A splitting algorithm for finding fixed points of nonexpansive mappings and solving equilibrium problems (Q1615335) (← links)
- Coupling the Banach contraction mapping principle and the proximal point algorithm for solving monotone variational inequalities (Q1763082) (← links)
- Using the Banach contraction principle to implement the proximal point method for multivalued monotone variational inequalities (Q1777587) (← links)
- Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions (Q1804585) (← links)
- Methods for finding global optimal solutions to linear programs with equilibrium constraints (Q1862683) (← links)
- On penalty function method for a class of nonconvex constrained optimization problems. (Q1862705) (← links)
- Bilinear programming approach to optimization over the efficient set of a vector affine fractional problem. (Q1873620) (← links)
- Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions (Q1892595) (← links)
- Strongly convergent algorithms by using new adaptive regularization parameter for equilibrium problems (Q1987449) (← links)
- A two-step extragradient-viscosity method for variational inequalities and fixed point problems (Q2000822) (← links)
- The Tikhonov regularization for vector equilibrium problems (Q2028472) (← links)
- Modified forward-backward splitting method for variational inclusions (Q2040611) (← links)
- Strong convergence of subgradient extragradient method with regularization for solving variational inequalities (Q2069153) (← links)
- New iterative regularization methods for solving split variational inclusion problems (Q2083374) (← links)
