Normalized Wolfe-Powell-type Local Minimax Method for Finding Multiple Unstable Solutions of Nonlinear Elliptic PDEs

08/11/2021
by   Wei Liu, et al.
0

The local minimax method (LMM) proposed in [Y. Li and J. Zhou, SIAM J. Sci. Comput. 23(3), 840–865 (2001)] and [Y. Li and J. Zhou, SIAM J. Sci. Comput. 24(3), 865–885 (2002)] is an efficient method to solve nonlinear elliptic partial differential equations (PDEs) with certain variational structures for multiple solutions. The steepest descent direction and the Armijo-type step-size search rules are adopted in the above work and playing a significant role in the performance and convergence analysis of traditional LMMs. In this paper, a new algorithm framework of the LMMs is established based on general descent directions and two normalized (strong) Wolfe-Powell-type step-size search rules. The corresponding algorithm named as the normalized Wolfe-Powell-type LMM (NWP-LMM) are introduced with its feasibility and global convergence rigorously justified for general descent directions. As a special case, the global convergence of the NWP-LMM algorithm combined with the preconditioned steepest descent (PSD) directions is also verified. Consequently, it extends the framework of traditional LMMs. In addition, conjugate gradient-type (CG-type) descent directions are utilized to speed up the LMM algorithms. Finally, extensive numerical results for several semilinear elliptic PDEs are reported to profile their multiple unstable solutions and compared for different algorithms in the LMM's family to indicate the effectiveness and robustness of our algorithms. In practice, the NWP-LMM combined with the CG-type direction indeed performs much better among its LMM companions.

READ FULL TEXT

page 21

page 22

page 23

page 24

research
09/04/2021

Nonmonotone Local Minimax Methods for Finding Multiple Saddle Points

In this paper, combining normalized nonmonotone search strategies with t...
research
11/05/2019

Deep least-squares methods: an unsupervised learning-based numerical method for solving elliptic PDEs

This paper studies an unsupervised deep learning-based numerical approac...
research
03/06/2021

The gradient descent method for the convexification to solve boundary value problems of quasi-linear PDEs and a coefficient inverse problem

We study the global convergence of the gradient descent method of the mi...
research
09/30/2021

The Deep Minimizing Movement Scheme

Solutions of certain partial differential equations (PDEs) are often rep...
research
04/02/2020

Using gradient directions to get global convergence of Newton-type methods

The renewed interest in Steepest Descent (SD) methods following the work...

Please sign up or login with your details

Forgot password? Click here to reset