Nonlinear optimization in Hilbert space using Sobolev gradients with applications
Parimah Kazemi, Robert Renka

TL;DR
This paper explores nonlinear optimization in Hilbert spaces using Sobolev gradients, reviewing Newton and Levernberg-Marquardt methods, and applies these techniques to the Ginzburg-Landau model of superconductivity.
Contribution
It introduces Sobolev gradient-based optimization methods for nonlinear PDEs and demonstrates their application to a superconductivity model.
Findings
Newton's method convergence properties analyzed
Levernberg-Marquardt method results extended to PDEs
Application to Ginzburg-Landau model shows effectiveness
Abstract
The problem of finding roots or solutions of a nonlinear partial differential equation may be formulated as the problem of minimizing a sum of squared residuals. One then defines an evolution equation so that in the asymptotic limit a minimizer, and often a solution of the PDE, is obtained. The corresponding discretized nonlinear least squares problem is an often met problem in the field of numerical optimization, and thus there exist a wide variety of methods for solving such problems. We review here Newton's method from nonlinear optimization both in a discrete and continuous setting and present results of a similar nature for the Levernberg-Marquardt method. We apply these results to the Ginzburg-Landau model of superconductivity.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNumerical Methods and Algorithms · Iterative Methods for Nonlinear Equations · Numerical methods for differential equations
