Homotopy method for a class of nonconvex Brouwer fixed-point problems
DOI10.1016/0096-3003(95)00089-5zbMATH Open0840.65038OpenAlexW2020041594MaRDI QIDQ1908258FDOQ1908258
Publication date: 30 June 1996
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0096-3003(95)00089-5
homotopy methodsSard's theoremglobal Newton homotopynonconvex Brouwer fixed point problemsnormal cone condition
Numerical computation of solutions to systems of equations (65H10) Fixed-point and coincidence theorems (topological aspects) (54H25) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Fixed points and coincidences in algebraic topology (55M20) Homotopy theory (55P99)
Cites Work
Cited In (22)
- A modified infeasible homotopy algorithm for computing fixed point in general non-convex set
- A parameter perturbation homotopy continuation method for solving fixed point problems with both inequality and equality constraints
- Solving fixed-point problems with inequality and equality constraints via a non-interior point homotopy path-following method
- Fixed point theorem: variants, affine context and some consequences
- Homotopy method for solving variational inequalities with bounded box constraints
- Existence of an interior path leading to the solution point of a class of fixed point problems
- Strong convergence on the aggregate constraint-shifting homotopy method for solving general nonconvex programming
- An infeasible homotopy method for solving fixed point problems on a general unbounded set
- Modified homotopy methods to solve fixed points of self-mapping in a broader class of nonconvex sets
- A homotopy method for solving nonconvex optimization with a weak quasi normal cone condition
- A smoothing homotopy method for solving variational inequalities
- A noninterior path following algorithm for solving a class of multiobjective programming problems
- A constraint shifting homotopy method for computing fixed points on nonconvex sets
- Generalizations of fixed point theorems and computation
- The aggregate constraint homotopy method for nonconvex nonlinear programming
- A boundary perturbation interior point homotopy method for solving fixed point problems
- Homotopy methods for solving variational inequalities in unbounded sets
- Globally convergent method for designing twice spline contractual function
- Some inequality techniques in handling fixed point problems on unbounded sets via homotopy methods
- Title not available (Why is that?)
- A continuation method for solving fixed points of self-mappings in general nonconvex sets
- Solving nonlinear complementarity problem by a smoothing homotopy method
Recommendations
- A second zero of a function. π π
- On Rhoades' Open Questions and Some Fixed Point Theorems for a Class of Mappings π π
- Smooth global solvability of first order differential equations π π
- Planar maps whose second iterate has a unique fixed point π π
- Stationary states for discrete dynamical systems in the plane π π
- A characterisation of Newton maps π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
This page was built for publication: Homotopy method for a class of nonconvex Brouwer fixed-point problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908258)