A Unified Approach to Infeasible-Interior-Point Algorithms via Geometrical Linear Complementarity Problems.
Saved in:
| Title: | A Unified Approach to Infeasible-Interior-Point Algorithms via Geometrical Linear Complementarity Problems. |
|---|---|
| Authors: | Mizuno, Shinji, Jarre, F., Stoer, J. |
| Source: | Applied Mathematics & Optimization. 1996, Vol. 33 Issue 3, p315. 27p. |
| Subjects: | Interior-point methods, Linear programming, Linear complementarity problem |
| Abstract: | There are many interior-point algorithms for LP (linear programming), QP (quadratic programming), and LCPs (linear complementarity problems). While the algebraic definitions of these problems are different from each other, we show that they are all of the same general form when we define the problems geometrically. We derive some basic properties related to such geometrical (monotone) LCPs and based on these properties, we propose and analyze a simple infeasible-interior-point algorithm for solving geometrical LCPs. The algorithm can solve any instance of the above classes without making any assumptions on the problem. It features global convergence, polynomial-time convergence if there is a solution that is "smaller" than the initial point, and quadratic convergence if there is a strictly complementary solution. [ABSTRACT FROM AUTHOR] |
| Copyright of Applied Mathematics & Optimization is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
