Nonsmooth Equations: Motivation and Algorithms
SIAM Journal on Optimization1993Vol. 3(3), pp. 443–465
Citations Over TimeTop 1% of 1993 papers
Abstract
This paper reports on some recent developments in the area of solving of nonsmooth equations by generalized Newton methods. The emphasis is on three topics: motivation, characterization of superlinear convergence, and a new Gauss–Newton method for solving a certain class of nonsmooth equations. The characterization of superlinear convergence extends the classical result of Dennis and Moré for smooth equations and that of Ip and Kyparisis for B-differentiable equations. The Gauss–Newton method is different from that proposed recently by Han, Pang, and Rangaraj; it uses convex quadratic programs to generate descent directions for the least-squares merit function.
Related Papers
- → The local and semilocal convergence analysis of new Newton-like iteration methods(2018)5 cited
- A Modified Newton'S Iterative Method(2011)
- Proof of convergence of Newton-Raphson iterative method in simulating unsteady flow in river networks(2001)
- New convergence theorems for Newton-like-iterative methods(2010)
- Newton-like methods for solving nonlinear equations(2004)