An iterative method for generalized complementarity problems
- 1 December 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 25 (6), 1225-1227
- https://doi.org/10.1109/tac.1980.1102537
Abstract
Given a generalized complementarity problem (i.e., complementarity problem over a cone), Habetler and Price introduced an iterative method to solve it under the conditions that the cone is solid and the function is continuous and strongly copositive on the cone. In this paper, we provide an easier iterative method to solve this problem provided that the function is Lipschitz continuous and strongly monotone on the (maybe nonsolid) cone. A separate consideration is given to polyhedral cones.Keywords
This publication has 13 references indexed in Scilit:
- The Computation of Fixed Points and ApplicationsPublished by Springer Science and Business Media LLC ,1976
- A simplicial algorithm for the nonlinear complementarity problemMathematical Programming, 1974
- Coercivity Conditions in Nonlinear Complementarity ProblemsSiam Review, 1974
- Homotopies for computation of fixed points on unbounded regionsMathematical Programming, 1972
- The complementarity problemMathematical Programming, 1972
- Convex programming and variational inequalitiesJournal of Optimization Theory and Applications, 1972
- Existence theory for generalized nonlinear complementarity problemsJournal of Optimization Theory and Applications, 1971
- Recent Results on Complementarity ProblemsPublished by Elsevier BV ,1970
- Complementary pivot theory of mathematical programmingLinear Algebra and its Applications, 1968
- Bimatrix Equilibrium Points and Mathematical ProgrammingManagement Science, 1965