Abstract
In the present paper the radius of convergence of a class of locally convergent nonlinear programming algorithms (containing Robinson's and Wilson's methods) applied to a parametric nonlinear programming problem is estimated. A consequence is the numerical feasibility of globalizations of Robinson's and Wilson's methods by means of continuation techniques.
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 callMore From: Mathematische Operationsforschung und Statistik. Series Optimization
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.
