Abstract
Karush-Kuhn-Tucker (KKT) systems are linear systems with coefficient matrices of the form H A A T O where H is symmetric. A normwise structured backward error for KKT systems is defined, and a computable formula of the structured backward error is obtained. Simple examples show that the structured backward error may be arbitrarily larger than the unstructured ones in the worst case, and a stable algorithm for solving KKT systems is not necessarily strongly stable. Consequently, the computable formula of the structured backward error may be useful for testing the strong stability of practical algorithms for solving KKT systems.
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.
