• Alizadeh F, Goldfarb D (2003) Second-order cone programming. Math Program 95: 3–51

  Article MATH MathSciNet  Google Scholar 

• Boggs PT, Tolle JW (1995) Sequential quadratic programming. Acta Numer 4: 1–51

  Article MathSciNet  Google Scholar 

• Bonnans JF, Gilbert JC, Lemaréchal C, Sagastizábal CA (2003) Numerical optimization. Springer, New York

  MATH  Google Scholar 

• Bonnans JF, Ramírez CH (2005) Perturbation analysis of second-order-cone programming problems. Math Program 104: 205–227

  Article MATH MathSciNet  Google Scholar 

• Bonnans JF, Shapiro A (2000) Perturbation analysis of optimization problems. Springer, New York

  MATH  Google Scholar 

• Chan ZX, Sun D (2008) Constraint nondegeneracy, strong regularity and nonsingularity in semidefinite programming. SIAM J Optim 19: 370–396

  Article MathSciNet  Google Scholar 

• Chen XD, Sun D, Sun J (2003) Complementarity functions and numerical experiments for second-order cone complementarity problems. Comput Optim Appl 25: 39–56

  Article MATH MathSciNet  Google Scholar 

• Clarke FH (1976) On the inverse function theorem. Pac J Math 64: 97–102

  MATH  Google Scholar 

• Clarke FH (1983) Optimization and nonsmooth analysis. Wiley, New York

  MATH  Google Scholar 

• Kato H, Fukushima M (2007) An SQP-type algorithm for nonlinear second-order cone programs. Optim Lett 1: 129–144

  Article MATH MathSciNet  Google Scholar 

• Kummer B (1991) Lipschitzian inverse functions, directional derivatives, and applications inC^1,1-optimization. J Optim Theory Appl 70: 559–580

  Article MathSciNet  Google Scholar 

• Liu Y, Zhang L (2007a) On the convergence of the augmented Lagrangian method for nonlinear optimization problems over second-order cones. J Optim Theory Appl (to appear)

• Liu Y, Zhang L (2007b) Convergence analysis of the augmented Lagrangian method for nonlinear second-order cone optimization problems. Nonlinear Anal 67: 1359–1373

  Article MATH MathSciNet  Google Scholar 

• Meng F, Sun D, Zhao G (2005) Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization. Math Program 104: 561–581

  Article MATH MathSciNet  Google Scholar 

• Mifflin R (1977) Semismooth and semiconvex functions in constrained optimization. SIAM J Control Optim 15: 957–972

  Article MathSciNet  Google Scholar 

• Pang JS, Sun D, Sun J (2003) Semismooth homeomorphisms and strong stability of semidefinite and Lorentz cone complementarity problems. Math Oper Res 28: 39–63

  Article MATH MathSciNet  Google Scholar 

• Qi L, Sun J (1993) A nonsmooth version of Newton’s method. Math Program 58: 353–367

  Article MathSciNet  Google Scholar 

• Robinson SM (1976) First order conditions for general nonlinear optimization. SIAM J Appl Math 30: 597–607

  Article MATH MathSciNet  Google Scholar 

• Robinson SM (1983) Generalized equations. In: Bachem A et al (eds) Mathematical Programming: The State of the Art. Springer, Berlin, pp 346–367

  Google Scholar 

• Rockafellar RT (1970) Convex analysis. Princeton University Press, Princeton

  MATH  Google Scholar 

• Sun D (2001) A further result on an implicit function theorem for locally Lipschitz functions. Oper Res Lett 28: 193–198

  Article MATH MathSciNet  Google Scholar 

• Sun D (2006) The strong second order sufficient condition and constraint nondegeneracy in nonlinear semidefinite programming and their implications. Math Oper Res 31: 761–776

  Article MATH MathSciNet  Google Scholar 

• Zarantonello EH (1971) Projections on convex sets in Hilbert space and spectral theory I and II. In: Zarantonello EH (eds.) Contributions to Nonlinear Functional Analysis. Academic Press, New York, pp 237–424

  Google Scholar 

Download references