Abstract
This paper describes an implementation of the so-calledproximal point algorithm for solving convex linearly constrained nonsmooth optimization problems. Contrary to other previous implementations of the same approach (which solve constrained nonsmooth problems as unconstrained problems via exact penalty function techniques), our implementation handles linear constraints explicitly (linear constraints being incorporated into the direction-finding subproblem). The relevance and efficiency of the approach is demonstrated through comparative computational experiments on many classical test problems from the literature, as well as on a series of large constrained dual transportation problems introduced and studied here for the first time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Auslender, A descent method for nondifferentiable convex programs, C. R. Acad. Sci. Paris 298, Série 1 (1984) 529–532.
A. Auslender, Numerical methods for nondifferentiable convex optimization, Math. Prog. Study 30 (1987) 102–126.
J.C. Dodu, T. Eve and M. Minoux, An implementation of the proximal algorithm for convex constrained nonsmooth optimization problems, MASI Research Report #92.94 (1992).
M. Fukushima, A descent algorithm for nonsmooth convex programming, Math. Prog. 30 (1984) 163–175.
J.E. Kelley, The cutting-plane method for solving convex programs, J. SIAM 8 (1960) 703–712.
K.C. Kiwiel, An aggregate subgradient method for nonsmooth convex minimization, Math. Prog. 27 (1983) 320–341.
K.C. Kiwiel, Proximity control in bundle methods for convex nondifferentiable optimization, Math. Prog. 46 (1990) 105–122.
K.C. Kiwiel, Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization, Math. Prog. 52 (1991) 285–302.
C. Lemaréchal, An extension of Davidon methods to nondifferentiable problems, Math. Prog. Study 3 (1975) 95–109.
C. Lemaréchal, Bundle methods in nonsmooth optimization, in:Nonsmooth Optimization, eds. C. Lemaréchal and R. Mifflin (Pergamon, 1978) pp. 79–102.
C. Lemaréchal and R. Mifflin, A set of nonsmooth optimization test problems, in:Nonsmooth Optimization, eds. C. Lemaréchal and R. Mifflin (Pergamon, 1978) pp. 151–165.
C. Lemaréchal and M. Bancora-Imbert, Le module M1FC1, Technical Report INRIA (1985).
C. Lemaréchal, A. Nemirovsky and Y. Nesterov, New variants of bundle methods, Report INRIA no. RR 1508 (1992).
B. Martinet, Régularisation d'inéquations variationnelles par approximations successives, RAIRO 4 (1970) 154–159.
R. Mifflin, A modification and an extension of Lemaréchal's algorithm for nonsmooth optimization, Math. Prog. Study 17 (1982) 77–90.
J.J. Moreau, Proximité et dualité dans un espace Hilbertien, Bull. Soc. Math. France 93 (1965) 273–299.
R.T. Rockafellar, Monotone operators and the proximal point algorithm, SIAM J. Contr. Optim. 14 (1976) 877–898.
R.T. Rockafellar, Augmented lagrangians and applications of the proximal point algorithm in convex programming, Math. Oper. Res. (1976) 97–116.
H. Schramm and J. Zowe, A version of the bundle idea for minimizing a nonsmooth function: conceptual idea, convergence analysis, numerical results, SIAM J. Optim. (1992) 121–152.
P. Wolfe, A method of conjugate subgradients for minimizing nondifferentiable functions, Math. Prog. Study 3 (1975) 145–173.
W.I. Zangwill,Nonlinear Programming: a Unified Approach (Prentice-Hall, 1969).
Author information
Authors and Affiliations
Additional information
Communicated by C. Brezinski
Rights and permissions
About this article
Cite this article
Dodu, J.C., Eve, T. & Minoux, M. Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results. Numer Algor 6, 245–273 (1994). https://doi.org/10.1007/BF02142674
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02142674