Generalized Newton's method based on graphical derivatives
From MaRDI portal
Abstract: This paper concerns developing a numerical method of the Newton type to solve systems of nonlinear equations described by nonsmooth continuous functions. We propose and justify a new generalized Newton algorithm based on graphical derivatives, which have never been used to derive a Newton-type method for solving nonsmooth equations. Based on advanced techniques of variational analysis and generalized differentiation, we establish the well-posedness of the algorithm, its local superlinear convergence, and its global convergence of the Kantorovich type. Our convergence results hold with no semismoothness assumption, which is illustrated by examples. The algorithm and main results obtained in the paper are compared with well-recognized semismooth and -differentiable versions of Newton's method for nonsmooth Lipschitzian equations.
Recommendations
Cites work
- A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
- A nonsmooth version of Newton's method
- A semismooth equation approach to the solution of nonlinear complementarity problems
- An Implicit-Function Theorem for a Class of Nonsmooth Functions
- Applying metric regularity to compute a condition measure of a smoothing algorithm for matrix games
- Complete Characterization of Openness, Metric Regularity, and Lipschitzian Properties of Multifunctions
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Fat homeomorphisms and unbounded derivate containers
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Globally Convergent Newton Methods for Nonsmooth Equations
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 4082855 (Why is no real title available?)
- scientific article; zbMATH DE number 3760850 (Why is no real title available?)
- scientific article; zbMATH DE number 3772411 (Why is no real title available?)
- scientific article; zbMATH DE number 50640 (Why is no real title available?)
- scientific article; zbMATH DE number 3206520 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3385448 (Why is no real title available?)
- Lipschitzian inverse functions, directional derivatives, and applications in \(C^{1,1}\) optimization
- Local linear convergence for alternating and averaged nonconvex projections
- Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
- Maximum principle in the problem of time optimal response with nonsmooth constraints
- Metric regularity and subdifferential calculus
- Newton's method for a class of nonsmooth functions
- Newton's Method for B-Differentiable Equations
- Nonsmooth analysis
- Nonsmooth equations in optimization. Regularity, calculus, methods and applications
- Nonsmooth Equations: Motivation and Algorithms
- On concepts of directional differentiability
- On the local convergence of semismooth Newton methods for linear and nonlinear second-order cone programs without strict complementarity
- Semismooth and Semiconvex Functions in Constrained Optimization
- Set-valued analysis
- Solving Nonlinear Equations with Newton's Method
- Subdifferentials of compactly Lipschitzian vector-valued functions
- Uniformity and inexact version of a proximal method for metrically regular mappings
- Variational Analysis
- Variational analysis of functions of the roots of polynomials
Cited in
(20)- Computing the Newtonian graph
- Semismoothness of the maximum eigenvalue function of a symmetric tensor and its application
- A generalized univariate Newton method motivated by proximal regularization
- On (local) analysis of multifunctions via subspaces contained in graphs of generalized derivatives
- Newton's method with fractional derivatives and various iteration processes via visual analysis
- Approximations and generalized Newton methods
- Complexity of the Newton method for set-valued maps
- A Hausdorff-type distance, a directional derivative of a set-valued map and applications in set optimization
- Global convergence of a closed-loop regularized Newton method for solving monotone inclusions in Hilbert spaces
- scientific article; zbMATH DE number 4030843 (Why is no real title available?)
- Erratum to ``Generalized Newton's method based on graphical derivatives
- scientific article; zbMATH DE number 125253 (Why is no real title available?)
- scientific article; zbMATH DE number 736943 (Why is no real title available?)
- A generalized Newton–Raphson method using curvature
- On a Semismooth* Newton Method for Solving Generalized Equations
- Globally convergent coderivative-based generalized Newton methods in nonsmooth optimization
- On the Newton method for set-valued maps
- Polyhedral Newton-min algorithms for complementarity problems
- New sufficient and necessary conditions for constrained and unconstrained Lipschitzian error bounds
- Perturbation analysis of a class of composite optimization problems
This page was built for publication: Generalized Newton's method based on graphical derivatives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q654072)
