128
Views
5
CrossRef citations to date
0
Altmetric
Original Articles

An inexact smoothing method for the monotone complementarity problem over symmetric cones

&
Pages 445-459 | Received 28 Oct 2009, Accepted 19 Oct 2010, Published online: 26 Nov 2010

References

  • Chang , Y. , Pan , S. and Chen , J. 2009 . Strong semismoothness of Fischer–Burmeister complementarity function associated with symmetric cone . manuscript in revision. Available online at http://math.ntnu.edu.tw/wjschen/publications.html
  • Chi , X. and Liu , S. 2009 . A one-step smoothing Newton method for second-order cone programming . J. Comput. Appl. Math. , 223 : 114 – 123 .
  • Facchinei , F. and Kanzow , C. 1997 . A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems . Math. Program. , 76 : 493 – 512 .
  • Faraut , J. and Korányi , A. 1994 . Analysis on Symmetric Cones , Oxford : Oxford University Press .
  • Gowda , M. S. , Sznajder , R. and Tao , J. 2004 . Some P-properties for linear transformations on Euclidean Jordan algebras . Linear Algeb. Appl. , 393 : 203 – 232 .
  • Han , D. 2007 . On the coerciveness of some merit functions for complementarity problems over symmetric cones . J. Math. Anal. Appl. , 336 : 727 – 737 .
  • Huang , Z. 2005 . Locating a maximally complementary solution of the monotone NCP by using non-interiorpoint smoothing algorithms . Math. Methods Oper. Res. , 61 : 41 – 55 .
  • Huang , Z. and Han , J. 2003 . Non-interior continuation method for solving the monotone semidefinite complementarity problem . Appl. Math. Optim. , 47 : 195 – 211 .
  • Huang , Z. and Ni , T. 2010 . Smoothing algorithms for complementarity problems over symmetric cones . Comput. Optim. Appl. , 45 : 557 – 579 .
  • Huang , Z. and Sun , J. 2005 . A non-interior continuation algorithm for the P0 or P*LCP with strong global and local convergence properties . Appl. Math. Optim. , 52 : 237 – 262 .
  • Huang , Z. , Han , J. , Xu , D. and Zhang , L. 2001 . The non-interior continuation methods for solving the P0 function nonlinear complementarity problem . Sci. China Ser.: Math. A , 44 : 1107 – 1114 .
  • Huang , Z. , Qi , L. and Sun , D. 2004 . Sub-quadratic convergence of a smoothing Newton algorithm for the P0 and monotone LCP . Math. Program. Ser. A. , 99 : 423 – 441 .
  • Huang , Z. , Hu , S. and Han , J. 2009 . Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search . Sci. China Ser. A: Math. , 52 : 617 – 630 .
  • Kong , L. , Sun , J. and Xiu , N. 2008 . A regularized smoothing newton method for symmetric cone complementatity problem . SIAM J. Optim. , 19 : 1028 – 1047 .
  • Krejić , N. and Rapajić , S. 2008 . Globally convergent Jacobian smoothing inexact Newton methods for NCP . Comput. Optim. Appl. , 41 : 243 – 261 .
  • Liu , X. and Wu , W. 2009 . Coerciveness of some merit functions over symmetric cones . J. Ind. Manage. Optim. , 5 : 603 – 613 .
  • Liu , Y. , Zhang , L. and Wang , Y. 2006 . Some properties of a class of merit functions for symmetric cone complementarity problems . Asia-Pacific J. Oper. Res. , 23 : 473 – 495 .
  • Malick , J. , Povh , J. , Rendl , F. and Wiegele , A. 2010 . Regularization methods for semidefinite programming . SIAM J. Optim. , 20 : 336 – 356 .
  • Mifflin , R. 1977 . Semismooth and semiconvex functions in constrained optimization . SIAM J. Control Optim. , 15 : 957 – 972 .
  • Pan , S. and Chen , J. 2009 . Growth behavior of two classes of merit functions for symmetric cone complementarity problems . J. Optim. Theory Appl. , 141 : 167 – 191 .
  • Pan , S. and Chen , J. 2009 . A one-parametric class of merit functions for the symmetric cone complementarity problem . J. Math. Anal. Appl. , 355 : 195 – 215 .
  • Pan , S. and Chen , J. 2010 . A linearly convergent derivative-free descent method for the second-order cone complementarity problem . Optimization , 59 : 1173 – 1197 .
  • Qi , L. 1993 . Convergence analysis of some algorithms for solving nonsmooth equations . Math. Oper. Res. , 18 : 227 – 244 .
  • Qi , L. and Sun , J. 1993 . A nonsmooth version of Newtons method . Math. Program. , 58 ( 2 ) : 353 – 367 .
  • Qi , L. , Sun , D. and Zhou , G. 2000 . A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities . Math. Program. Ser. A. , 87 : 1 – 35 .
  • Schmieta , S. H. and Alizadeh , F. 2003 . Extension of primal–dual interior point algorithms to symmetric cones . Math. Program. Ser. A , 96 : 409 – 438 .
  • Sun , J. and Huang , Z. 2006 . A smoothing Newton algorithm for the LCP with a su_cient matrix that terminates finitely at a maximally complementary solution . Optim. Methods Software , 21 : 597 – 615 .
  • Sun , D. and Sun , J. 2002 . Semismooth matrix value functions . Math. Oper. Res. , 27 : 150 – 169 .
  • Sun , D. and Sun , J. 2008 . Löwner's operator and spectral functions in Euclidean Jordan algebras . Math. Oper. Res. , 33 : 421 – 445 .
  • Sun , J. , Sun , D. and Qi , L. 2004 . A squared smoothing Newton method for nonsmooth matrix equations and its applications in semidefinite optimization problems . SIAM J. Optim. , 14 : 783 – 806 .
  • Yoshise , A. 2006 . Interior point trajectories and a homogeneous model for nonliear complementarity problems over symmetric cones . SIAM J. Optim. , 17 : 1129 – 1153 .
  • Zhang , L. and Zhang , X. 2003 . Global linear and quadratic one-step smoothing Newton method for P0-LCP . J. Global Optim. , 25 : 363 – 376 .
  • Zhang , X. , Liu , S. and Liu , Z. 2009 . Analysis of a smoothing Newton method for second-order cone complementarity problem . J. Appl. Math. Comput. , 31 : 459 – 473 .
  • Zhang , X. , Liu , S. and Liu , Z. 2009 . A smoothing method for second order cone complementarity problem . J. Comput. Appl. Math. , 228 : 83 – 91 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.