A simplicial algorithm for the nonlinear complementarity problem
From MaRDI portal
Publication:4042852
DOI10.1007/BF01580246zbMATH Open0291.90058MaRDI QIDQ4042852FDOQ4042852
Authors: Marshall L. Fisher, F. J. Gould 
Publication date: 1974
Published in: Mathematical Programming (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)
Cites Work
- Complementary pivot theory of mathematical programming
- Nonlinear Programs with Positively Bounded Jacobians
- The complementarity problem
- The Approximation of Fixed Points of a Continuous Mapping
- Some Combinatorial Lemmas in Topology
- SIMPLICIAL APPROXIMATION OF FIXED POINTS
- Title not available (Why is that?)
- Homotopies for computation of fixed points on unbounded regions
- Title not available (Why is that?)
- A unified approach to complementarity in optimization
Cited In (10)
- Scalar labelings for homotopy paths
- An existence theorem for solutions tof(x) = 0
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Engineering applications of the Chow-Yorke algorithm
- A fixed point theorem including the last theorem of Poincaré
- Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds
- An efficient simplicial algorithm for computing a zero of a convex union of smooth functions
- A unified approach to complementarity in optimization
- A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization
- A fixed-point representation of the generalized complementarity problem
This page was built for publication: A simplicial algorithm for the nonlinear complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4042852)
