Abstract
We consider the linear monotone complementarity problem for domains obtained as the intersection of an affine subspace and the Cartesian product of symmetric cones. A primal-dual potential reduction algorithm is described and its complexity estimates are established with the help of the Jordan-algebraic technique.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
