Superlinear primal-dual affine scaling algorithms for LCP |
| |
Authors: | R. D. C. Monteiro S. J. Wright |
| |
Affiliation: | (1) School of Industrial and Systems Engineering, Georgia Institute of Technology, 30332 Atlanta, GA, USA;(2) Mathematics and Computer Science Division, Argonne National Laboratory, 9700 South Cass Avenue, 60439 Argonne, IL, USA |
| |
Abstract: | We describe an interior-point algorithm for monotone linear complementarity problems in which primal-dual affine scaling is used to generate the search directions. The algorithm is shown to have global and superlinear convergence with Q-order up to (but not including) two. The technique is shown to be consistent with a potential-reduction algorithm, yielding the first potential-reduction algorithm that is both globally and superlinearly convergent.Corresponding author. The work of this author was based on research supported by the Office of Scientific Computing, U.S. Department of Energy, under Contract W-31-109-Eng-38.The work of this author was based on research supported by the National Science Foundation under grant DDM-9109404 and the Office of Naval Research under grant N00014-93-1-0234. This work was done while the author was a faculty member of the Systems and Industrial Engineering Department at the University of Arizona. |
| |
Keywords: | Interior-point methods Primal-dual affine scaling Linear programming Linear complementarity |
本文献已被 SpringerLink 等数据库收录! |
|