A modified infeasible homotopy algorithm for computing fixed point in general non-convex set
From MaRDI portal
Publication:5743307
DOI10.22436/jnsa.010.11.27zbMath1412.47201OpenAlexW2768942418MaRDI QIDQ5743307
Yanchun Xing, Zhichuan Zhu, Rui-Feng Wu
Publication date: 9 May 2019
Published in: The Journal of Nonlinear Sciences and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.22436/jnsa.010.11.27
Cites Work
- Unnamed Item
- Unnamed Item
- Convergence results of multi-valued nonexpansive mappings in Banach spaces
- Split common fixed point problem for two quasi-pseudo-contractive operators and its algorithm construction
- Construction algorithms for a class of monotone variational inequalities
- Regularization proximal point algorithm for finding a common fixed point of a finite family of nonexpansive mappings in Banach spaces
- A boundary perturbation interior point homotopy method for solving fixed point problems
- Viscosity approximation method for accretive operator in Banach space
- Homotopy method for a class of nonconvex Brouwer fixed-point problems
- A unified implicit algorithm for solving the triple-hierarchical constrained optimization problem
- Existence of an interior path leading to the solution point of a class of fixed point problems
- An infeasible homotopy method for solving fixed point problems on a general unbounded set
- Globally convergent homotopy method for designing piecewise linear deterministic contractual function
- Convergence theorem for equilibrium problems and fixed point problems of infinite family of nonexpansive mappings
- Strong convergence and certain control conditions for modified Mann iteration
- Modified homotopy methods to solve fixed points of self-mapping in a broader class of nonconvex sets
- Hybrid viscosity methods for equilibrium problems, variational inequalities, and fixed point problems
- A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
- Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
- Introduction to Numerical Continuation Methods
- Globally convergent homotopy algorithm for solving the KKT systems to the principal-agent bilevel programming
This page was built for publication: A modified infeasible homotopy algorithm for computing fixed point in general non-convex set