Abstract
An augmented Lagrange-SQP method with Lipschitz continuous Lagrange multiplier updates is analyzed. The approximation of this method is investigated, and convergence results are presented. A mesh-independence principle for the augmented Lagrange-SQP method is proved, which asserts that asymptotically the infinite-dimensional algorithm and finite-dimensional discretizations have the same convergence property. More precisely, for sufficiently small mesh-size there is at most a difference of one iteration step between the number of steps required by the infinite-dimensional method and its discretization to converge within a given tolerance l > 0. The theoretical results are demonstrated numerically by a parameter identification problem.
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.
