On Polyhedral Approximations of the Second-Order Cone

References

• Ben-Tal A., Nemirovskii A. Potential reduction polynomial time method for Truss topology design. SIAM J. Optim. (1994) 4:596–612Crossref, Google Scholar
• Ben-Tal A. Robust convex optimization. Math. Oper. Res. (1998) 23:769–805Link, Google Scholar
• Christensen P. W., Pang J. S., Fukushima M., Qi L. Frictional contact algorithms based on semismooth Newton methods. Reformulation—Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods (1999) (Kluwer Academic Publishers, Boston, MA) 81–116Google Scholar
• Lo G.Complementarity problems in robotics (1996) . Ph.D. dissertation, Department of Mathematical Sciences, The John Hopkins University, Baltimore, MDGoogle Scholar
• Lobo M., Vandenberghe L., Boyd S., Lebret H. Applications of second-order cone programming. Linear Algebra Appl. (1998) 284:193–228Crossref, Google Scholar
• Nesterov Yu., Nemirovski A.Interior-Point Polynomial Algorithms in Convex Programming (1994) (SIAM, Philadelphia, PA) SIAM Series in Applied MathematicsCrossref, Google Scholar
• Nesterov Yu., Todd M. J. Self-scaled barriers and interior-point met hods for convex programming. Math. Oper. Res. (1997) 22:1–42Link, Google Scholar
• Nesterov Yu. Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim. (1998) 8:324–363Crossref, Google Scholar
• Pang J. S., Stewart D. E. A unified approach to frictional contact problems. Int. J. Eng. Sc. (1999) 37:1747–1768Crossref, Google Scholar