Abstract
Interior-point methods require strictly feasible points as starting points. In theory, this requirement does not seem to be particularly restrictive, but it can be costly in computation. To overcome this deficiency, most existing practical algorithms allow positive but infeasible starting points and seek feasibility and optimality simultaneously. Algorithms of this type shall be called infeasible interior-point algorithms. Despite their superior performance, existing infeasible interiorpoint algorithms still lack a satisfactory demonstration of theoretical convergence and polynomial complexity. This paper studies a popular infeasible interior-point algorithmic framework that was implemented for linear programming in the highly successful interior-point code OB1 [I. J. Lustig, R. E. Marsten, and D. F. Shanno, Linear Algebra Appl., 152 (1991), pp. 191–222]. For generality, the analysis is carried out on a horizontal linear complementarily problem that includes linear and quadratic programming, as well as the standard linear complementarily problem. Under minimal assumptions, it is demonstrated that with properly controlled steps the algorithm converges at a global Q-linear rate. Moreover, with properly chosen starting points it is established the algorithm can $\varepsilon $ obtain e-feasibility and $\varepsilon $-complementarily in at most $O( n^2 \ln ( 1/\varepsilon ) )$ iterations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.