Abstract
Concepts of conditioning have long been important in numerical work on solving systems of equations, but in recent years attempts have been made to extend them to feasibility conditions, optimality conditions, complementarity conditions and variational inequalities, all of which can be posed as solving ‘generalized equations’ for set-valued mappings. Here, the conditioning of such generalized equations is systematically organized around four key notions: metric regularity, subregularity, strong regularity and strong subregularity. Various properties and characterizations already known for metric regularity itself are extended to strong regularity and strong subregularity, but metric subregularity, although widely considered, is shown to be too fragile to support stability results such as a radius of good behavior modeled on the Eckart–Young theorem.
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.
