A Ljusternik-Schnirelman minimax algorithm for finding equality constrained saddle points and its application for solving eigen problems. I. Algorithm and global convergence

From MaRDI portal
Publication:2631987





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.



Cites work









This page was built for publication: A Ljusternik-Schnirelman minimax algorithm for finding equality constrained saddle points and its application for solving eigen problems. I. Algorithm and global convergence

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