Improved convergence analysis of a smoothing Newton method for the circular cone programming

References

• Dattorro JConvex optimization and euclidean distance geometry. CA, Palo Alto: Meboo Publishing; 2005.
   Google Scholar
• Zhou JC, Chen JS. Properties of circular cone and spectral factorization associated with circular cone. J Nonlinear Convex Anal. 2013;14:807–816.
   Web of Science ®Google Scholar
• Zhou JC, Chen JS, Hung HF. Circular cone convexity and some inequalities associated with circular cones. J Inequal Appl. 2013;2013:1–17.
   Google Scholar
• Zhou JC, Tang JY, Chen JS. Parabolic second-order directional differentiability in the Hadamard sense of the vector-valued functions associated with circular cones. J Optim Theory Appl. 2017;172:802–823.
   Web of Science ®Google Scholar
• Zhou JC, Chen JS, Mordukhovich BS. Variational analysis of circular cone programs. Optimization. 2014;64:113–147.
   Web of Science ®Google Scholar
• Bai YQ, Ma PF, Zhang J. A polynomial-time interior-point method for circular cone programming based on kernel functions. J Ind Manag Optim. 2016;12:739–756.
   Web of Science ®Google Scholar
• Chi XN, Wan ZP, Zhu ZB, et al. A nonmonotone smoothing Newton method for circular cone programming. Optim. 2016;65(12):2227–2250.
   Web of Science ®Google Scholar
• Chi XN, Wei HJ, Wan ZP, et al. Smoothing Newton algorithm for the circular cone programming with a nonmonotone line search. Acta Math Scientia. 2017;37B(5):1262–1280.
   Google Scholar
• Kheirfam B, Wang GQ. An infeasible full NT-step interior point method for circular optimization. Numer Algebra Control Optim. 2017;7(2):171–184.
   Web of Science ®Google Scholar
• Ma PF, Bai YQ, Chen J-S. A self-concordant interior point algorithm for nonsymmetric circular cone programming. J Nonlinear Convex Anal. 2016;17(2):225–241.
   Web of Science ®Google Scholar
• Bai YQ, Gao XR, Wang GQ. Primal-dual interior-point algorithms for convex quadratic circular cone optimization. Numer Algebra Control Optim. 2015;5:211–231.
   Web of Science ®Google Scholar
• Chi XN, Wei HJ, Wan ZP, et al. A nonmonotone smoothing Newton algorithm for circular cone complementarity problems. J Comput Anal Appl. 2019;26:146–162.
   Google Scholar
• Ke YF, Ma CF, Zhang H. The relaxation modulus-based matrix splitting iteration methods for circular cone nonlinear complementarity problems. Comput Appl Math. 2018;37(5):6795–6820.
   Google Scholar
• Miao XH, Guo SJ, Qi N, et al. Constructions of complementarity functions and merit functions for circular cone complementarity problem. Comput Optim Appl. 2016;63:495–522.
   Web of Science ®Google Scholar
• Pirhaji M, Zangiabadi M, Mansouri H. A path following interior-point method for linear complementarity problems over circular cones. Japan J Indus Appl Math. 2018;35(3):1103–1121.
   Web of Science ®Google Scholar
• Miao XH, Yang JT, Hu SL. A generalized Newton method for absolute value equations associated with circular cones. Appl Math Comput. 2015;269:155–168.
   Web of Science ®Google Scholar
• Boyd SP, Wegbreit B. Fast computation of optimal contact forces. IEEE Tran Robot. 2007;23(6):1117–1132.
   Web of Science ®Google Scholar
• Leön B, Morales A, Sancho-Bru J. Robot grasping foundations. In: From robot to human grasping simulation. Cham, Switzerland: Springer International Publishing; 2014. p. 15–31.
   Google Scholar
• Li ZJ. Contact-force distribution optimization and control for quadruped robots using both gradient and adaptive neural networks. IEEE Tran Neural Networ. 2014;25(8):1460–1473.
   PubMed Web of Science ®Google Scholar
• Chen JS, Pan SH. A survey on SOC complementarity functions and solution methods for SOCPs and SOCCPs. Pacific J Optim. 2012;8(1):33–74.
   Web of Science ®Google Scholar
• Chi XN, Liu SY. A one-step smoothing Newton method for second-order cone programming. J Comput Appl Math. 2009;223:114–123.
   Web of Science ®Google Scholar
• Chi XN, Liu SY. A non-interior continuation method for second-order cone optimization. Optimization. 2009;58:965–979.
   Web of Science ®Google Scholar
• Fang L, He GP, Hu YH. A new smoothing Newton-type method for second-order cone programming problems. Appl Math Comput. 2009;215:1020–1029.
   Web of Science ®Google Scholar
• Fang L, Feng ZZ. A smoothing Newton-type method for second-order cone programming problems based on a new smoothing Fischer-Burmeister function. Comput Appl Math. 2011;30:569–588.
   Google Scholar
• Tang JY, He GP, Dong L, et al. A smoothing Newton method for second-order cone optimization based on a new smoothing function. Appl Math Comput. 2011;218:1317–1329.
   Web of Science ®Google Scholar
• Tang JY, He GP, Dong L, et al. A new one-step smoothing Newton method for second-order cone programming. Appl Math. 2012;57:311–331.
   Web of Science ®Google Scholar
• Tang JY, Dong L, Fang L, et al. Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search. Optim Lett. 2014;8:1753–1771.
   Web of Science ®Google Scholar
• Fukushima M, Luo Z, Tseng P. Smoothing functions for second-order-cone complementarity problems. SIAM J Optim. 2001;12:36–460.
   Web of Science ®Google Scholar
• Qi L, Sun J. A nonsmooth version of Newton's method. Math Program. 1993;58:353–367.
   Web of Science ®Google Scholar
• Liu XH, Huang ZH. A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones. Math Math Oper Res. 2009;70:385–404.
   Web of Science ®Google Scholar
• Li DH, Fukushima M. A derivative-free line search and global convergence of Broyden-like method for nonlinear equations. Optim Methods Softw. 2000;13(3):181–201.
   Web of Science ®Google Scholar
• Dennis Jr JE, Moré JJ. A characterization of superlinear convergence and its applications to quasi-Newton methods. Math Comput. 1974;28:549–560.
   Web of Science ®Google Scholar
• Facchinei F, Pang JS. Finite-dimensional variational inequalities and complementarity problems. Vol. 1st and 2nd. New York (NY): Springer; 2003.
   Google Scholar
• Sun D, Sun J. Strong semismoothness of Fischer-Burmeister SDC and SOC complementarity functions. Math Program. 2005;103:575–581.
   Web of Science ®Google Scholar
• Qi L. Convergence analysis of some algorithms for solving nonsmooth equations. Math Oper Res. 1993;18(1):227–244.
   Web of Science ®Google Scholar
• Qi L, Sun D, Zhou G. A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequality problems. Math Program. 2000;87:1–35.
   Web of Science ®Google Scholar