[1]

A. Auslender, “Numerical methods for nondifferentiable convex optimization,” in: B. Cornet, N.V. Hien and J.P. Vial, eds.*Nonlinear Analysis and Optimization. Mathematical Programming Study* No.*30* (1987) pp. 102–126.

[2]

R.E. Bellman, R.E. Kalaba and J. Lockett,*Numerical Inversion of the Laplace Transform* (Elsevier, New York, 1966) pp. 143–144.

[3]

E.W. Cheney and A.A. Goldstein, “Newton's method for convex programming and Tchebycheff approximation,”*Numerische Mathematik* 1 (1959) 253–268.

[4]

M. Fukushima, “A descent algorithm for nonsmooth convex programming,”*Mathematical Programming* 30 (1984) 163–175.

[5]

O. Güler, “On the convergence of the proximal point algorithm for convex minimization,”*SIAM Journal on Control and Optimization* 29 (1991) 403–419.

[6]

J.E. Kelley, “The cutting plane method for solving convex programs,”*Journal of the Society for Industrial and Applied Mathematics* 8 (1960) 703–712.

[7]

K.C. Kiwiel, “An aggregate subgradient method for nonsmooth convex minimization,”*Mathematical Programming* 27 (1983) 320–341.

[8]

K.C. Kiwiel, “A method for solving certain quadratic programming problems arising in nonsmooth optimization,”*IMA Journal of Numerical Analysis* 6 (1986) 137–152.

[9]

K.C. Kiwiel, “Proximity control in bundle methods for convex nondifferentiable minimization,”*Mathematical Programming* 46 (1990) 105–122.

[10]

B. Lemaire, “About the convergence of the proximal method,” in: D. Pallaschke, ed.,*Advances in Optimization. Lecture Notes in Economics and Mathematicsl Systems No. 382* (Springer, Berlin, 1992) pp. 39–51.

[11]

C. Lemaréchal, “An extension of Davidon methods to non differentiable problems,” in: M.L. Balinski and P. Wolfe, eds.,*Nondifferentiable Optimization. Mathematical Programming Study* No.*3* (1975) pp. 95–109.

[12]

C. Lemaréchal, “A view of line-searches,” in: A. Auslender, W. Oettli and J. Stoer, eds.,*Optimization and Optimal Control. Lecture Notes in Control and Information Science No. 30* (Springer, Berlin, 1980) pp. 59–78.

[13]

C. Lemaréchal, J.J. Strodiot and A. Bihain, “On a bundle algorithm for nonsmooth optimization,” in: O.L. Mangasarian, R.R. Meyer and S.M. Robinson, eds.,*Nonlinear Programming 4* (Academic Press, New York, 1981) pp. 245–282.

[14]

C. Lemaréchal, A.S. Nemirovskii and Yu.E. Nesterov, “New variants of bundle methods,” INRIA Report No. RR1508 (Le Chesnay, 1991).

[15]

B. Martinet, “Régularisation d'inéquations variationnelles par approximation successives,”*Revue Française d'Informatique et Recherche Opérationnelle* R3 (1970) 154–158.

[16]

R.R. Phelps,*Convex Functions, Monotone Operators and Differentiability. Lecture Notes in Mathematics No. 1364* (Springer, Berlin, 1989).

[17]

B.T. Poljak, “A general method of solving extremum problems,”*Soviet Mathematics Doklady* 8 (1967) 593–597.

[18]

R.T. Rockafellar, “Augmented Lagrangians and applications of the proximal point algorithm in convex programming,”*Mathematics of Operations Research* 1 (1976) 97–116.

[19]

H. Schram and J. Zowe, “A version of the bundle idea for minimizing a nonsmooth function: conceptual idea, convergence analysis, numerical results,”*SIAM Journal on Optimization* 2 (1992) 121–152.

[20]

P. Wolfe, “A method of conjugate subgradients for minimizing nondifferentiable functions,” in: M.L. Balinski and P. Wolfe, eds.,*Nondifferentiable Optimization. Mathematical Programming Study* No.*3* (1975) pp. 145–173.