Normalized Wolfe-Powell-type local minimax method for finding multiple unstable solutions of nonlinear elliptic PDEs

DOI10.1007/S11425-021-2093-1MaRDI QIDQ6074852zbMATH OpenFDO

Authors Wei Liu, Ziqing Xie, Wenfan Yi

Publication date 19 October 2023

Published in Science China. Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2108.05102

zbMATH Keywords

algorithmssemilinear elliptic PDEslocal minimax methodmultiple unstable solutions

Mathematics Subject Classification ID

Semilinear elliptic equations (35J61) Variational methods applied to PDEs (35A15) Numerical solutions to equations with nonlinear operators (65J15) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12)

Abstract: 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 [Y. Li and J. Zhou, SIAM J. Sci. Comput., 24(3), 865--885 (2002)] and play 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 framework named as the normalized Wolfe-Powell-type LMM (NWP-LMM) is 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 NWP-LMM algorithm. 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 than its known LMM companions.

Recommendations

• Normalized Goldstein-type local minimax method for finding multiple unstable solutions of semilinear elliptic PDEs
• An improved local-min-orthogonal method for finding multiple solutions to nonlinear elliptic PDEs
• Nonmonotone local minimax methods for finding multiple saddle points
• Convergence Results of a Local Minimax Method for Finding Multiple Critical Points
• Finding multiple solutions to elliptic PDE with nonlinear boundary conditions

Cites work

• scientific article; zbMATH DE number 3986206 (Why is no real title available?)
• scientific article; zbMATH DE number 3529352 (Why is no real title available?)
• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• A Minimax Method for Finding Multiple Critical Points in Banach Spaces and Its Application to Quasi-linear Elliptic PDE
• A constrained gentlest ascent dynamics and its applications to finding excited states of Bose-Einstein condensates
• A high-linking algorithm for sign-changing solutions of semilinear elliptic equations
• A minimax method for finding multiple critical points and its applications to semilinear PDEs
• A mountain pass method for the numerical solution of semilinear elliptic problems
• A new augmented singular transform and its partial Newton-correction method for finding more solutions
• A survey of nonlinear conjugate gradient methods
• ALGORITHMS AND VISUALIZATION FOR SOLUTIONS OF NONLINEAR ELLIPTIC EQUATIONS
• An augmented singular transform and its partial Newton method for finding new solutions
• An improved search-extension method for computing multiple solutions of semilinear PDEs
• Analysis of search-extension method for finding multiple solutions of nonlinear problem
• Constrained high-index saddle dynamics for the solution landscape with equality constraints
• Convergence Conditions for Ascent Methods
• Convergence Conditions for Ascent Methods. II: Some Corrections
• Convergence Results of a Local Minimax Method for Finding Multiple Critical Points
• Convergence analysis of a spectral-Galerkin-type search extension method for finding multiple solutions to semilinear problems
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• Finding multiple solutions to elliptic PDE with nonlinear boundary conditions
• Function minimization by conjugate gradients
• High-index optimization-based shrinking dimer method for finding high-index saddle points
• Infinite dimensional Morse theory and multiple solution problems
• Normalized Goldstein-type local minimax method for finding multiple unstable solutions of semilinear elliptic PDEs
• On finding multiple solutions to a singularly perturbed Neumann problem
• Optimization theory and methods. Nonlinear programming
• Search extension method for multiple solutions of a nonlinear problem
• Searching the solution landscape by generalized high-index saddle dynamics
• Shrinking dimer dynamics and its applications to saddle point search
• Solving multiple solution problems: computational methods and theory revisited
• The gentlest ascent dynamics

Cited in

(1)

• Nonmonotone local minimax methods for finding multiple saddle points

This page was built for publication: Normalized Wolfe-Powell-type local minimax method for finding multiple unstable solutions of nonlinear elliptic PDEs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6074852)