Nimit Nimana

Dr. Nimit Nimana

orcid

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 October 2014 in Fixed Point Theory and Applications
Verified
Journal Article
Open access
PDF file
QAQamrul Hasan Ansari
Qamrul Hasan Ansari
NNNimit Nimana
Nimit Nimana
NPNarin Petrot
Narin Petrot
The main objective of this paper is to introduce a split hierarchical variational inequality problem. Several related problems are also considered. We propose an iterative method for finding a solution of our problem. The weak convergence of the sequence generated by the proposed method is studied.

15 November 2022 in Numerical Algorithms
Verified
Journal Article
Closed access
PDF file
NPNarin Petrot
Narin Petrot
MPMootta Prangprakhon
Mootta Prangprakhon
PPPorntip Promsinchai
Porntip Promsinchai
NNNimit Nimana
Nimit Nimana

24 May 2016 in Optimization
Verified
Journal Article
Closed access
NNNimit Nimana
Nimit Nimana
AFAli P. Farajzadeh
Ali P. Farajzadeh
NPNarin Petrot
Narin Petrot
In this paper, we consider a type of the celebrated convex feasibility problem, named as split quasi-convex feasibility problem (SQFP). The SQFP is to find a point in a sublevel set of a quasi-convex function in one space and its image under a bounded linear operator is contained in a sublevel set of another quasi-convex function in the image space. We propose a new adaptive subgradient algorithm for solving SQFP problem. We also discuss the convergence analyses for two cases: the first case where the functions are upper semicontinuous in the setting of finite dimensional, and the second case where the functions are weakly continuous in the infinite-dimensional settings. Finally some numerical examples in order to support the convergence results are given.

1 September 2017 in Vietnam Journal of Mathematics
Verified
Journal Article
Open access
PDF file
RBRadu Ioan Boţ
Radu Ioan Boţ
ECErnö Robert Csetnek
Ernö Robert Csetnek
NNNimit Nimana
Nimit Nimana
We propose a proximal-gradient algorithm with penalization terms and inertial and memory effects for minimizing the sum of a proper, convex, and lower semicontinuous and a convex differentiable function subject to the set of minimizers of another convex differentiable function. We show that, under suitable choices for the step sizes and the penalization parameters, the generated iterates weakly converge to an optimal solution of the addressed bilevel optimization problem, while the objective function values converge to its optimal objective value.

14 June 2017 in Optimization Letters
Verified
Journal Article
Open access
PDF file
RBRadu Ioan Boţ
Radu Ioan Boţ
ECErnö Robert Csetnek
Ernö Robert Csetnek
NNNimit Nimana
Nimit Nimana
We consider the problem of minimizing a smooth convex objective function subject to the set of minima of another differentiable convex function. In order to solve this problem, we propose an algorithm which combines the gradient method with a penalization technique. Moreover, we insert in our algorithm an inertial term, which is able to take advantage of the history of the iterates. We show weak convergence of the generated sequence of iterates to an optimal solution of the optimization problem, provided a condition expressed via the Fenchel conjugate of the constraint function is fulfilled. We also prove convergence for the objective function values to the optimal objective value. The convergence analysis carried out in this paper relies on the celebrated Opial Lemma and generalized Fejér monotonicity techniques. We illustrate the functionality of the method via a numerical experiment addressing image classification via support vector machines.

21 August 2018 in Optimization
Verified
Journal Article
Closed access
ACAndrzej Cegielski
Andrzej Cegielski
NNNimit Nimana
Nimit Nimana
We present two versions of the extrapolated cyclic subgradient projections method for solving the convex feasibility problem. Moreover, we present the results of numerical tests, where we compare the methods with the classical cyclic subgradient projections method.