Abstract
In this paper, we study in Section 1 the proximal method, within a nonexact form for nonsmooth programming. In Section 2 we give a new algorithm, related with the cutting plane method for minimizing on ℝN a convex function that is a sum of a Legendre convex differentiable function and a nondifferentiable convex function. This algorithm is then used in Sections III and IV to solve nonsmooth convex optimization problems in the unconstrained and the constrained cases.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A. Brøndsted and R.T. Rockafellar, “On the subdifferentiability of convex functions”, Proceedings of the American Mathematical Society 16 (1965) 605–611.
J. Céa, R. Glowinski and J.C. Nedelec, “Minimisation de fonctions non différentiables”, in: J.L. Morris, ed., Conference on applications of numerical analysis, Lecture Notes in Mathematics, Vol. 228 (Springer-Verlag, Berlin, 1971) pp. 19–38.
M. Fukushima, “A descent algorithm for nonsmooth convex programming”, Mathematical Programming 30 (1984) 163–175.
M. Fukushima, “On the convergence of a class of outer approximation algorithms for convex programs”, to appear.
M. Fukushima, “An outer approximation algorithm for colving general convex programs”, Operations Research 31 (1983) 101–113.
M. Gaudioso and M.F. Monaco, “A bundle type approach to the unconstrained minimization of convex nonsmooth functions”, Mathematical Programming 23 (1982) 216–226.
M.R. Hestenes, “Multiplier and gradient methods”, Journal of Optimization Theory and Applications 4 (1969) 303–320.
J.B. Hiriart-Urruty, “∈-subdifferential calculus”, in: J.-P. Aubin and R.B. Vintner, eds., Convex analysis and optimization, Research Notes in Mathematics, Series 57 (Pitman, Boston, 1982) pp. 43–92.
P. Huard, “Programmation mathématique convexe”, RAIRO 2 (1968) 43–59.
K.C. Kiwiel, “An aggregate subgradient method for nonsmooth convex minimization”, Mathematical Programming 27 (1983) 320–341.
C. Lemarechal, “Bundle methods in nonsmooth optimization”, in: C. Lemarechal and R. Mifflin, eds., Nonsmooth optimization (Pergamon Press. Oxford, 1978).
C. Lemarechal, “An extension of Davidon methods to nondifferentiable problems”, Mathematical Programming Study 3 (1975) 95–109.
B. Martinet, “Regularization d’inéquations variationnelles parapproximations successives”, RAIRO 4 (1970) 154–159.
R. Mifflin, “A superlinearly convergent algorithm for one-dimensional constrained minimization problems with convex functions”, Mathematics of Operations Research 8 (1983) 185–195.
J.M. Ortega and W.C. Rheinboldt, Iterative solution of nonlinear equations in several variables (Academic Press, New York, 1970).
J.E. Spingarn, “Partial inverse of a monotone operator”, Applied Mathematics and Optimization 10 (1983) 247–265.
J.J. Strodiot, V.H. Nguyen and N. Heukemes, “∈-optimal solutions in nondifferentiable convex programming and some related questions”, Mathematical Programming 25 (1983) 307–328.
R.T. Rockafellar, Convex analysis (Princeton University Press, Princeton, NJ, 1970).
R.T. Rockafellar, “Augmented Lagrangians and applications of the proximal point algorithm in convex programming”, Mathematics of Operations Research 1 (1976) 97–116.
R.T. Rockafellar, “Monotone operators and the proximal point algorithm”, SIAM Journal on Control and Optimization 14 (1976) 877–898.
A. Tikhonov and V. Arsenin, Solutions of ill-posed problems (Halsted Press, New York, 1977).
P. Wolfe, “A method of conjugate subgradients for minimizing nondifferentiable functions”, Mathematical Programming Study 3 (1975) 145–173.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 The Mathematical Programming Society, Inc.
About this chapter
Cite this chapter
Auslender, A. (1987). Numerical methods for nondifferentiable convex optimization. In: Cornet, B., Nguyen, V.H., Vial, J.P. (eds) Nonlinear Analysis and Optimization. Mathematical Programming Studies, vol 30. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0121157
Download citation
DOI: https://doi.org/10.1007/BFb0121157
Received:
Revised:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00930-3
Online ISBN: 978-3-642-00931-0
eBook Packages: Springer Book Archive