A Sequential Quadratically Constrained Quadratic Programming Method of Feasible Directions
- Hunan Business College, Department of Information (China)
- Guangxi University, College of Mathematics and Informatics Science (China)
In this paper, a sequential quadratically constrained quadratic programming method of feasible directions is proposed for the optimization problems with nonlinear inequality constraints. At each iteration of the proposed algorithm, a feasible direction of descent is obtained by solving only one subproblem which consist of a convex quadratic objective function and simple quadratic inequality constraints without the second derivatives of the functions of the discussed problems, and such a subproblem can be formulated as a second-order cone programming which can be solved by interior point methods. To overcome the Maratos effect, an efficient higher-order correction direction is obtained by only one explicit computation formula. The algorithm is proved to be globally convergent and superlinearly convergent under some mild conditions without the strict complementarity. Finally, some preliminary numerical results are reported.
- OSTI ID:
- 21064181
- Journal Information:
- Applied Mathematics and Optimization, Journal Name: Applied Mathematics and Optimization Journal Issue: 3 Vol. 56; ISSN 0095-4616
- Country of Publication:
- United States
- Language:
- English
Similar Records
A Strongly and Superlinearly Convergent SQP Algorithm for Optimization Problems with Linear Complementarity Constraints
Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints