most citedAn Improved Sequential Quadratic Programming Algorithm for Solving General Nonlinear Programming Problems

15 citations · 18 across the 5 of their papers we have counts for

collaborators

5 papers

math.OC2015

Splitting and successively solving augmented Lagrangian method for optimization with semicontinuous variables and cardinality constraint

Yanqin Bai, Renli Liang, Zhouwang Yang

We propose a new splitting and successively solving augmented Lagrangian (SSAL) method for solving an optimization problem with both semicontinuous variables and a cardinality cons…

math.OC2012

The equivalence between doubly nonnegative relaxation and semidefinite relaxation for binary quadratic programming problems

Chuan-Hao Guo, Yan-Qin Bai, Li-Ping Tang

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 comple…

math.OC2012★ 3 cited

Doubly nonnegative relaxation method for solving multiple objective quadratic programming problems

Yan-Qin Bai, Chuan-Hao Guo

Multicriterion optimization and Pareto optimality are fundamental tools in economics. In this paper we propose a new relaxation method for solving multiple objective quadratic prog…

math.OC2012

A New Superlinearly Convergent Algorithm of Combining QP Subproblem with System of Linear Equations for Nonlinear Optimization

Jin-Bao Jian, Chuan-Hao Guo, Chun-Ming Tang +1

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…

math.OC2012★ 15 cited

An Improved Sequential Quadratic Programming Algorithm for Solving General Nonlinear Programming Problems

Chuan-Hao Guo, Yan-Qin Bai, Jin-Bao Jian

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 associa…