Abstract
<p style='text-indent:20px;'>Polynomial optimization problem with second-order cone complementarity constraints (SOCPOPCC) is a special case of mathematical program with second-order cone complementarity constraints (SOCMPCC). In this paper, we consider how to apply Lasserre's type of semidefinite relaxation method to solve SOCPOPCC. To this end, we first reformulate SOCPOPCC equivalently as a polynomial optimization and then solve the reformulated polynomial optimization with semidefinite relaxation method. For a special case of SOCPOPCC, we present another reformulation of polynomial optimization, which is of lower degree. SDP relaxation method is applied to solve the new polynomial optimization. Numerical examples are reported to show the efficiency of our proposed method.</p>
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.
