Abstract
The complementarity problem with a nonlinear continuous mappingf from the nonnegative orthantR n+ ofR n intoR n can be written as the system of equationsF(x, y) = 0 and(x, y) ∈ R 2n+ , whereF denotes the mapping from the nonnegative orthantR 2n+ ofR 2n intoR n+ × Rn defined byF(x, y) = (x 1y1,⋯,xnyn, f1(x) − y1,⋯, fn(x) − yn) for every(x, y) ∈ R 2n+ . Under the assumption thatf is a uniformP-function, this paper establishes that the mappingF is a homeomorphism ofR 2n+ ontoR n+ × Rn. This result provides a theoretical basis for a new continuation method of tracing the solution curve of the one parameter family of systems of equationsF(x, y) = tF(x 0, y0) and(x, y) ∈ R 2n+ from an arbitrary initial point(x 0, y0) ∈ R 2n+ witht = 1 until the parametert attains 0. This approach is an extension of the one used in the polynomially bounded algorithm recently given by Kojima, Mizuno and Yoshise for solving linear complementarity problems with positive semi-definite matrices.
Similar content being viewed by others
References
E. Allgower and K. Georg, “Simplicial and continuation methods for approximating fixed points and solution to systems of equations,”SIAM Review 22 (1980) 28–85.
R.W. Cottle, “Nonlinear programs with positively bounded Jacobians,”SIAM Journal on Applied Mathematics 14 (1966) 147–158.
G.B. Dantzig and R.W. Cottle, “Positive (semi-definite) matrices and mathematical programming,” Report ORC 63-18, (RR) 13, University of Berkeley (California, 1963).
B.C. Eaves, “The linear complementarity problem,”Management Science 17 (1971) 612–634.
S. Eilenberg and N. Steenrod,Foundation of Algebraic Topology (Princeton University Press, Princeton, New Jersey, 1952).
A.V. Fiacco and G.P. McCormick,Nonlinear Programming: Sequential Unconstrained Minimization Techniques (John Wiley, New York, 1968).
M. Kojima, “A Unification of the existence theorems of the nonlinear complementarity problem,”Mathematical Programming 9 (1975) 257–277.
M. Kojima, S. Mizuno and A. Yoshise, “A primal-dual interior point algorithm for linear programming,” to appear in: N. Megiddo, ed.,Research Issues in Linear Programming: Proceedings of the Asilomar Conference (Springer-Verlag, Berlin).
M. Kojima, S. Mizuno and A. Yoshise, “A polynomial-time algorithm for a class of linear complementarity problems,” to appear inMathematical Programming.
C.E. Lemke, “Bimatrix equilibrium points and mathematical programming,”Management Science 11 (1965) 681–689.
L. McLinden, “The complementarity problem for maximal monotone multifunctions,” Chapter 17 in: R.W. Cottle, F. Giannessi and J.L. Lions, eds.,Variational Inequalities and complementarity problems (John Wiley & Sons, New York, 1980) pp. 251–270.
L. McLinden, “An analog of Moreau's proximation theorem (with application to the nonlinear complementarity problem,”Pacific Journal of Mathematics 88 (1980) 101–161.
N. Megiddo, “Pathways to the optimal set in linear programming,”Proceedings of the 6th Mathematical Programming Symposium of Japan (Nagoya, Japan, 1986) 1–35.
J.J. Moré, “Coercivity conditions in nonlinear complementarity problems,”SIAM Review 16 (1974) 1–15.
J.J. Moré, “Class of functions and feasibility conditions in nonlinear complementarity problem,”Mathematical Programming 6 (1974) 327–338.
J.M. Ortega and W.C. Rheinboldt,Iterative Solutions of Nonlinear Equations of Several Variables (Academic Press, New York, 1970).
K. Tanabe, “Complementarity-enforcing centered Newton method for linear programming: Global method,” inNew Method for Linear Programming, The Institute of Statistical Mathematics Cooperative Research Reprt 5, The Institute of Statistical Mathematics (Tokyo, 1987).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kojima, M., Mizuno, S. & Noma, T. A new continuation method for complementarity problems with uniformP-functions. Mathematical Programming 43, 107–113 (1989). https://doi.org/10.1007/BF01582283
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01582283