A Ljusternik-Schnirelman minimax algorithm for finding equality constrained saddle points and its application for solving eigen problems. I. Algorithm and global convergence (Q2631987)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Ljusternik-Schnirelman minimax algorithm for finding equality constrained saddle points and its application for solving eigen problems. I. Algorithm and global convergence |
scientific article |
Statements
A Ljusternik-Schnirelman minimax algorithm for finding equality constrained saddle points and its application for solving eigen problems. I. Algorithm and global convergence (English)
0 references
16 May 2019
0 references
The paper is concerned with a minimax algorithm in order to find critical points of constrained functionals. Indeed the author develops a general numeric algorithm based on the Ljusternik-Schnirelman theory to find equality constrained saddle points for functional defined in Hilbert spaces. The author studies also the global convergence of the algorithm. As an application, he makes numerical experiments to find normalised solutions of a semilinear Schrödinger equation.
0 references
Ljusternik-Schnirelman critical point theory
0 references
minimax algorithm
0 references
global convergence
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
