1 citations · 1 across the 6 of their papers we have counts for
8 papers
Fixed-Point Delayed Subgradient Methods for Nonsmooth Convex Optimization Problems
Ontima Pankoon, Nimit Nimana, Yeol Je Cho
In this paper, we consider the nonsmooth convex optimization problems over the fixed point constraint sets of firmly nonexpansive operators. To find an optimal solution of the prob…
Federated Incremental Subgradient Method for Convex Bilevel Optimization Problems
Sudkobfa Boontawee, Mootta Prangprakhon, Nimit Nimana
In this letter, we consider a bilevel optimization problem in which the outer-level objective function is strongly convex, whereas the inner-level problem consists of a finite sum…
Subgradient Splitting Methods for Nonsmooth Fractional Programming with Fixed-Point Constraints
Mootta Prangprakhon, Nimit Nimana
We consider a class of nonsmooth fractional programming problems with fixed-point constraints, where the numerator is convex and the denominator is concave. To solve this problem,…
Extrapolated Sequential Constraint Method for Variational Inequality over the Intersection of Fixed-Point Sets
Mootta Prangprakhon, Nimit Nimana
This paper deals with the solving of variational inequality problem where the constrained set is given as the intersection of a number of fixed-point sets. To this end, we present…
A Sequential Constraint Method for Solving Variational Inequality over the Intersection of Fixed Point Sets
Mootta Prangprakhon, Nimit Nimana, Narin Petrot
We consider the variational inequality problem over the intersection of fixed point sets of firmly nonexpansive operators. In order to solve the problem, we present an algorithm an…
Star subgradient projection for solving quasi-convex feasibility problems
Nimit Nimana, Narin Petrot
In this work we consider an iterative method for solving the quasi-convex feasibility problem. We firstly introduce the so-called star subgradient projection operator and present s…
Incremental proximal gradient scheme with penalization for constrained composite convex optimization problems
Nimit Nimana, Narin Petrot
We consider the problem of minimizing a finite sum of convex functions subject to the set of minimizers of a convex differentiable function. In order to solve the problem, an algor…
Generalized Forward-Backward Splitting with Penalization for Monotone Inclusion Problems
Nimit Nimana, Narin Petrot
We introduce a generalized forward-backward splitting method with penalty term for solving monotone inclusion problems involving the sum of a finite number of maximally monotone op…