On a Direct Algorithm for Nonlinear Complementarity Problems
DOI10.1137/0316033zbMATH Open0392.90083OpenAlexW1978688456MaRDI QIDQ4174548FDOQ4174548
Authors: George J. Habetler, Michael M. Kostreva 
Publication date: 1978
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0316033
Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cited In (12)
- \(d\)-orientation sequences for continuous functions and nonlinear complementarity problems
- Variational inequality and complementarity problem
- A variable dimension solution approach for the general spatial price equilibrium problem
- Block pivot methods for solving the complementarity problem
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Uniqueness results and algorithm for Stackelberg-Cournot-Nash equilibria
- Generalization of Murty's direct algorithm to linear and convex quadratic programming
- Quasi-P\(_*\)-maps, P(\(\tau,\alpha,\beta\))-maps, exceptional family of elements, and complementarity problems
- Kneser's theorem and the multivalued generalized order complementarity problem
- Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds
- Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach
- Integral global optimization method for solution of nonlinear complementarity problems
This page was built for publication: On a Direct Algorithm for Nonlinear Complementarity Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4174548)
