Complexity of the Newton method for set-valued maps
From MaRDI portal
Publication:2926078
DOI10.1080/10556788.2013.779695zbMath1301.49071OpenAlexW2045851895MaRDI QIDQ2926078
Publication date: 29 October 2014
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2013.779695
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- On the Newton method for set-valued maps
- Generalized Newton's method based on graphical derivatives
- Closed relative trajectories for formation flying with single-input control
- Cubic regularization of Newton method and its 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
- Variational Analysis
- Modified Gauss–Newton scheme with worst case guarantees for global performance
- Convex Analysis
This page was built for publication: Complexity of the Newton method for set-valued maps