A mountain pass algorithm with projector

Authors:
N. Tacheny;C. Troestler
Affiliations:
-;-
Venue:
Journal of Computational and Applied Mathematics
Year:
2012

Citing 6
Cited 0

A mountain pass method for the numerical solution of semilinear elliptic problems

Nonlinear Analysis: Theory, Methods & Applications
What is the subdifferential of the closed convex hull of a function?

SIAM Journal on Mathematical Analysis
Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization

ACM Transactions on Mathematical Software (TOMS)
A numerical investigation of sign-changing solutions to superlinear elliptic equations on symmetric domains

Journal of Computational and Applied Mathematics
A Minimax Method for Finding Multiple Critical Points and Its Applications to Semilinear PDEs

SIAM Journal on Scientific Computing
Numerical Variational Methods Applied to Cylinder Buckling

SIAM Journal on Scientific Computing

Quantified Score

Hi-index	7.29

Visualization

Abstract

In this paper, we present an enhanced version of the minimax algorithm of Chen, Ni, and Zhou that offers the additional guarantee that the solution found is a fix-point of a projector on a cone. Positivity, negativity, and monotonicity can be expressed in this way. The convergence of the algorithm is proved by means of a ''computational deformation lemma'' instead of the usual deformation lemma used in the calculus of variations.