Jia Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jia Liu has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
Hengyang Gu
Chongqing Normal University
1 shared publicationPeng Hu
Chongqing Normal University
1 shared publication- Roxin Zhang
Northern Michigan University
1 shared publication - Youlin Shang
School of Mathematics and Statistics, Henan University of Science and Technology, Luoyang, China
1 shared publication - Zheng-Fen Jin
School of Mathematics and Statistics, Henan University of Science and Technology, Luoyang, China
1 shared publication - Zhiyou Wu
Chongqing Normal University
1 shared publication
Latest Publications
- Open Access
- 21 March 2024
- Published by Springer Nature in Research Square
An outcome space branch and bound algorithm for affine multiplicative problems using piecewise linear approximation technique
This paper presents an efficient algorithm for solving a class of affine multiplication programs(AMP). In order to obtain the global optimal solution of the problem, we first transform the problem into an equivalent problem by introducing auxiliary variables. Secondly, we utilize a new piecewise linear approximation technology to systematically transform the problem into a series of linear relaxation programming problems to obtain a reliable lower bound of the optimal value of the problem. Hence, according to the characteristics of the problem and the structure of the branch-and-bound framework, some outer space acceleration techniques are constructed to improve the convergence speed of the algorithm. In addition, by analyzing the computational complexity of the algorithm, an estimate of the maximum number of iterations of the algorithm is given. Finally, numerical results verify the effectiveness and robustness of the algorithm.
- 21 March 2024
- Published by Springer Nature in Research Square
Open AccessAn outcome space branch and bound algorithm for affine multiplicative problems using piecewise linear approximation technique
This paper presents an efficient algorithm for solving a class of affine multiplication programs(AMP). In order to obtain the global optimal solution of the problem, we first transform the problem into an equivalent problem by introducing auxiliary variables. Secondly, we utilize a new piecewise linear approximation technology to systematically transform the problem into a series of linear relaxation programming problems to obtain a reliable lower bound of the optimal value of the problem. Hence, according to the characteristics of the problem and the structure of the branch-and-bound framework, some outer space acceleration techniques are constructed to improve the convergence speed of the algorithm. In addition, by analyzing the computational complexity of the algorithm, an estimate of the maximum number of iterations of the algorithm is given. Finally, numerical results verify the effectiveness and robustness of the algorithm.
- 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.