Photo by zero_arw from unsplash
In Yao (J. Sci. Comput. 66, 19–40 2016), two Ljusternik-Schnirelman minimax algorithms for capturing multiple free saddle points are developed from well-known Ljusternik-Schnirelman critical point theory, numerical experiment is carried… Click to show full abstract
In Yao (J. Sci. Comput. 66, 19–40 2016), two Ljusternik-Schnirelman minimax algorithms for capturing multiple free saddle points are developed from well-known Ljusternik-Schnirelman critical point theory, numerical experiment is carried out and global convergence is established. In this paper, a Ljusternik-Schnirelman minimax algorithm for calculating multiple equality constrained saddle points is presented. The algorithm is applied to numerically solve eigen problems. Finally, global convergence for the algorithm is verified.
Journal Title: Advances in Computational Mathematics
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!