Abstract
Descent algorithms use comparisons of a merit function, to ensure the global convergence of generated iterates to at least a stationary point, even to solutions satisfying the second order necessary optimality conditions. Unfortunately, the comparison of the merit function values may fail to be precise enough for estimates reaching the square root of the machine precision. We present a clever way to compare merit function values, ensuring that full machine precision may be reached.
Published Version
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.
