Chuan-Hao Guo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Chuan-Hao Guo has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Yanqin Bai
Department of Mathematics, Shanghai University, Shanghai 200444, China
4 shared publications - Jinbao Jian
School of Mathematical Sciences & Center for Applied Mathematics of Guangxi, Guangxi Minzu University, Nanning, China
3 shared publications Jin-Bao Jian
2 shared publicationsYan-Qin Bai
2 shared publicationsAiping Zheng
School of Economics and Management, Zhejiang Sci-Tech University, Hangzhou 310018, Zhejiang, P. R. China
1 shared publication- Bei-Bei Liu
School of Economics and Management, Zhejiang Sci-Tech University, Hangzhou 310018, China
1 shared publication
Latest Publications
- 15 October 2026
- Published by World Scientific Pub Co Pte Ltd in Asia-Pacific Journal of Operational Research
A New (λ,𝜖)-constraint Method for Min–Max Bi-objective Programming Problems
Min–max bi-objective programming (MMBOP) has a wide range of applications in practical fields such as management and transportation; however, solving such problems is challenging. In this paper, we propose a new ([Formula: see text])-constraint method for solving this class of problems. In our approach, the bound on the objective function is converted into an [Formula: see text]-constraint formed by a convex combination of the objective’s best and worst possible values. By adjusting the coefficient of the convex combination, the partitioning results of any grid points with respect to the current objective function can be obtained. To simultaneously optimize the objective function subject to the constraints, a penalty parameter [Formula: see text] is introduced. We augment the optimization objective function by adding the product of [Formula: see text] and the difference between the constrained objective function and its bound. A single-objective optimization model for MMBOP is then established, and a new ([Formula: see text])-constraint method is proposed to solve it. Furthermore, we provide a theoretical proof that the proposed model yields better solutions than the traditional model. Finally, numerical results obtained from solving the test problems, which include knapsack problems of varying dimensions and a real-world portfolio selection problem, demonstrate the competitive and practical performance of the ([Formula: see text])-constraint method.
- 15 October 2026
- Published by World Scientific Pub Co Pte Ltd in Asia-Pacific Journal of Operational Research
A New (λ,𝜖)-constraint Method for Min–Max Bi-objective Programming Problems
Min–max bi-objective programming (MMBOP) has a wide range of applications in practical fields such as management and transportation; however, solving such problems is challenging. In this paper, we propose a new ([Formula: see text])-constraint method for solving this class of problems. In our approach, the bound on the objective function is converted into an [Formula: see text]-constraint formed by a convex combination of the objective’s best and worst possible values. By adjusting the coefficient of the convex combination, the partitioning results of any grid points with respect to the current objective function can be obtained. To simultaneously optimize the objective function subject to the constraints, a penalty parameter [Formula: see text] is introduced. We augment the optimization objective function by adding the product of [Formula: see text] and the difference between the constrained objective function and its bound. A single-objective optimization model for MMBOP is then established, and a new ([Formula: see text])-constraint method is proposed to solve it. Furthermore, we provide a theoretical proof that the proposed model yields better solutions than the traditional model. Finally, numerical results obtained from solving the test problems, which include knapsack problems of varying dimensions and a real-world portfolio selection problem, demonstrate the competitive and practical performance of the ([Formula: see text])-constraint method.
- Open Access
Doubly Nonnegative and Semidefinite Relaxations for the Densest k-Subgraph Problem
The densest k-subgraph (DkS) maximization problem is to find a set of k vertices with maximum total weight of edges in the subgraph induced by this set. This problem is in general NP-hard. In this paper, two relaxation methods for solving the DkS problem are presented. One is doubly nonnegative relaxation, and the other is semidefinite relaxation with tighter relaxation compare with the relaxation of standard semidefinite. The two relaxation problems are equivalent under the suitable conditions. Moreover, the corresponding approximation ratios’ results are given for these relaxation problems. Finally, some numerical examples are tested to show the comparison of these relaxation problems, and the numerical results show that the doubly nonnegative relaxation is more promising than the semidefinite relaxation for solving some DkS problems.
Open AccessDoubly Nonnegative and Semidefinite Relaxations for the Densest k-Subgraph Problem
The densest k-subgraph (DkS) maximization problem is to find a set of k vertices with maximum total weight of edges in the subgraph induced by this set. This problem is in general NP-hard. In this paper, two relaxation methods for solving the DkS problem are presented. One is doubly nonnegative relaxation, and the other is semidefinite relaxation with tighter relaxation compare with the relaxation of standard semidefinite. The two relaxation problems are equivalent under the suitable conditions. Moreover, the corresponding approximation ratios’ results are given for these relaxation problems. Finally, some numerical examples are tested to show the comparison of these relaxation problems, and the numerical results show that the doubly nonnegative relaxation is more promising than the semidefinite relaxation for solving some DkS problems.
- 1 January 2015
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 273, 88-102
A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization
- 1 January 2015
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 273, 88-102
A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization
- Open Access
- 1 January 2014
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 10 (2) , 543-556
Doubly nonnegative relaxation method for solving multiple objective quadratic programming problems
Multicriterion optimization and Pareto optimality are fundamental tools in economics. In this paper we propose a new relaxation method for solving multiple objective quadratic programming problems. Exploiting the technique of the linear weighted sum method, we reformulate the original multiple objective quadratic programming problems into a single objective one. Since such single objective quadratic programming problem is still nonconvex and NP-hard in general. By using the techniques of lifting and doubly nonnegative relaxation, respectively, this single objective quadratic programming problem is transformed to a computable convex doubly nonnegative programming problem. The optimal solutions of this computable convex problem are (weakly) Pareto optimal solutions of the original problem under some mild conditions. Moreover, the proposed method is tested with two examples and a practical portfolio selection example. The test examples are solved by CVX package which is a solver for convex optimization. The numerical results show that the proposed method is effective and promising.
- 1 January 2014
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 10 (2) , 543-556
Open AccessDoubly nonnegative relaxation method for solving multiple objective quadratic programming problems
Multicriterion optimization and Pareto optimality are fundamental tools in economics. In this paper we propose a new relaxation method for solving multiple objective quadratic programming problems. Exploiting the technique of the linear weighted sum method, we reformulate the original multiple objective quadratic programming problems into a single objective one. Since such single objective quadratic programming problem is still nonconvex and NP-hard in general. By using the techniques of lifting and doubly nonnegative relaxation, respectively, this single objective quadratic programming problem is transformed to a computable convex doubly nonnegative programming problem. The optimal solutions of this computable convex problem are (weakly) Pareto optimal solutions of the original problem under some mild conditions. Moreover, the proposed method is tested with two examples and a practical portfolio selection example. The test examples are solved by CVX package which is a solver for convex optimization. The numerical results show that the proposed method is effective and promising.
- 1 January 2014
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 409 (2) , 777-789
An improved sequential quadratic programming algorithm for solving general nonlinear programming problems
- 1 January 2014
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 409 (2) , 777-789
An improved sequential quadratic programming algorithm for solving general nonlinear programming problems
- Open Access
An Improved Sequential Quadratic Programming Algorithm for Solving General Nonlinear Programming Problems
In this paper, a class of general nonlinear programming problems with inequality and equality constraints is discussed. Firstly, the original problem is transformed into an associated simpler equivalent problem with only inequality constraints. Then, inspired by the ideals of sequential quadratic programming (SQP) method and the method of system of linear equations (SLE), a new type of SQP algorithm for solving the original problem is proposed. At each iteration, the search direction is generated by the combination of two directions, which are obtained by solving an always feasible quadratic programming (QP) subproblem and a SLE, respectively. Moreover, in order to overcome the Maratos effect, the higher-order correction direction is obtained by solving another SLE. The two SLEs have the same coefficient matrices, and we only need to solve the one of them after a finite number of iterations. By a new line search technique, the proposed algorithm possesses global and superlinear convergence under some suitable assumptions without the strict complementarity. Finally, some comparative numerical results are reported to show that the proposed algorithm is effective and promising.
Open AccessAn Improved Sequential Quadratic Programming Algorithm for Solving General Nonlinear Programming Problems
In this paper, a class of general nonlinear programming problems with inequality and equality constraints is discussed. Firstly, the original problem is transformed into an associated simpler equivalent problem with only inequality constraints. Then, inspired by the ideals of sequential quadratic programming (SQP) method and the method of system of linear equations (SLE), a new type of SQP algorithm for solving the original problem is proposed. At each iteration, the search direction is generated by the combination of two directions, which are obtained by solving an always feasible quadratic programming (QP) subproblem and a SLE, respectively. Moreover, in order to overcome the Maratos effect, the higher-order correction direction is obtained by solving another SLE. The two SLEs have the same coefficient matrices, and we only need to solve the one of them after a finite number of iterations. By a new line search technique, the proposed algorithm possesses global and superlinear convergence under some suitable assumptions without the strict complementarity. Finally, some comparative numerical results are reported to show that the proposed algorithm is effective and promising.
- Open Access
The equivalence between doubly nonnegative relaxation and semidefinite relaxation for binary quadratic programming problems
It has recently been shown (Burer, Math. Program Ser. A 120:479-495, 2009) that a large class of NP-hard nonconvex quadratic programming problems can be modeled as so called completely positive programming problems, which are convex but still NP-hard in general. A basic tractable relaxation is gotten by doubly nonnegative relaxation, resulting in a doubly nonnegative programming. In this paper, we prove that doubly nonnegative relaxation for binary quadratic programming (BQP) problem is equivalent to a tighter semidifinite relaxation for it. When problem (BQP) reduces to max-cut (MC) problem, doubly nonnegative relaxation for it is equivalent to the standard semidifinite relaxation. Furthermore, some compared numerical results are reported.
Open AccessThe equivalence between doubly nonnegative relaxation and semidefinite relaxation for binary quadratic programming problems
It has recently been shown (Burer, Math. Program Ser. A 120:479-495, 2009) that a large class of NP-hard nonconvex quadratic programming problems can be modeled as so called completely positive programming problems, which are convex but still NP-hard in general. A basic tractable relaxation is gotten by doubly nonnegative relaxation, resulting in a doubly nonnegative programming. In this paper, we prove that doubly nonnegative relaxation for binary quadratic programming (BQP) problem is equivalent to a tighter semidifinite relaxation for it. When problem (BQP) reduces to max-cut (MC) problem, doubly nonnegative relaxation for it is equivalent to the standard semidifinite relaxation. Furthermore, some compared numerical results are reported.
- Open Access
A New Superlinearly Convergent Algorithm of Combining QP Subproblem with System of Linear Equations for Nonlinear Optimization
In this paper, a class of optimization problems with nonlinear inequality constraints is discussed. Based on the ideas of sequential quadratic programming algorithm and the method of strongly sub-feasible directions, a new superlinearly convergent algorithm is proposed. The initial iteration point can be chosen arbitrarily for the algorithm. At each iteration, the new algorithm solves one quadratic programming subproblem which is always feasible, and one or two systems of linear equations with a common coefficient matrix. Moreover, the coefficient matrix is uniformly nonsingular. After finite iterations, the iteration points can always enter into the feasible set of the problem, and the search direction is obtained by solving one quadratic programming subproblem and only one system of linear equations. The new algorithm possesses global and superlinear convergence under some suitable assumptions without the strict complementarity. Finally, some preliminary numerical experiments are reported to show that the algorithm is promising.
Open AccessA New Superlinearly Convergent Algorithm of Combining QP Subproblem with System of Linear Equations for Nonlinear Optimization
In this paper, a class of optimization problems with nonlinear inequality constraints is discussed. Based on the ideas of sequential quadratic programming algorithm and the method of strongly sub-feasible directions, a new superlinearly convergent algorithm is proposed. The initial iteration point can be chosen arbitrarily for the algorithm. At each iteration, the new algorithm solves one quadratic programming subproblem which is always feasible, and one or two systems of linear equations with a common coefficient matrix. Moreover, the coefficient matrix is uniformly nonsingular. After finite iterations, the iteration points can always enter into the feasible set of the problem, and the search direction is obtained by solving one quadratic programming subproblem and only one system of linear equations. The new algorithm possesses global and superlinear convergence under some suitable assumptions without the strict complementarity. Finally, some preliminary numerical experiments are reported to show that the algorithm is promising.
- 14 June 2011
- Published by Springer Nature in Journal of Systems Science and Complexity
- Vol. 24 (3) , 604-618
A new ɛ-generalized projection method of strongly sub-feasible directions for inequality constrained optimization
- 14 June 2011
- Published by Springer Nature in Journal of Systems Science and Complexity
- Vol. 24 (3) , 604-618
A new ɛ-generalized projection method of strongly sub-feasible directions for inequality constrained optimization