[1]

V. Acary, F. Cadoux, C. Lemaréchal, and J. Malick. A formulation of the linear discrete coulomb friction problem via convex optimization. ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 91(2):155–175, 2011.

[2]

G. Daviet, F. Bertails-Descoubes, and L. Boissieux. A hybrid iterative solver for robustly capturing Coulomb friction in hair dynamics. ACM Transactions on Graphics (Proc. ACM SIGGRAPH Asia'11), 30:139:1–139:12, 2011.

[3]

G. De Saxcé and Z.-Q. Feng. The bipotential method: a constructive approach to design the complete contact law with friction and improved numerical algorithms. Math. Comput. Modelling, 28(4-8):225–245, 1998.

[4]

M. Fukushima, Z.-Q. Luo, and P. Tseng. Smoothing functions for second-order-cone complementarity problems. SIAM J. on Optimization, 12:436–460, February 2002.

[5]

Toby D Heyn. On the modeling, simulation, and visualization of many-body dynamics problems with friction and contact. PhD thesis, THE UNIVERSITY OF WISCONSIN-MADISON, 2013.

[6]

F. Jourdan, P. Alart, and M. Jean. A Gauss-Seidel like algorithm to solve frictional contact problems. Computer Methods in Applied Mechanics and Engineering, 155:31–47, 1998.

[7]

Yurii Nesterov. A method of solving a convex programming problem with convergence rate o (1/k2). Soviet Mathematics Doklady, 27(2):372–376, 1983.

[8]

Alessandro Tasora. Efficient simulation of contacts, friction and constraints using a modified spectral projected gradient method. 2013.