Abstract
We develop an active set method for solving second-order cone programs that may have an arbitrary number of linear constraints but are restricted to having only one second-order cone constraint. Problems of this form arise in the context of robust optimization and trust region methods. The proposed active set method exploits the fact that a second-order cone program with only one second-order cone constraint and no inequality constraints can be solved in closed form.
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.
