Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

A Smoothing-Type Algorithm for Solving Linear Complementarity Problems with Strong Convergence Properties

Journal Article · · Applied Mathematics and Optimization
 [1]
  1. Tianjin University, Department of Mathematics, School of Science (China)
In this paper, we construct an augmented system of the standard monotone linear complementarity problem (LCP), and establish the relations between the augmented system and the LCP. We present a smoothing-type algorithm for solving the augmented system. The algorithm is shown to be globally convergent without assuming any prior knowledge of feasibility/infeasibility of the problem. In particular, if the LCP has a solution, then the algorithm either generates a maximal complementary solution of the LCP or detects correctly solvability of the LCP, and in the latter case, an existing smoothing-type algorithm can be directly applied to solve the LCP without any additional assumption and it generates a maximal complementary solution of the LCP; and that if the LCP is infeasible, then the algorithm detect correctly infeasibility of the LCP. To the best of our knowledge, such properties have not appeared in the existing literature for smoothing-type algorithms.
OSTI ID:
21067394
Journal Information:
Applied Mathematics and Optimization, Journal Name: Applied Mathematics and Optimization Journal Issue: 1 Vol. 57; ISSN 0095-4616
Country of Publication:
United States
Language:
English

Similar Records

A superlinearly convergent infeasible-interior-point algorithm for geometrical LCPs without a strictly complementary condition
Conference · Fri Dec 30 23:00:00 EST 1994 · OSTI ID:36289

A class of smoothing functions for nonlinear complementarity problems and variational inequalities
Conference · Fri Dec 30 23:00:00 EST 1994 · OSTI ID:36255

A linear complementarity approach to the frictionless gripper problem
Journal Article · Tue Mar 31 23:00:00 EST 1992 · International Journal of Robotics Research; (United States) · OSTI ID:6904996