http:^^www.cs.wisc.edu^dienst^ui^2.0^describe^ncstrl.uwmadison%2fmp-tr-95-15

This data set contains WWW-pages collected from computer science departments of various universities

Server: Dienst V4-1-1 
MIME-version: 1.0
Content-type: text/html

<TITLE>The Ill-Posed Linear Complementarity Problem </TITLE>
<H2>The Ill-Posed Linear Complementarity Problem </H2>
 O. L. Mangasarian<BR>
MP-TR-95-15<BR>
August 1995
<p>
 A regularization of the linear complementarity problem (LCP) is proposed that leads to an exact solution, if one exists, otherwise a minimizer of a natural residual of the problem is obtained. The regularized LCP (RLCP) turns out to be a linear program with equilibrium constraints (LPEC) that is always solvable. For the case when the underlying matrix <i>M</i> of the LCP is in the class <i>Q_0</i> (LCP solvable if feasible), the RLCP can be solved by a quadratic program, which is convex if <i>M</i> is positive semidefinite. An explicitly exact penalty of the RLCP formulation is also given when <i>M\in Q_0</i> and implicitly exact otherwise. Error bounds on the distance between an arbitrary point to the set of LCP residual minimizers follow from LCP error bound theory. Computational algorithms for solving the RLCP consist of solving a convex quadratic program for positive semidefinite <i>M,</i> otherwise a generally nonconvex quadratic program when <i>M\in Q_0,</i> for which a potentially finitely terminating Frank-Wolfe method is proposed. For a completely general <i>M,</i> a parametric method is proposed wherein for each value of the parameter a Frank-Wolfe algorithm is carried out.<P>
<hr><p>
<H2>How to view this document</H2>
<P><UL>
<P>
<LI>Display the <B>whole</B> document in one of the following formats.
<P><UL>
<LI><!WA0><A HREF="http://www.cs.wisc.edu/Dienst/Repository/2.0/Body/ncstrl.uwmadison%2fMP-TR-95-15/postscript">PostScript
</A> 53111 bytes. (compressed on disk, will be sent uncompressed)
</UL>
<BR>
<LI>
<!WA1><A HREF="http://www.cs.wisc.edu/Dienst/UI/2.0/Print/ncstrl.uwmadison%2fMP-TR-95-15">Print or download all or selected pages.
</A></UL>
<HR>
<p>
<BLOCKQUOTE> You are granted permission for the non-commercial reproduction, distribution,display, and performance of this technical report in any format, BUT thispermission is only for a period of 45 (forty-five) days from the most recenttime that you verified that this technical report is still available fromthe Computer Science Department of the University of Wisconsin - Madison underterms that include this permission.  All other rights are reserved by theauthor(s). </BLOCKQUOTE></p><HR><p>
[ <!WA2><A HREF="http://www.cs.wisc.edu/Dienst/UI/2.0/Search">Search</A>
 ]
<HR>
<I><!WA3><img align=left  src="http://www.cs.wisc.edu/Dienst/htdocs/image_gif/sm_ncstrl.gif">NCSTRL</I><br><I>This server operates at UW Madison Computer Sciences Technical Reports .</I> <BR><I>Send email to <!WA4><A HREF="mailto: [e-mail]">[e-mail]</A> </I>