Abstract
With the help of the newly developed technique—second order cone (SOC) constraints to strengthen the SDP relaxation of the extended trust-region subproblem (eTRS), we modify two recent SDP relaxation based branch and bound algorithms for solving eTRS. Numerical experiments on some types of problems show that the new algorithms run faster for finding the global optimal solutions than the SDP relaxation based algorithms.
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.
