A simplicial algorithm for the nonlinear complementarity problem

DOI10.1007/BF01580246zbMath0291.90058MaRDI QIDQ4042852

Marshall L. Fisher, F. J. Gould

Publication date: 1974

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)

Related Items

Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds, Engineering applications of the Chow-Yorke algorithm, A fixed point theorem including the last theorem of Poincaré, A unified approach to complementarity in optimization, A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization, An existence theorem for solutions tof(x) = 0, Scalar labelings for homotopy paths, A fixed-point representation of the generalized complementarity problem, Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications, An efficient simplicial algorithm for computing a zero of a convex union of smooth functions

Cites Work

• Unnamed Item
• Unnamed Item
• A unified approach to complementarity in optimization
• Complementary pivot theory of mathematical programming
• Some Combinatorial Lemmas in Topology
• The Approximation of Fixed Points of a Continuous Mapping
• Nonlinear Programs with Positively Bounded Jacobians
• SIMPLICIAL APPROXIMATION OF FIXED POINTS
• The complementarity problem
• Homotopies for computation of fixed points on unbounded regions