• Login
    View Item 
    •   MINDS@UW Home
    • MINDS@UW Madison
    • College of Letters and Science, University of Wisconsin–Madison
    • Department of Computer Sciences, UW-Madison
    • Math Prog Technical Reports
    • View Item
    •   MINDS@UW Home
    • MINDS@UW Madison
    • College of Letters and Science, University of Wisconsin–Madison
    • Department of Computer Sciences, UW-Madison
    • Math Prog Technical Reports
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Lineality Removal for Copositive-Plus Normal Maps

    Thumbnail
    File(s)
    Lineality Removal for Copositive-Plus Normal Maps (158.1Kb)
    Date
    1994
    Author
    Ferris, Michael
    Cao, Menglin
    Metadata
    Show full item record
    Abstract
    We are concerned with solving affine variational inequalities defined by a linear map A and a polyhedral set C. Most of the existing pivotal methods for such inequalities or mixed linear complementarity problems depend on the existence of extreme points in C or a certain non-singularity property of A with respect to the lineality of C. In this paper, we prove that if A is copositive-plus with respect to the recession cone of C, then the lineality space can be removed without any further assumptions. The reductions given here extend the currently known pivotal methods to solve affine variational inequalities or prove that no solution exists, whenever A is copositive-plus withe respect to the recession cone of C.
    Subject
    mixed complementarity problems
    variational inequalities
    lineality space
    normal maps
    copositive-plus matrices
    Permanent Link
    http://digital.library.wisc.edu/1793/64520
    Type
    Technical Report
    Citation
    94-02
    Part of
    • Math Prog Technical Reports

    Contact Us | Send Feedback
     

     

    Browse

    All of MINDS@UWCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    Login

    Contact Us | Send Feedback