A Strongly and Superlinearly Convergent SQP Algorithm for Optimization Problems with Linear Complementarity Constraints
- College of Mathematics and Information Science, Guangxi University, Nanning, Guangxi 530004 (China)
This paper discusses a kind of optimization problem with linear complementarity constraints, and presents a sequential quadratic programming (SQP) algorithm for solving a stationary point of the problem. The algorithm is a modification of the SQP algorithm proposed by Fukushima et al. [Computational Optimization and Applications, 10 (1998),5-34], and is based on a reformulation of complementarity condition as a system of linear equations. At each iteration, one quadratic programming and one system of equations needs to be solved, and a curve search is used to yield the step size. Under some appropriate assumptions, including the lower-level strict complementarity, but without the upper-level strict complementarity for the inequality constraints, the algorithm is proved to possess strong convergence and superlinear convergence. Some preliminary numerical results are reported.
- OSTI ID:
- 21064208
- Journal Information:
- Applied Mathematics and Optimization, Vol. 54, Issue 1; Other Information: DOI: 10.1007/s00245-005-0848-8; Copyright (c) 2006 Springer; www.springer-ny.com; Country of input: International Atomic Energy Agency (IAEA); ISSN 0095-4616
- Country of Publication:
- United States
- Language:
- English
Similar Records
ALESQP: An Augmented Lagrangian Equality-Constrained SQP Method for Optimization with General Constraints
A superlinearly convergent infeasible-interior-point algorithm for geometrical LCPs without a strictly complementary condition