Roxin Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Roxin Zhang has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Youlin Shang
School of Mathematics and Statistics, Henan University of Science and Technology, Luoyang, China
2 shared publications Chuandong Qin
Oklahoma State University
1 shared publication- Guanglei Sun
School of Mathematics and Statistics, Henan University of Science and Technology, Luoyang 471023, P. R. China
1 shared publication - Jia Liu
Chongqing Normal University
1 shared publication - Qinghong Zhang
Northern Michigan University (USA)
1 shared publication - Truong Quang Bao
Department of Mathematics & Computer Science Northern Michigan University 49855 Marquette Michigan USA
1 shared publication
Latest Publications
- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 19 (11) , 8074-8088
An extended linearized alternating direction method of multipliers for Fused-LASSO penalized linear regression
In terms of variable selection and dimensionality reduction for high-dimensional data, Fused-LASSO is a powerful model when the number of important variables is small and neighboring variables exhibit a high degree of correlation. However, solving the model is challenging due to its non-smoothness and non-separability. Alternating direction method of multipliers (ADMM) is an effective method to solve the Fused-LASSO, but one of the subproblems may have no closed-form solution leading to additional computational overhead, and the computing for the inverse of matrix in the subproblem is expensive. In order to overcome these shortcomings and have a great speed performance, an extended linearized alternating direction method of multipliers (ELADMM) is proposed in this paper. First, in the framework of ADMM, we embed the linearized technique into the x-subproblem, so that the subproblem can be solved quickly and efficiently rather than by inner iteration. Second, we make additional extensions to some variables after each iteration, which improves the speed performance of the LADMM. Numerical results show that the proposed ELADMM outperforms ADMM as well as other existing solvers in the sense that it finds the same accurate variable selection results with the shortest time.
- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 19 (11) , 8074-8088
An extended linearized alternating direction method of multipliers for Fused-LASSO penalized linear regression
In terms of variable selection and dimensionality reduction for high-dimensional data, Fused-LASSO is a powerful model when the number of important variables is small and neighboring variables exhibit a high degree of correlation. However, solving the model is challenging due to its non-smoothness and non-separability. Alternating direction method of multipliers (ADMM) is an effective method to solve the Fused-LASSO, but one of the subproblems may have no closed-form solution leading to additional computational overhead, and the computing for the inverse of matrix in the subproblem is expensive. In order to overcome these shortcomings and have a great speed performance, an extended linearized alternating direction method of multipliers (ELADMM) is proposed in this paper. First, in the framework of ADMM, we embed the linearized technique into the x-subproblem, so that the subproblem can be solved quickly and efficiently rather than by inner iteration. Second, we make additional extensions to some variables after each iteration, which improves the speed performance of the LADMM. Numerical results show that the proposed ELADMM outperforms ADMM as well as other existing solvers in the sense that it finds the same accurate variable selection results with the shortest time.
- Open Access
- 4 May 2022
- Published by MDPI AG in Electronics
- Vol. 11 (9) , 1475
An Efficient and Robust Improved Whale Optimization Algorithm for Large Scale Global Optimization Problems
As an efficient meta-heuristic algorithm, the whale optimization algorithm (WOA) has been extensively applied to practical problems. However, WOA still has the drawbacks of converging slowly, and jumping out from extreme points especially for large scale optimization problems. To overcome these defects, a modified whale optimization algorithm integrated with a crisscross optimization algorithm (MWOA-CS) is proposed. In MWOA-CS, each dimension of the optimization problem updates its position by randomly performing improved WOA or crisscross optimization algorithm during the entire iterative process. The improved WOA adopts the new nonlinear convergence factor and nonlinear inertia weight to tune the ability of exploitation and exploration. To analyze the performance of MWOA-CS, a series of numerical experiments were performed on 30 test benchmark functions with dimension ranging from 300 to 1000. The experimental results revealed that the presented MWOA-CS provided better convergence speed and accuracy, and meanwhile, displayed a significantly more effective and robust performance than the original WOA and other state of the art meta-heuristic algorithms for solving large scale global optimization problems.
- 4 May 2022
- Published by MDPI AG in Electronics
- Vol. 11 (9) , 1475
Open AccessAn Efficient and Robust Improved Whale Optimization Algorithm for Large Scale Global Optimization Problems
As an efficient meta-heuristic algorithm, the whale optimization algorithm (WOA) has been extensively applied to practical problems. However, WOA still has the drawbacks of converging slowly, and jumping out from extreme points especially for large scale optimization problems. To overcome these defects, a modified whale optimization algorithm integrated with a crisscross optimization algorithm (MWOA-CS) is proposed. In MWOA-CS, each dimension of the optimization problem updates its position by randomly performing improved WOA or crisscross optimization algorithm during the entire iterative process. The improved WOA adopts the new nonlinear convergence factor and nonlinear inertia weight to tune the ability of exploitation and exploration. To analyze the performance of MWOA-CS, a series of numerical experiments were performed on 30 test benchmark functions with dimension ranging from 300 to 1000. The experimental results revealed that the presented MWOA-CS provided better convergence speed and accuracy, and meanwhile, displayed a significantly more effective and robust performance than the original WOA and other state of the art meta-heuristic algorithms for solving large scale global optimization problems.
- 23 May 2018
- Published by Springer Nature in Applied Intelligence
- Vol. 48 (11) , 4023-4046
A rough ν-twin support vector regression machine
- 23 May 2018
- Published by Springer Nature in Applied Intelligence
- Vol. 48 (11) , 4023-4046
A rough ν-twin support vector regression machine
- 15 October 2014
- Published by Springer Nature
- p. 23-31
Optimality of Bilevel Programming Problems Through Multiobjective Reformulations
- 15 October 2014
- Published by Springer Nature
- p. 23-31
Optimality of Bilevel Programming Problems Through Multiobjective Reformulations
- Open Access
- 1 January 2011
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 7 (1) , 103-115
Multistage hierarchical optimization problems with multi-criterion objectives
- 1 January 2011
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 7 (1) , 103-115
Open AccessMultistage hierarchical optimization problems with multi-criterion objectives
- 28 April 2004
- Published by Springer Nature in Mathematical Programming
- Vol. 102 (1) , 153-166
Weakly upper Lipschitz multifunctions and applications in parametric optimization
- 28 April 2004
- Published by Springer Nature in Mathematical Programming
- Vol. 102 (1) , 153-166
Weakly upper Lipschitz multifunctions and applications in parametric optimization