Level set methods for finding critical points of mountain pass type

@inproceedings{Lewis2011LevelSM,
  title={Level set methods for finding critical points of mountain pass type},
  author={Adrian S. Lewis and C. H. Jeffrey Pang},
  year={2011}
}
Computing mountain passes is a standard way of finding critical points. We describe a numerical method for finding critical points that is convergent in the nonsmooth case and locally superlinearly convergent in the smooth finite dimensional case. We apply these techniques to describe a strategy for addressing the Wilkinson problem of calculating the distance from a matrix to a closest matrix with repeated eigenvalues. Finally, we relate critical points of mountain pass type to nonsmooth and… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 42 references

Variational Analysis and Generalized Differentiation I and II

  • B. S. Mordukhovich
  • Springer, Berlin, 2006. 4082 A.S. Lewis, C.H.J…
  • 2011

A bisection algorithm for the numerical mountain pass

  • V. Barutello, S. Terracini
  • NoDEA Nonlinear Differential Equations Appl. 14
  • 2007
1 Excerpt

Techniques of Variational Analysis

  • J. M. Borwein, Q. J. Zhu
  • Springer
  • 2005

Similar Papers

Loading similar papers…