Abstract
In this paper a proximal bundle method is introduced that is capable to deal with approximate subgradients. No further knowledge of the approximation quality (like explicit knowledge or controllability of error bounds) is required for proving convergence. It is shown that every accumulation point of the sequence of iterates generated by the proposed algorithm is a well-defined approximate solution of the exact minimization problem. In the case of exact subgradients the algorithm behaves like well-established proximal bundle methods. Numerical tests emphasize the theoretical findings.
Similar content being viewed by others
References
B.M. Bell, “Global convergence of a semi-infinite optimization method,” Applied Mathematics and Optimization, vol. 21, pp. 69–88, 1990.
J. Chatelon, D. Hearn, and T.J. Lowe, “A subgradient algorithm for certain minimax and minisum problems–the constrained case,” SIAM Journal on Control and Optimization, vol. 20, pp. 455–469, 1982.
F.H. Clarke, Optimization and Nonsmooth Analysis, Wiley: New York, 1983.
J. Hiriart-Urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms I+II, Springer-Verlag: Berlin, 1993.
K.C. Kiwiel, Methods of Descent for Nondifferentiable Optimization, Lecture Notes in Mathematics, Springer-Verlag: Berlin, 1985.
K.C. Kiwiel, “An algorithm for nonsmooth convex minimization with errors,” Mathematics of Computation, vol. 45, pp. 173–180, 1985.
K.C. Kiwiel, “Proximity control in bundle methods for convex nondifferentiable minimization,” Mathematical Programming, vol. 46, pp. 105–122, 1990.
K.C. Kiwiel, “Approximations in proximal bundle methods and decomposition of convex programs,” Journal of Optimization Theory and Applications, vol. 84, pp. 529–548, 1995.
K.C. Kiwiel, “Restricted step and Levenberg-Marquardt techniques in proximal bundle methods for nonconvex nondifferentiable optimization,” SIAM Journal on Optimization, vol. 6, pp. 227–249, 1996.
C. Lemaréchal, “Nondifferentiable optimization,” Handbook of OR & MS, vol.1, pp. 529–572, 1989.
C. Lemaréchal and C. Sagastizábal, “Variable metric bundle methods: from conceptual to implementable forms,” Mathematical Programming, vol. 76, pp. 393–410, 1997.
M.M. Mákelá and P. Neittaanmáki, Nonsmooth Optimization, World Scientific Publishing: Singapore, 1992.
R. Mifflin, “A quasi-second-order proximal bundle algorithm,” Mathematical Programming, vol. 73, pp. 51–72, 1996.
R.T. Rockafellar, Convex Analysis, Princeton University Press: NJ, 1970.
H. Schramm and J. Zowe, “A version of the bundle idea for minimizing a nonsmooth function: Conceptual idea, convergence analysis, numerical results,” SIAM Journal on Optimization, vol. 2, pp. 121–152, 1992.
N.Z. Shor, Minimization Methods for Non-Differentiable Functions, Springer-Verlag: Berlin, 1985.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hintermüller, M. A Proximal Bundle Method Based on Approximate Subgradients. Computational Optimization and Applications 20, 245–266 (2001). https://doi.org/10.1023/A:1011259017643
Issue Date:
DOI: https://doi.org/10.1023/A:1011259017643