Abstract
In this paper we extend the notion of a Lorentz cone in a Euclidean space as follows: we divide the index set corresponding to the coordinates of points in two disjoint classes. By definition a point belongs to an extended Lorentz cone associated with this division, if the coordinates corresponding to one class are at least as large as the norm of the vector formed by the coordinates corresponding to the other class. We call a closed convex set isotone projection set with respect to a pointed closed convex cone if the projection onto the set is isotone (i.e., order preserving) with respect to the partial order defined by the cone. We determine the isotone projection sets with respect to an extended Lorentz cone. In particular, a Cartesian product between an Euclidean space and any closed convex set in another Euclidean space is such a set. We use this property to find solutions of general mixed complementarity problems recursively.
Similar content being viewed by others
References
Facchinei, F., Pang, J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer Series in Operations Research, vol. I. Springer, New York (2003)
Auslander, A.: Optimization Méthodes Numériques. Masson, Paris (1976)
Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods. Prentice-Hall Inc, Englewood Cliffs, New Jersey (1989)
Iusem, A.N., Svaiter, B.F.: A variant of Korpelevich’s method for variational inequalities with a new search strategy. Optimization 42(4), 309–321 (1997)
Khobotov, E.N.: A modification of the extragradient method for solving variational inequalities and some optimization problems. Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki 27(10), 1462–1473 (1987)
Korpelevich, G.M.: The extragradient method for finding saddle points and other problems. Matecon 12, 747–756 (1976)
Marcotte, P.: Application of Khobotov’s algorithm to variational inequalities and network equilibrium problems. Inf. Syst. Oper. Res. 29, 258–270 (1991)
Nagurney, A.: Network Economics: A Variational Inequality Approach. Kluwer Academic Publishers, Dordrecht (1993)
Sibony, M.: Méthodes itératives pour les équations et inéquations aux dérives partielles non linéaires de type monotone. Calcolo 7, 65–183 (1970)
Solodov, M.V., Svaiter, B.F.: A new projection method for variational inequality problems. SIAM J. Control. Optim. 37(3), 765–776 (1999)
Solodov, M.V., Tseng, P.: Modified projection-type methods for monotone variational inequalities. SIAM J. Control. Optim. 34(5), 1814–1830 (1996)
Sun, D.: A class of iterative methods for nonlinear projection equations. J. Optim. Theory Appl. 91(1), 123–140 (1996)
Kachurovskii, R.: On monotone operators and convex functionals. Uspe\(\kappa \)hi Mat. Nauk 15(4), 213–215 (1960)
Minty, G.: Monotone operators in Hilbert spaces. Duke Math. J. 29, 341–346 (1962)
Minty, G.: On a monotonicity method for the solution of non-linear equations in Banach spaces. Proc. Natl. Acad. Sci. USA 50, 1038–1041 (1963)
Browder, F.E.: Continuity properties of monotone non-linear operators in Banach spaces. Bull. Am. Math. Soc. 70, 551–553 (1964)
Isac, G., Németh, A.B.: Isotone projection cones in Hilbert spaces and the complementarity problem. Boll. Un. Mat. Ital. B 7(4), 773–802 (1990)
Isac, G., Németh, A.B.: Projection methods, isotone projection cones, and the complementarity problem. J. Math. Anal. Appl. 153(1), 258–275 (1990)
Németh, S.Z.: Iterative methods for nonlinear complementarity problems on isotone projection cones. J. Math. Anal. Appl. 350(1), 340–347 (2009)
Guyader, A., Jégou, N., Németh, A.B., Németh, S.Z.: A geometrical approach to iterative isotone regression. Appl. Math. Comput. 227, 359–369 (2014)
Dattorro, J.: Convex Optimization and Euclidean Distance Geometry. COandEDG version 30 March 2013
Nishimura, H., Ok, E.A.: Solvability of variational inequalities on Hilbert lattices. Math. Oper. Res. 37(4), 608–625 (2012)
Carl, S., Heikkilä, S.: Fixed Point Theory in Ordered Sets and Applications. From differential and integral equations to game theory. Springer, New York (2011)
Zarantonello, E.: Projections on convex sets in Hilbert space and spectral theory, I: Projections on convex sets, II: Spectral theory. Contrib. Nonlin. Funct. Anal. Proc. Symp. Univ. Wisconsin Madison
McArthur, C.W.: In what spaces is every closed normal cone regular? Proc. Edinb. Math. Soc. 17(2), 121–125 (1970/1971)
Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)
Németh, A.B., Németh, S.Z.: Lattice-like operations and isotone projection sets. Linear Algebra Appl. 439(10), 2815–2828 (2013)
Németh, A. B., Németh, S. Z.: Selfdual cones, generalized lattice operations and isotone projections. arXiv:1210.2324 (2012)
Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)
Acknowledgments
The authors are grateful for the referee’s comments which contributed to the quality of this paper.
Author information
Authors and Affiliations
Corresponding author
Appendix: How large is the family of \(K\)-isotone mappings?
Appendix: How large is the family of \(K\)-isotone mappings?
The remaining sections can be read without this one, which is entirely for the purpose of convincing the reader that the family of \(K\)-isotone mappings which occur in the condition “\(I-F\) is \(K\)-isotone” of Proposition 2 and the corresponding condition in Theorem 3 is very wide.
Let \(K,S\subset {\mathbb {R}}^m\) be pointed closed convex cones such that \(K\subset S\). The function \(f:{\mathbb {R}}^m\rightarrow {\mathbb {R}}\) is called \(K\)-monotone if \(x\le _K y\) implies \(f(x)\le f(y)\). Both the \(K\)-monotone functions and the \(K\)-isotone mappings form a cone. If \(f_1,\dots ,f_\ell :{\mathbb {R}}^m\rightarrow {\mathbb {R}}\) are \(K\)-monotone and \(w^1,\dots ,w^\ell \in K\), then it is easy to see that the mapping \(F:{\mathbb {R}}^m\rightarrow {\mathbb {R}}^m\) defined by
is \(K\)-isotone. It is obvious that any \(S\)-monotone function is also \(K\)-monotone. Hence, if \(f_1,\dots ,f_\ell :{\mathbb {R}}^m\rightarrow {\mathbb {R}}\) are \(S\)-monotone, then the mapping \(F\) defined by (26) is \(K\)-isotone. The pointed closed convex cone \(S\) is called simplicial if there exists linearly independent vectors \(u^1,\dots ,u^m\in {\mathbb {R}}^m\) such that
The vectors \(u^1,\dots ,u^m\) are called the generators of \(S\) and we say that \(S\) is generated by \(u^1,\dots ,u^m\). It can be shown that the dual \(S^*\) of a simplicial cone \(S\) is simplicial. Moreover, if \(U:=(u^1,\dots ,u^m)\) (that is an \(m\times m\) matrix with columns \(u^1,\dots ,u^m\)) and \((U^\top )^{-1}=(v^1,\dots ,v^m)\), then \(S^*={{\mathrm{cone}}}\{v^1,\dots ,v^m\}\) [29]. Let \(\{e^1,e^2,\dots ,e^m\}\) be the set of standard unit vectors in \({\mathbb {R}}^m\). The cone \({\mathbb {R}}^m_+=\{\lambda _1e^1+\dots +\lambda _me^m:\lambda _1,\dots ,\lambda _m\ge 0\}\) is called the nonnegative orthant. Let \(S\) be the simplicial cone defined by (27). If \(f:{\mathbb {R}}^m\rightarrow {\mathbb {R}}\) is \({\mathbb {R}}^m_+\)-monotone, then \(\hat{f}:{\mathbb {R}}^m\rightarrow {\mathbb {R}}\) defined by \(\hat{f}(x_1u^1+\dots +x_mu^m)=f(x_1e^1+\dots +x_me^m)\) is \(S\)-monotone. If \(g_1,\dots ,g_m:{\mathbb {R}}\rightarrow {\mathbb {R}}\) are monotone increasing, then obviously \(g:{\mathbb {R}}^m\rightarrow {\mathbb {R}}\) defined by
is \(S\)-monotone. Moreover, if \(f:{\mathbb {R}}^m\rightarrow {\mathbb {R}}\) is \(S\)-monotone and \(\psi :{\mathbb {R}}\rightarrow {\mathbb {R}}\) is monotone increasing, then it is straightforward to see that \(\psi \circ f\) is also \(S\)-monotone. Hence, if all mappings \(f_i\) in (26) are formed by using a combination of (28), the previous property and the conicity of the \(S\)-monotone functions, then the mapping \(F\) defined by (26) is \(K\)-isotone for any pointed closed convex cone \(K\) contained in \(S\). For any such cone \(K\) it is easy to construct a simplicial cone \(S\) which contains \(K\). From the definition of the dual of a cone it follows that \({\mathbb {R}}^m=\{0\}^*=(K\cap (-K))^*=K^*+(-K)^*=K^*-K^*\). Thus, the smallest linear subspace of \({\mathbb {R}}^m\) containing \(K^*\) is \({\mathbb {R}}^m\) and hence the interior of \(K^*\) is nonempty (see [26]). Therefore, there exist \(m\) linearly independent vectors in \(K^*\), that is, \(K^*\) contains a simplicial cone \(T\). Let \(S\) be the dual of \(T\). Then, obviously \(K\subset S\).
The above constructions show that for any pointed closed convex cone the family of \(K\)-isotone mappings, used in Proposition 2 and Theorem 3 is very wide. Moreover, there may be many \(K\)-isotone mappings which are not of the above type. This topic is worth to be investigated in the future.
Rights and permissions
About this article
Cite this article
Németh, S.Z., Zhang, G. Extended Lorentz cones and mixed complementarity problems. J Glob Optim 62, 443–457 (2015). https://doi.org/10.1007/s10898-014-0259-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-014-0259-y
Keywords
- Isotone projections
- Closed convex cones
- Complementarity problems
- Mixed complementarity problems
- Picard iteration
- Fixed point