A homotopy-based algorithm for mixed complementarity problems
From MaRDI portal
Recommendations
- A probability-one homotopy algorithm for nonsmooth equations and mixed complementarity problems
- Probability-one homotopy maps for mixed complementarity problems
- scientific article; zbMATH DE number 6129976
- A smoothing homotopy method based on Robinson's normal equation for mixed complementarity problems
- scientific article; zbMATH DE number 1487961
Cited in
(13)- Probability-one homotopy maps for mixed complementarity problems
- Feasible descent algorithms for mixed complementarity problems
- Newton's method for computing a normalized equilibrium in the generalized Nash game through fixed point formulation
- A modified standard embedding with jumps in nonlinear optimization
- A probability-one homotopy algorithm for nonsmooth equations and mixed complementarity problems
- A damped semismooth Newton iterative method for solving mixed linear complementarity problems
- A globally convergent non-interior point homotopy method for solving variational inequalities
- scientific article; zbMATH DE number 5564090 (Why is no real title available?)
- scientific article; zbMATH DE number 1487961 (Why is no real title available?)
- scientific article; zbMATH DE number 6311499 (Why is no real title available?)
- Standard embedding for linear complementarity problems
- On the calculation of a feasible point of a nonconvex set: pathfollowing with jumps
- On error bounds and Newton-type methods for generalized Nash equilibrium problems
This page was built for publication: A homotopy-based algorithm for mixed complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784426)