Suxia Ma
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
Suxia Ma has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Yuelin Gao
School of Mathematics and Information Science, North Minzu University, Yinchuan, China
5 shared publications - Bo Zhang
School of Mathematics and Information Sciences, North Minzu University, Yinchuan 750021, China
3 shared publications - Bo Zhang
Ningxia Province Key Laboratory of Intelligent Information and Data Processing, North Minzu University, Yinchuan, China
1 shared publication - Chenyang Hu
School of Mathematics and Information Sciences, North Minzu University, Yinchuan 750021, China
1 shared publication - Fuping Tian
School of Mathematics and Information Sciences, North Minzu University, Yinchuan 750021, China
1 shared publication - Kai Cao
Ningxia Province Key Laboratory of Intelligent Information and Data Processing, North Minzu University, Yinchuan, China
1 shared publication
Latest Publications
- 3 January 2026
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 72 (2) , 69
A global optimization approach utilizing convex relaxation for linear multiplicative programming problems
- 3 January 2026
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 72 (2) , 69
A global optimization approach utilizing convex relaxation for linear multiplicative programming problems
- 25 June 2025
- Published by Springer Nature in Numerical Algorithms
- Vol. 102 (1) , 467-504
Output-space branch-and-bound algorithm adopting an adaptive branching rule for solving general linear fractional-multiplicative programs
- 25 June 2025
- Published by Springer Nature in Numerical Algorithms
- Vol. 102 (1) , 467-504
Output-space branch-and-bound algorithm adopting an adaptive branching rule for solving general linear fractional-multiplicative programs
- 2 August 2024
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 70 (6) , 5917-5947
Output-space branch-and-bound reduction algorithm for solving generalized linear multiplicative programming programs
- 2 August 2024
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 70 (6) , 5917-5947
Output-space branch-and-bound reduction algorithm for solving generalized linear multiplicative programming programs
- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 19 (9) , 6835-6855
Parameter-free filled function method for nonlinear integer program
Filled function method is a typical deterministic approach for solving nonlinear integer programming problems. The core technique of this approach is to construct a filled function that can constantly jump out of the current local minimizer and find another better local minimizer. To overcome the difficulty in selecting the parameters of the filled function, a new parameter-free filled function is constructed, and a new global optimization algorithm is designed by combining the discrete steepest descent method. Numerical results illustrate that the algorithm is not only effective and feasible, but also has better global optimization ability. Finally, the applicability of the algorithm is verified by solving an actual single-machine scheduling problem.
- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 19 (9) , 6835-6855
Parameter-free filled function method for nonlinear integer program
Filled function method is a typical deterministic approach for solving nonlinear integer programming problems. The core technique of this approach is to construct a filled function that can constantly jump out of the current local minimizer and find another better local minimizer. To overcome the difficulty in selecting the parameters of the filled function, a new parameter-free filled function is constructed, and a new global optimization algorithm is designed by combining the discrete steepest descent method. Numerical results illustrate that the algorithm is not only effective and feasible, but also has better global optimization ability. Finally, the applicability of the algorithm is verified by solving an actual single-machine scheduling problem.
- Open Access
- 25 February 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (5) , 734
A New Nonparametric Filled Function Method for Integer Programming Problems with Constraints
In this paper, we investigate and develop a new filled function method for solving integer programming problems with constraints. By adopting the appropriate equivalent transformation method, these problems are transformed into a class of box-constrained integer programming problems. Then, an effective nonparametric filled function is constructed, and a new global optimization algorithm is designed using the discrete steepest descent method. Numerical experiments illustrate that this algorithm has effectiveness, feasibility, and better global optimization ability.
- 25 February 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (5) , 734
Open AccessA New Nonparametric Filled Function Method for Integer Programming Problems with Constraints
In this paper, we investigate and develop a new filled function method for solving integer programming problems with constraints. By adopting the appropriate equivalent transformation method, these problems are transformed into a class of box-constrained integer programming problems. Then, an effective nonparametric filled function is constructed, and a new global optimization algorithm is designed using the discrete steepest descent method. Numerical experiments illustrate that this algorithm has effectiveness, feasibility, and better global optimization ability.
- Open Access
- 16 January 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (2) , 270
A Relaxed and Bound Algorithm Based on Auxiliary Variables for Quadratically Constrained Quadratic Programming Problem
Quadratically constrained quadratic programs (QCQP), which often appear in engineering practice and management science, and other fields, are investigated in this paper. By introducing appropriate auxiliary variables, QCQP can be transformed into its equivalent problem (EP) with non-linear equality constraints. After these equality constraints are relaxed, a series of linear relaxation subproblems with auxiliary variables and bound constraints are generated, which can determine the effective lower bound of the global optimal value of QCQP. To enhance the compactness of sub-rectangles and improve the ability to remove sub-rectangles, two rectangle-reduction strategies are employed. Besides, two -subproblem deletion rules are introduced to improve the convergence speed of the algorithm. Therefore, a relaxation and bound algorithm based on auxiliary variables are proposed to solve QCQP. Numerical experiments show that this algorithm is effective and feasible.- 16 January 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (2) , 270
Open AccessA Relaxed and Bound Algorithm Based on Auxiliary Variables for Quadratically Constrained Quadratic Programming Problem
Quadratically constrained quadratic programs (QCQP), which often appear in engineering practice and management science, and other fields, are investigated in this paper. By introducing appropriate auxiliary variables, QCQP can be transformed into its equivalent problem (EP) with non-linear equality constraints. After these equality constraints are relaxed, a series of linear relaxation subproblems with auxiliary variables and bound constraints are generated, which can determine the effective lower bound of the global optimal value of QCQP. To enhance the compactness of sub-rectangles and improve the ability to remove sub-rectangles, two rectangle-reduction strategies are employed. Besides, two -subproblem deletion rules are introduced to improve the convergence speed of the algorithm. Therefore, a relaxation and bound algorithm based on auxiliary variables are proposed to solve QCQP. Numerical experiments show that this algorithm is effective and feasible.