Global Convergence Analysis of Line Search Interior-Point Methods for Nonlinear Programming without Regularity Assumptions |
| |
Authors: | X W Liu J Sun |
| |
Institution: | (1) Research Fellow, Department of Decision Sciences and Singapore-MIT Alliance, Associate Professor, Department of Applied Mathematics, National University of Singapore, Hebei University of Technology, Kent Ridge, Tianjin, Singapore, PRC.;(2) Professor, Department of Decision Sciences and Singapore-MIT Alliance, National University of Singapore, Kent Ridge, Singapore |
| |
Abstract: | As noted by Wächter and Biegler (Ref. 1), a number of interior-point methods for nonlinear programming based on line-search strategy may generate a sequence converging to an infeasible point. We show that, by adopting a suitable merit function, a modified primal-dual equation, and a proper line-search procedure, a class of interior-point methods of line-search type will generate a sequence such that either all the limit points of the sequence are KKT points, or one of the limit points is a Fritz John point, or one of the limit points is an infeasible point that is a stationary point minimizing a function measuring the extent of violation to the constraint system. The analysis does not depend on the regularity assumptions on the problem. Instead, it uses a set of satisfiable conditions on the algorithm implementation to derive the desired convergence property.Communicated by Z. Q. LuoThis research was partially supported by Grant R-314-000-026/042/057-112 of National University of Singapore and Singapore-MIT Alliance. We thank Professor Khoo Boo Cheong, Cochair of the High Performance Computation Program of Singapore-MIT Alliance, for his support |
| |
Keywords: | Nonlinear programming interior-point methods convergence |
本文献已被 SpringerLink 等数据库收录! |
|