Nimit Nimana
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Nimit Nimana has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Narin Petrot
Department of Mathematics, Faculty of Science, Naresuan University, Phitsanulok, Thailand
13 shared publications Mootta Prangprakhon
3 shared publications- Mootta Prangprakhon
Department of Mathematics, Faculty of Science, Khon Kaen University, Khon Kaen, Thailand
3 shared publications - Ernö Robert Csetnek
Faculty of Mathematics, University of Vienna, Vienna, Austria
2 shared publications Jedsadapong Pioon
Department of Mathematics, Faculty of Science, Khon Kaen University
2 shared publications- Mootta Prangprakhon
Department of Mathematics Faculty of Science Khon Kaen University Khon Kaen 40002 Thailand
2 shared publications
Latest Publications
- 16 June 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 108 (2)
Subgradient Splitting Methods for Nonsmooth Fractional Programming with Fixed-Point Constraints
- 16 June 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 108 (2)
Subgradient Splitting Methods for Nonsmooth Fractional Programming with Fixed-Point Constraints
- 21 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 2585-2590
Federated Incremental Subgradient Method for Convex Bilevel Optimization Problems
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 of convex functions. Bilevel optimization problems arise in situations where the inner-level problem does not have a unique solution. This has led to the idea of introducing an outer-level objective function to select a solution with the specific desired properties. We propose an iterative method that combines an incremental algorithm with a broadcast algorithm, both based on the principles of federated learning. Under appropriate assumptions, we establish the convergence results of the proposed algorithm. To demonstrate its performance, we present two numerical examples related to binary classification and a location problem.
- 21 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 2585-2590
Federated Incremental Subgradient Method for Convex Bilevel Optimization Problems
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 of convex functions. Bilevel optimization problems arise in situations where the inner-level problem does not have a unique solution. This has led to the idea of introducing an outer-level objective function to select a solution with the specific desired properties. We propose an iterative method that combines an incremental algorithm with a broadcast algorithm, both based on the principles of federated learning. Under appropriate assumptions, we establish the convergence results of the proposed algorithm. To demonstrate its performance, we present two numerical examples related to binary classification and a location problem.
- Open Access
Subgradient Splitting Methods for Nonsmooth Fractional Programming with Fixed-Point Constraints
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, we propose splitting algorithms that compute subgradient steps separately for the convex numerator and the concave denominator. These methods offer a straightforward approach by eliminating the need to solve subproblems at each iteration. By leveraging fixed-point constraints, the proposed algorithms are particularly well-suited for problems with complex constraint structures. Under certain assumptions, we establish the convergence of the proposed methods. Furthermore, to address large-scale optimization, we propose an incremental subgradient algorithm for a class of nonsmooth sum-of-ratios fractional programming problems and analyze its convergence. Finally, we present numerical experiments, including comparative analyses of our algorithms with existing methods, to demonstrate the effectiveness and performance of the proposed approach.
Open AccessSubgradient Splitting Methods for Nonsmooth Fractional Programming with Fixed-Point Constraints
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, we propose splitting algorithms that compute subgradient steps separately for the convex numerator and the concave denominator. These methods offer a straightforward approach by eliminating the need to solve subproblems at each iteration. By leveraging fixed-point constraints, the proposed algorithms are particularly well-suited for problems with complex constraint structures. Under certain assumptions, we establish the convergence of the proposed methods. Furthermore, to address large-scale optimization, we propose an incremental subgradient algorithm for a class of nonsmooth sum-of-ratios fractional programming problems and analyze its convergence. Finally, we present numerical experiments, including comparative analyses of our algorithms with existing methods, to demonstrate the effectiveness and performance of the proposed approach.
- 15 August 2025
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 207 (3) , 1-28
A Simultaneous Quasi-Subgradient Method for Minimizing Convex Function with Quasi-Convex Functional Constraints
- 15 August 2025
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 207 (3) , 1-28
A Simultaneous Quasi-Subgradient Method for Minimizing Convex Function with Quasi-Convex Functional Constraints
- Open Access
- 26 July 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (8) , 469
Delayed Star Subgradient Methods for Constrained Nondifferentiable Quasi-Convex Optimization
In this work, we consider the problem of minimizing a quasi-convex function over a nonempty closed convex constrained set. In order to approximate a solution of the considered problem, we propose delayed star subgradient methods. The main feature of the proposed methods is that it allows us to use the stale star subgradients when updating the next iteration rather than computing the new star subgradient in every iteration. We subsequently investigate the convergence results of sequences generated by the proposed methods. Finally, we present some numerical experiments on the Cobb–Douglas production efficiency problem to illustrate the effectiveness of the proposed method.
- 26 July 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (8) , 469
Open AccessDelayed Star Subgradient Methods for Constrained Nondifferentiable Quasi-Convex Optimization
In this work, we consider the problem of minimizing a quasi-convex function over a nonempty closed convex constrained set. In order to approximate a solution of the considered problem, we propose delayed star subgradient methods. The main feature of the proposed methods is that it allows us to use the stale star subgradients when updating the next iteration rather than computing the new star subgradient in every iteration. We subsequently investigate the convergence results of sequences generated by the proposed methods. Finally, we present some numerical experiments on the Cobb–Douglas production efficiency problem to illustrate the effectiveness of the proposed method.
- 20 March 2025
- Published by Taylor & Francis in Numerical Functional Analysis and Optimization
- Vol. 46 (6) , 395-424
A Greedy Fixed-Point Method for Solving Variational Inequalities over the Fixed-Point Constraints
- 20 March 2025
- Published by Taylor & Francis in Numerical Functional Analysis and Optimization
- Vol. 46 (6) , 395-424
A Greedy Fixed-Point Method for Solving Variational Inequalities over the Fixed-Point Constraints
- Open Access
- 24 February 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (3) , 126
Incremental Delayed Subgradient Method for Decentralized Nonsmooth Convex–Concave Minimax Optimization
In this paper, we propose an incremental-type subgradient scheme for solving a nonsmooth convex–concave minimax optimization problem in the setting of Euclidean spaces. We investigate convergence results by deriving an upper bound for the absolute value of the difference between the function value of the averaged iterates and the saddle value, provided that the step size is a constant. By assuming that the step-size sequence is diminishing, we prove the convergences of both the averaged sequence of function values and the sequence of function values of averaged iterates to the saddle value. Finally, we also show some numerical examples for illustrating the obtained theoretical result.
- 24 February 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (3) , 126
Open AccessIncremental Delayed Subgradient Method for Decentralized Nonsmooth Convex–Concave Minimax Optimization
In this paper, we propose an incremental-type subgradient scheme for solving a nonsmooth convex–concave minimax optimization problem in the setting of Euclidean spaces. We investigate convergence results by deriving an upper bound for the absolute value of the difference between the function value of the averaged iterates and the saddle value, provided that the step size is a constant. By assuming that the step-size sequence is diminishing, we prove the convergences of both the averaged sequence of function values and the sequence of function values of averaged iterates to the saddle value. Finally, we also show some numerical examples for illustrating the obtained theoretical result.
- Open Access
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 9 (7) , 19154-19175
Convergence of distributed approximate subgradient method for minimizing convex function with convex functional constraints
In this paper, we investigate the distributed approximate subgradient-type method for minimizing a sum of differentiable and non-differentiable convex functions subject to nondifferentiable convex functional constraints in a Euclidean space. We establish the convergence of the sequence generated by our method to an optimal solution of the problem under consideration. Moreover, we derive a convergence rate of order $ \mathcal{O}(N^{1-a}) $ for the objective function values, where $ a\in (0.5, 1) $. Finally, we provide a numerical example illustrating the effectiveness of the proposed method.- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 9 (7) , 19154-19175
Open AccessConvergence of distributed approximate subgradient method for minimizing convex function with convex functional constraints
In this paper, we investigate the distributed approximate subgradient-type method for minimizing a sum of differentiable and non-differentiable convex functions subject to nondifferentiable convex functional constraints in a Euclidean space. We establish the convergence of the sequence generated by our method to an optimal solution of the problem under consideration. Moreover, we derive a convergence rate of order $ \mathcal{O}(N^{1-a}) $ for the objective function values, where $ a\in (0.5, 1) $. Finally, we provide a numerical example illustrating the effectiveness of the proposed method. - Open Access
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 9 (2) , 4259-4280
An extrapolated fixed-point optimization method for strongly convex smooth optimizations
In this work, we focused on minimizing a strongly convex smooth function over the common fixed-point constraints. We proposed an extrapolated fixed-point optimization method, which is a modified version of the extrapolated sequential constraint method with conjugate gradient direction. We proved the convergence of the generated sequence to the unique solution to the considered problem without boundedness assumption. We also investigated some numerical experiments to underline the effectiveness and performance of the proposed method.
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 9 (2) , 4259-4280
Open AccessAn extrapolated fixed-point optimization method for strongly convex smooth optimizations
In this work, we focused on minimizing a strongly convex smooth function over the common fixed-point constraints. We proposed an extrapolated fixed-point optimization method, which is a modified version of the extrapolated sequential constraint method with conjugate gradient direction. We proved the convergence of the generated sequence to the unique solution to the considered problem without boundedness assumption. We also investigated some numerical experiments to underline the effectiveness and performance of the proposed method.
- 9 November 2023
- Published by Technical University of Cluj Napoca, North University Center of Baia Mare in Carpathian Journal of Mathematics
- Vol. 40 (1) , 155-171
A strongly convergent simultaneous cutter method for finding the minimal norm solution to common fixed point problem
In this paper, we propose a strongly convergent simultaneous cutter method for finding the min- imal norm solution over the intersection of fixed point sets of cutters. The proposed method is the combination of the simultaneous cutter method and the strongly variance of Krasnosel’ski˘ı-Mann method. We show a strong convergence result of the sequence generated by the proposed method to the unique minimal norm solution. We finally present the numerical experiments on the minimal norm solution over a finite number of linear feasibility problem.
- 9 November 2023
- Published by Technical University of Cluj Napoca, North University Center of Baia Mare in Carpathian Journal of Mathematics
- Vol. 40 (1) , 155-171
A strongly convergent simultaneous cutter method for finding the minimal norm solution to common fixed point problem
In this paper, we propose a strongly convergent simultaneous cutter method for finding the min- imal norm solution over the intersection of fixed point sets of cutters. The proposed method is the combination of the simultaneous cutter method and the strongly variance of Krasnosel’ski˘ı-Mann method. We show a strong convergence result of the sequence generated by the proposed method to the unique minimal norm solution. We finally present the numerical experiments on the minimal norm solution over a finite number of linear feasibility problem.