A projection and contraction method for symmetric cone complementarity problem

References

• Harker PT, Pang JS. Finite-dimensional variational inequality and nonlinear complementarity problems: a survey of theory, algorithms and applications. Math Program. 1990;48:161–220. doi: 10.1007/BF01582255
   Web of Science ®Google Scholar
• Fukushima M, Luo ZQ, Tseng P. Smoothing functions for second-order cone complementarity problems. SIAM J Optimiz. 2002;12:436–460. doi: 10.1137/S1052623400380365
   Web of Science ®Google Scholar
• Chen X, Tseng P. Non-interior continuation methods for solving semidefinite complementarity problems. Math Program. 2003;95(3):431–474. doi: 10.1007/s10107-002-0306-1
   Web of Science ®Google Scholar
• Gu G, Zangiabadi M, Roos C. Full Nesterov-Todd step infeasible interior-point method for symmetric optimization. Eur J Oper Res. 2011;214:473–484. doi: 10.1016/j.ejor.2011.02.022
   Web of Science ®Google Scholar
• Tao J, Gowda MS. Some P-properties for nonlinear transformations on Euclidean Jordan algebras. Math Oper Res. 2005;30:985–1004. doi: 10.1287/moor.1050.0157
   Web of Science ®Google Scholar
• Gowda MS, Sznajder R. Some global uniqueness and solvability results for linear complementarity problems over symmetric cones. SIAM J Optim. 2007;18:461–481. doi: 10.1137/06065943X
   Web of Science ®Google Scholar
• Pan S, Chen JS. A one-parametric class of merit functions for the symmetric cone complementarity problem. J Math Anal Appl. 2009;355:195–215. doi: 10.1016/j.jmaa.2009.01.064
   Web of Science ®Google Scholar
• Kheirfam B. A weighted-path-following method for symmetric cone linear complementarity problems. Numer Algebra. 2014;4:141–150.
   Google Scholar
• Wang GQ. A new polynomial interior-point algorithm for the monotone linear complementarity problem over symmetric cones with full NT-steps. Asia Pac J Oper Res. 2012;29(02):1250015 (20pp). doi: 10.1142/S0217595912500157
   Web of Science ®Google Scholar
• Wang GQ, Lesaja G. Full Nesterov-Todd step feasible interior-point method for the Cartesian P∗(κ)-SCLCP. Optim Method Softw. 2013;28(3):600–618. doi: 10.1080/10556788.2013.781600
   Web of Science ®Google Scholar
• Faybusovich L. Linear systems in Jordan algebras and primal-dual interior-point algorithms. J Comput Appl Math. 1997;86:149–175. doi: 10.1016/S0377-0427(97)00153-2
   Web of Science ®Google Scholar
• Yoshise A. Interior point trajectories and a homogeneous model for nonlinear complementarity problems over symmetric cones. SIAM J Optim. 2006;17:1129–1153. doi: 10.1137/04061427X
   Web of Science ®Google Scholar
• Wang GQ, Bai YQ. A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones. J Optim Theory Appl. 2012;152(3):739–772. doi: 10.1007/s10957-011-9938-8
   Web of Science ®Google Scholar
• Huang Z, Hu S, Han J. Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search. Sci China Ser A. 2009;52:833–848. doi: 10.1007/s11425-008-0170-4
   Google Scholar
• Huang ZH, Ni T. Smoothing algorithms for complementarity problems over symmetric cones. Comput Optim Appl. 2010;45:557–579. doi: 10.1007/s10589-008-9180-y
   Web of Science ®Google Scholar
• Kong L, Sun J, Xiu N. A regularized smoothing newton method for symmetric cone complementarity problems. SIAM J Optim. 2008;19:1028–1047. doi: 10.1137/060676775
   Web of Science ®Google Scholar
• Chua C, Yi P. A continuation method for nonlinear complementarity problems over symmetric cone. SIAM J Optim. 2010;20:2560–2583. doi: 10.1137/090755321
   Web of Science ®Google Scholar
• Liu L, Liu S, Liu H. A predictor-corrector smoothing Newton method for symmetric cone complementarity problems. Appl Math Comput. 2010;217:2989–2999.
   Web of Science ®Google Scholar
• Sun D, Sun J. Löwner's operator and spectral functions in Euclidean Jordan algebras. Math Oper Res. 2008;33:421–445. doi: 10.1287/moor.1070.0300
   Web of Science ®Google Scholar
• Kong LC, Tunçel L, Xiu N. Clarke generalized Jacobian of the projection onto symmetric cones. Set-Valued Var Anal. 2009;17:135–151. doi: 10.1007/s11228-009-0113-4
   Web of Science ®Google Scholar
• Faraut J, Korányi A. Analysis on symmetric cones. New York (NY): Oxford University Press; 1994.
   Google Scholar
• Gowda MS, Sznajder R, Tao J. Some P-properties for linear transformations on Euclidean Jordan algebras. Linear Algebra Appl. 2004;393:203–232. doi: 10.1016/j.laa.2004.03.028
   Web of Science ®Google Scholar
• Moreau JJ. Décomposition orthogonale d'un espace hilbertien selon deux cônes mutuellement polaires. CR Acad Sci Paris. 1962;255:238–240.
   Google Scholar
• Calamai PH, Moré JJ. Projected gradient methods for linearly constrained problems. Math Program. 1987;39:93–116. doi: 10.1007/BF02592073
   Web of Science ®Google Scholar
• Han D, Lo HK. Two new self-adaptive projection methods for variational inequality problems. Comput Math Appl. 2002;43:1529–1537. doi: 10.1016/S0898-1221(02)00116-5
   Web of Science ®Google Scholar
• He B, Liao L. Improvements of some projection methods for monotone nonlinear variational inequalities. Appl J Optim Theory Appl. 2002;112:111–128. doi: 10.1023/A:1013096613105
   Web of Science ®Google Scholar
• Zhang J, Zhang K. An inexact smoothing method for the monotone complementarity problem over symmetric cones. Optim Method Softw. 2012;27(3):445–459. doi: 10.1080/10556788.2010.534164
   Web of Science ®Google Scholar
• Pan S, Chen J. A linearly convergent derivative-free descent method for the second-order cone complementarity problem. Optimization. 2010;59:1173–1197. doi: 10.1080/02331930903085359
   Web of Science ®Google Scholar