This repository contains a Python implementation of numerical root-finding methods for solving ( f(x) = 0 ). The methods include Bisection, Newton-Raphson, Fixed Point Iteration, False Position, ...
If you use this code in your research, please cite our paper: @article{ terashita2025variance, title={Variance Reduction of Stochastic Hypergradient Estimation by Mixed Fixed-Point Iteration}, author= ...
Proximal point algorithms involving fixed point iteration for nonexpansive mappings in CAT(κ) spaces
This is a preview. Log in through your library . Abstract In this paper, we propose a new modified proximal point algorithm involving fixed point iteration for nonexpansive mappings in CAT(1) spaces.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results