Abstract
The local minimax method (LMM) proposed by Li and Zhou (2001) and Li and Zhou (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 Li and Zhou (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.
References
Al-Baali M. Descent property and global convergence of the Fletcher-Reeves method with inexact line search. IMA J Numer Anal, 1985, 5: 121–124
Chang K-C. Infinite Dimensional Morse Theory and Multiple Solution Problems. Boston: Birkhäuser, 1993
Chen C M, Xie Z Q. Search extension method for multiple solutions of a nonlinear problem. Comput Math Appl, 2004, 47: 327–343
Chen C M, Xie Z Q. Analysis of search-extension method for finding multiple solutions of nonlinear problem. Sci China Ser A, 2008, 51: 42–54
Chen G, Zhou J X, Ni W-M. Algorithms and visualization for solutions of nonlinear elliptic equations. Internat J Bifur Chaos, 2000, 10: 1565–1612
Choi Y S, McKenna P J. A mountain pass method for the numerical solution of semilinear elliptic problems. Nonlinear Anal, 1993, 20: 417–437
Dai Y H, Yuan Y-X. Nonlinear Conjugate Gradient Methods (in Chinese). Shanghai: Shanghai Scientific & Technical Publishers, 2000
Dalfovo F, Giorgini S, Pitaevskii L P, et al. Theory of Bose-Einstein condensation in trapped gases. Rev Modern Phys, 1999, 71: 463–512
Ding Z H, Costa D, Chen G. A high-linking algorithm for sign-changing solutions of semilinear elliptic equations. Nonlinear Anal, 1999, 38: 151–172
E W N, Ren W Q, Vanden-Eijnden E. String method for the study of rare events. Phys Rev B, 2002, 66: 052301
E W N, Zhou X. The gentlest ascent dynamics. Nonlinearity, 2011, 24: 1831–1842
Fletcher R. Practical Methods of Optimization. Chichester: John Wiley & Sons, 1987
Fletcher R, Reeves C M. Function minimization by conjugate gradients. Comput J, 1964, 7: 149–154
Hager W W, Zhang H C. A survey of nonlinear conjugate gradient methods. Pac J Optim, 2006, 2: 35–58
Henkelman G, Jónsson H. A dimer method for finding saddle points on high dimensional potential surfaces using only first derivatives. J Chem Phys, 1999, 111: 7010–7022
Le A, Wang Z-Q, Zhou J X. Finding multiple solutions to elliptic PDE with nonlinear boundary conditions. J Sci Comput, 2013, 56: 591–615
Li Y X, Zhou J X. A minimax method for finding multiple critical points and its applications to semilinear PDEs. SIAM J Sci Comput, 2001, 23: 840–865
Li Y X, Zhou J X. Convergence results of a local minimax method for finding multiple critical points. SIAM J Sci Comput, 2002, 24: 865–885
Li Z X, Wang Z-Q, Zhou J X. A new augmented singular transform and its partial Newton-correction method for finding more solutions. J Sci Comput, 2017, 71: 634–659
Liu W, Xie Z Q, Yi W F. Normalized Goldstein-type local minimax method for finding multiple unstable solutions of semilinear elliptic PDEs. Commun Math Sci, 2021, 19: 147–174
Liu W, Xie Z Q, Yuan Y J. Convergence analysis of a spectral-Galerkin-type search extension method for finding multiple solutions to semilinear problems (in Chinese). Sci Sin Math, 2021, 51: 1407–1431
Liu W, Xie Z Q, Yuan Y J. A constrained gentlest ascent dynamics and its applications to finding excited states of Bose-Einstein condensates. J Comput Phys, 2023, 473: 111719
Nocedal J, Wright S J. Numerical Optimization, 2nd ed. New York: Springer, 2006
Powell M J D. Some global convergence properties of a variable metric algorithm for minimization without exact line searches. In: Nonlinear Programming. Proceedings of Symposia in Applied Mathematics, vol. 9. Providence: Amer Math Soc, 1976, 53–72
Rabinowitz P H. Minimax Methods in Critical Point Theory with Applications to Differential Equations. CBMS Regional Conference Series in Mathematics, vol. 65. Providence: Amer Math Soc, 1986
Ren W Q, Vanden-Eijnden E. A climbing string method for saddle point search. J Chem Phys, 2013, 138: 134105
Sun W Y, Yuan Y-X. Optimization Theory and Methods: Nonlinear Programming. New York: Springer, 2006
Wolfe P. Convergence conditions for ascent methods. SIAM Rev, 1969, 11: 226–235
Wolfe P. Convergence conditions for ascent methods. II: Some corrections. SIAM Rev, 1971, 13: 185–188
Xie Z Q, Chen C M, Xu Y. An improved search-extension method for computing multiple solutions of semilinear PDEs. IMA J Numer Anal, 2005, 25: 549–576
Xie Z Q, Yi W F, Zhou J X. An augmented singular transform and its partial Newton method for finding new solutions. J Comput Appl Math, 2015, 286: 145–157
Xie Z Q, Yuan Y J, Zhou J X. On finding multiple solutions to a singularly perturbed Neumann problem. SIAM J Sci Comput, 2012, 34: A395–A420
Yao X D, Zhou J X. A minimax method for finding multiple critical points in Banach spaces and its application to quasi-linear elliptic PDE. SIAM J Sci Comput, 2005, 26: 1796–1809
Yin J Y, Huang Z, Zhang L. Constrained high-index saddle dynamics for the solution landscape with equality constraints. J Sci Comput, 2022, 91: 62
Yin J Y, Yu B, Zhang L. Searching the solution landscape by generalized high-index saddle dynamics. Sci China Math, 2021, 64: 1801–1816
Yin J Y, Zhang L, Zhang P W. High-index optimization-based shrinking dimer method for finding high-index saddle points. SIAM J Sci Comput, 2019, 41: A3576–A3595
Zhang J Y, Du Q. Shrinking dimer dynamics and its applications to saddle point search. SIAM J Numer Anal, 2012, 50: 1899–1921
Zhang L, Ren W Q, Samanta A, et al. Recent developments in computational modelling of nucleation in phase transformations. NPJ Comput Mater, 2016, 2: 16003
Zhou J X. Solving multiple solution problems: Computational methods and theory revisited. Commun Appl Math Comput, 2017, 31: 1–31
Acknowledgements
This work was supported by National Natural Science Foundation of China (Grant Nos. 12171148 and 11771138) and the Construct Program of the Key Discipline in Hunan Province. Wei Liu was supported by National Natural Science Foundation of China (Grant Nos. 12101252 and 11971007). Wenfan Yi was supported by National Natural Science Foundation of China (Grant No. 11901185), National Key R&D Program of China (Grant No. 2021YFA1001300) and the Fundamental Research Funds for the Central Universities (Grant No. 531118010207).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liu, W., Xie, Z. & Yi, W. Normalized Wolfe-Powell-type local minimax method for finding multiple unstable solutions of nonlinear elliptic PDEs. Sci. China Math. 66, 2361–2384 (2023). https://doi.org/10.1007/s11425-021-2093-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11425-021-2093-1
Keywords
- semilinear elliptic PDEs
- multiple unstable solutions
- local minimax method
- normalized strong Wolfe-Powell-type search rule
- conjugate gradient-type descent direction
- general descent directions
- global convergence