Complexity of the Newton method for set-valued maps

DOI10.1080/10556788.2013.779695MaRDI QIDQ2926078zbMATH OpenOpenAlexFDO

Authors Georgi V. Smirnov

Publication date 29 October 2014

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2013.779695

zbMATH Keywords

complexity analysisNewton's methodset-valued maps

Mathematics Subject Classification ID

Set-valued and variational analysis (49J53) Newton-type methods (49M15) Analysis of algorithms (68W40)

Recommendations

• On the Newton method for set-valued maps
• A Newton iteration for differentiable set-valued maps
• Newton's method and some complexity aspects of the zero-finding problem
• The theory of Newton's method
• scientific article; zbMATH DE number 6872008

Cites work

• Closed relative trajectories for formation flying with single-input control
• Convex Analysis
• Cubic regularization of Newton method and its global performance
• Generalized Newton's method based on graphical derivatives
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• Modified Gauss–Newton scheme with worst case guarantees for global performance
• Newton's method for the solution of systems of equalities and inequalities
• On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization problems
• On the Newton method for set-valued maps
• Variational Analysis

Cited in

(4)

• Set-valued approximations and Newton's methods
• Newton's method and some complexity aspects of the zero-finding problem
• Newton's method and secant method for set-valued mappings
• On the Newton method for set-valued maps

This page was built for publication: Complexity of the Newton method for set-valued maps

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