A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization |
| |
Authors: | Jin-bao Jian Wei-xin Cheng |
| |
Institution: | 1. College of Mathematics and Information Science, Guangxi University, PR China;2. College of Mathematics and Information Science, Henan Normal University, PR China |
| |
Abstract: | In this paper, by means of a new efficient identification technique of active constraints and the method of strongly sub-feasible direction, we propose a new sequential system of linear equations (SSLE) algorithm for solving inequality constrained optimization problems, in which the initial point is arbitrary. At each iteration, we first yield the working set by a pivoting operation and a generalized projection; then, three or four reduced linear equations with a same coefficient are solved to obtain the search direction. After a finite number of iterations, the algorithm can produced a feasible iteration point, and it becomes the method of feasible directions. Moreover, after finitely many iterations, the working set becomes independent of the iterates and is essentially the same as the active set of the KKT point. Under some mild conditions, the proposed algorithm is proved to be globally, strongly and superlinearly convergent. Finally, some preliminary numerical experiments are reported to show that the algorithm is practicable and effective. |
| |
Keywords: | 90C30 90C53 49M37 65K10 65K05 |
本文献已被 ScienceDirect 等数据库收录! |
|