A generalized univariate Newton method motivated by proximal regularization
From MaRDI portal
Publication:1935256
DOI10.1007/s10957-012-0095-5zbMath1257.90111WikidataQ58048432 ScholiaQ58048432MaRDI QIDQ1935256
Shoham Sabach, C. Yalçın Kaya, Regina Sandra Burachik
Publication date: 14 February 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0095-5
generalized Newton methods; Newton-Raphson method; nonlinear equations; numerical analysis; Bregman distances; antiresolvent
90C53: Methods of quasi-Newton type
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized Newton's method based on graphical derivatives
- Kantorovich's majorants principle for Newton's method
- Newton's method and its use in optimization
- A Newton-type univariate optimization algorithm for locating the nearest extremum
- Practical quasi-Newton methods for solving nonlinear systems
- On the Lambert \(w\) function
- Global convergence of Newton's method on an interval
- A nonsmooth version of Newton's method
- Set-valued mappings and enlargement of monotone operators.
- Uniform Convergence and Mesh Independence of Newton's Method for Discretized Variational Problems
- Metric Regularity of Newton's Iteration
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Fixed-Point Quasi-Newton Methods
- A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
- Solving Nonlinear Equations with Newton's Method
- Discrete Newton's method with local variations for solving large-scale nonlinear systems
- Impulsive control of rumours with two broadcasts
- Accelerated Convergence in Newton’s Method
- A Proximal-Projection Method for Finding Zeros of Set-Valued Operators
- Convex Analysis