Abstract
The present work compares the computational efficiency of two means of determining a direction vector S at constraint boundaries and demonstrates the advantages of using the alternative that formulates the S-determination subproblem with a single quadratic constraint, which in turn can be cast as a special linear problem and solved directly.
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.