Abstract
A systematic way for generating penalty and barrier methods is proposed in order to solve variational inequalities with a maximal monotone map and over a feasible set which is the intersection of three kinds of inequalities. The first type of inequalities consists of a finite number of convex inequalities, the second concerns an affine map taking its values in the cone of symmetric semidefinite positive matrices, while the third concerns an affine map taking its values in the Lorentz cone. Convergence is proved under essentially the assumptions that Slater's condition holds and that the set of solutions of the variational inequality is nonempty and compact.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.