Survey of bundle methods for nonsmooth optimization

Optimization Methods and Software

Volumn 17, Issue 1, 2002, Pages 1-29

  Mäkelä, Marko M ^a  

^a UNIVERSITY OF JYVÄSKYLÄ   (Finland)

Author keywords

Bundle methods; Nondifferentiable programming; Nonsmooth optimization

Indexed keywords

CONSTRAINT THEORY; ECONOMICS; MECHANICS; NUMERICAL ANALYSIS; OPTIMAL CONTROL SYSTEMS;

BUNDLE METHODS; NONDIFFERENTIABLE PROGRAMMING; NONSMOOTH OPTIMIZATION;

OPTIMIZATION;

EID: 0036462808     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556780290027828     Document Type: Article

References (88)

1. J. Outrata, M. Kočvara and J. Zowe (1998). Nonsmooth Approach to Optimization Problems With Equilibrium Constraints. Theory, Applications and Numerical Results. Kluwer Academic Publishers, Dordrecht.
2. J.J. Moreau, P.D. Panagiotopoulos and G. Strang (Eds.) (1988). Topics in Nonsmooth Mechanics. Birkhäuser Verlag, Basel.
3. E.S. Mistakidis and G.E. Stavroulakis (1998). Nonconvex Optimization in Mechanics. Smooth and Nonsmooth Algorithms, Heuristic and Engineering Applications by the F.E.M. Kluwer Academic Publisher, Dordrecht.
4. F.H. Clarke, Yu. S. Ledyaev, R.J. Stern and P.R. Wolenski (1998). Nonsmooth Analysis and Control Theory. Springer, New York.
5. K. Miettinen, M.M. Mäkelä and T. Männikkö (1998). Optimal control of continuous casting by nondifferentiable multiobjective optimization. Computational Optimization and Applications, 11, 177-194.
6. C. Lemaréchal (1989). Nondifferentiable Optimization. In: G.L. Nemhauser, A.H.G. Rinnooy Kan and M.J. Todd (Eds.), Optimization, pp. 529-572. North-Holland, Amsterdam.
7. J. Haslinger and P. Neittaanmäki (1996). Finite Element Approximation for Optimal Shape, Material and Topology Design. J. Wiley & Sons, Chichester.
8. M.S. Bazaraa and C.M. Shetty (1979). Nonlinear Programming, Theory and Algorithms. John Wiley & Sons, New York.
9. D.P. Bertsekas (1995). Nonlinear Programming. Athena Scientific, Belmont.
10. K.L. Teo and C.J. Goh (1988). On constrained optimization problems with nonsmooth cost functionals. Applied Mathematics and Optimization, 18, 181-190.
11. M.M. Mäkelä and P. Neittaanmäki (1992). Nonsmooth Optimization: Analysis and Algorithms with Applications to Optimal Control. World Scientific Publishing Co., Singapore.
12. N.Z. Shor (1985). Minimization Methods for Non-differentiable Functions. Springer-Verlag, Berlin.
13. S.P. Uryas'ev (1991). New variable metric algorithms for nondifferentiable optimization problems. Journal of Optimization Theory and Application, 71, 359-388.
14. R.T. Rockafellar (1970). Convex Analysis. Princeton University Press, Princeton, New Jersey.
15. C. Lemaréchal and J.-B. Hiriart-Urruty (1993). Convex Analysis and Minimization Algorithms II. Springer Verlag, Berlin.
16. E.W. Cheney and A.A. Goldstein (1959). Newton's method for convex programming and Tchebycheff approximation. Numerische Mathematik, 1, 253-268.
17. J.E. Kelley (1960). The cutting plane method for solving convex programs. SIAM J., 8, 703-712.
18. P. Wolfe (1975). A method of conjugate subgradients for minimizing nondifferentiable functions. Mathematical Programming Study, 3, 145-173.
19. Y.-X Yuan (1987). Some results in nonsmooth optimization. Journal of Computational Mathematics, 5, 74-88.
20. C. Lemaréchal (1975). An Extension of Davidon methods to non differentiable problems. Mathematical Programming Study, 3, 95-109.
21. R. Mifflin (1977). An algorithm for constrained optimization with semismooth functions. Mathematics of Operations Research, 2, 191-207.
22. E. Polak, D.Q. Mayne and Y. Wardi (1983). On the extension of constrained optimization algorithms from differentiable to nondifferentiable problems. SIAM Journal on Optimal Control and Optimization, 21, 179-203.
23. J.L. Goffin (1977). On the convergence rates of subgradient optimization methods. Mathematical Programming, 13, 329-347.
24. C. Lemaréchal (1982). Numerical experiments in nonsmooth optimization. In: E.A. Nurminski (Ed.), Progress in Nondifferentiable Optimization, pp. 61-84. IIASA-report, Laxemburg, Austria.
25. C. Lemaréchal (1976). Combining Kelley's and conjucate gradient methods. In: Abstracts of IX International Symposium on Mathematical Programming, Budapest, Hungary.
26. C. Lemaréchal, J.-J. Strodiot and A. Bihain (1981). On a bundle algorithm for nonsmooth optimization. In: O.L. Mangasarian, R.R. Mayer and S.M. Robinson, (Eds.), Nonlinear Programming, pp. 245-281. Academic Press, New York.
27. J.-J. Strodiot, V.H. Nguyen and N. Heukemes (1983). ε-Optimal solutions in nondifferentiable convex programming and some related questions. Mathematical Programming, 25, 307-328.
28. C. Lemaréchal (1978). Nonsmooth Optimization and Descent Methods. IIASA-report, Laxemburg, Austria.
29. K.C. Kiwiel (1985). Method of Descent for Nondifferentiable Optimization. Springer-Verlag, Berlin.
30. M.M. Mäkelä (1989). Methods and Algorithms for Nonsmooth Optimization, Reports on Applied Mathematics and Computing, No. 2. University of Jyväskylä, Department of Mathematics.
31. R.T. Rockafellar (1976). Monotone operators and the proximal point algorithm. SIAM Journal on Optimal Control and Optimization, 14, 877-898.
32. A. Auslender (1987). Numerical methods for nondifferentiable convex optimization. Mathematical Programming Study, 30, 102-126.
33. K.C. Kiwiel (1990). Proximity control in bundle methods for convex nondifferentiable optimization. Mathematical Programming, 46, 105-122.
34. H. Schramm and J. Zowe (1992). A version of the bundle idea for minimizing a nonsmooth functions: conceptual idea, convergence analysis, numerical results. SIAM Journal on Optimization, 2, 121-152.
35. K. Levenberg (1944). A method for the solution of certain nonlinear problems in least squares. Quart. Appl. Math., 2, 164-166.
36. D.W. Marquardt (1963). An algorithm for least-squares estimation of nonlinear parameters. SIAM Journal on Applied Mathematics, 11, 431-441.
37. C. Lemaréchal and C. Sagastizábal (1994). An approach to variable metric bundle methods. In: J. Henry and J.P. Yvon (Eds.), Lecture Notes in Control and Information Sciences, Vol. 197, pp. 144-162. Springer-Verlag, New York.
38. C. Lemaréchal and C. Sagastizábal (1997). Variable metric bundle methods: from conceptual to implementable forms. Mathematical Programming, 76, 393-410.
39. J.R. Birge, L. Qi and Z. Wei (1998). Convergence analysis of some methods for minimizing a nonsmooth convex function. Journal of Optimization Theory and Applications, 97, 357-383.
40. J.J. Moreau (1965). Proximité et dualité dans un espace hilbertien. Bulletin de la Société Mathématique de France, 93, 273-299.
41. K. Yosida (1964). Functional Analysis. Springer-Verlag, Berlin.
42. C. Lemaréchal and C. Sagastizábal (1997). Practical aspects of the Moreu-Yosida regularization: theoretical preliminaries. SIAM Journal on Optimization, 7, 367-385.
43. K.C. Kiwiel (2000). Efficiency of proximal bundle methods. Journal of Optimization Theory and Applications, 104, 589-603.
44. K.C. Kiwiel (1999). A bundle Bregman proximal method for convex nondifferentiable minimization. Mathematical Programming, 85, 241-258.
45. K.C. Kiwiel (1997). Proximal minimization methods with generalized Bregman functions. SIAM Journal on Optimal Control and Optimization 35, 1142-1168.
46. R.A. Poliquin and R.T. Rockafellar (1996). Generalized Hessian properties of regularized nonsmooth functions. SIAM Journal on Optimization, 6, 1121-1137.
47. M. Gaudiso and M. F. Monaco (1992). Variants to the cutting plane approach for convex nondifferentiable optimization. Optimization, 25, 65-75.
48. J.F. Bonnans, J.C. Gilbert, C. Lemaréchal and C. Sagastizábal (1995). A family of variable metric proximal methods. Mathematical Programming, 68, 15-47.
49. R. Mifflin (1996). A quasi-second-order proximal bundle algorithm. Mathematical Programming, 73, 51-72.
50. X. Chen and M. Fukushima (1995). Proximal quasi-Newton methods for nondifferentiable convex optimization. Mathematical Programming, 85, 313-334.
51. J.V. Burke and M. Qian (2000). On the super-linear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating. Mathematical Programming, 88, 157-181.
52. L. Lukšan and J. Vlček (1999). Globally convergent variable metric method for convex nonsmooth unconstrained minimization. Journal of Optimization Theory and Applications, 102, 593-613.
53. R. Mifflin (1982). A Modification and an extension of Lemaréchal's algorithm for nonsmooth minimization. Mathematical Programming Study, 17, 77-90.
54. M. Gaudioso and M.F. Monaco (1982). A bundle type approach to the unconstrained minimization of convex nonsmooth functions. Mathematical Programming, 23, 216-226.
55. V.N. Tarasov and N.K. Popva (1984). A modification of the cutting-plane method with accelerated convergence. In: V.F. Demyanov and D. Pallaschke (Eds.), Nondifferentiable Optimization: Motivations and Applications, pp. 284-290. Springer-Verlag, Berlin.
56. K.C. Kiwiel (1991). A tilted cutting plane proximal bundle method for convex nondifferentiable optimization. Operations Research Letters, 10, 75-81.
57. N. Megiddo (1989). Progress in Mathematical Programming: Interior Point and Related Methods. Springer-Verlag, New York.
58. C. Lemaréchal, A. Nemirovskii and Yu. Nesterov (1995). New variants of bundle methods. Mathematical Programming, 69, 111-147.
59. U. Brännlund (1994). A descent method with relaxation type step. In: J. Henry and J.P. Yvon (Eds.), Lecture Notes in Control and Information Sciences, Vol. 197. pp. 177-186. Springer-Verlag, New York.
60. K.C. Kiwiel (1995). Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities. Mathematical Programming, 69, 89-109.
61. U. Brännlund, K.C. Kiwiel and P.O. Lindberg (1995). A descent proximal level bundle method for convex nondifferentiable optimization. Operations Research Letters, 17, 121-126.
62. U. Brännlund, K.C. Kiwiel and P.O. Lindberg (1996). Preliminary computational experience with a descent level method for convex nondifferentiable optimization. In: J. Doležal and J. Fidler (Eds.), System Modelling and Optimization, pp. 387-394. Chapman and Hall, London.
63. L. Lukšan and J. Vlček (1998). A bundle-Newton method for nonsmooth unconstrained minimization. Mathematical Programming, 83, 373-391.
64. M.M. Mäkelä, M. Miettinen, L. Lukšan and J. Vlček (1999). Comparing nonsmooth nonconvex bundle methods in solving hemivariational inequalities. Journal of Global Optimization, 14, 117-135.
65. K.C. Kiwiel (1985). An algorithm for nonsmooth convex minimization with errors. Mathematics of Computation, 45, 173-180.
66. K.C. Kiwiel (1991). Approximations in decomposition of large-scale convex programs via a nondifferentiable optimization method. In: Ü. Jaaksoo and V.I. Utkin (Eds.), Proceedings of the 11th Triennal IFAC World Congress. pp. 161-166. Pergamon Press, Oxford.
67. K.C. Kiwiel (1995). Approximations in proximal bundle methods and decomposition of convex programs. Journal of Optimization Theory and Applications, 84, 529-548.
68. C.I. Fábián (2000). Bundle-type methods for inexact data. In Proceedings of the XXIV Hungarian Operations Research Conference, CEJOR Cent. Eur. J. Oper. Res., 8, 35-55.
69. F.H. Clarke (1983). Optimization and Nonsmooth Analysis. J. Wiley & Sons, New York.
70. A. Bihain (1984). Optimization of upper semidifferentiable functions. Journal of Optimization Theory and Applications, 4, 545-568.
71. M. Gaudioso and M. F. Monaco (1988). Some Techniques for Finding the Search Direction in Nonsmooth Minimization Problems. Dipartimento di Sistemi, Universita' della Calabria, Report 75.
72. J. Vlček and L. Lukšan (1999). Globally Convergent Variable Metric Method for Nonconvex Nondifferentiable Unconstrained Minimization. University of Jyväskylä, Department of Mathematical Information Technology, Report B 8.
73. K.C. Kiwiel (1996). Restricted step and Levenberg-Marquardt techniques in proximal bundle methods for nonconvex nondifferentiable optimization. SIAM Journal on Optimization, 6, 227-249.
74. R.T. Rockafellar (1981). The Theory of Subgradients and its Applications to Problems of Optimization. Convex and Nonconvex Functions. Heldermann Verlag, Berlin.
75. K.C. Kiwiel (1986). A method of linearizations for linearly constrained nonconvex nonsmooth minimization. Mathematical Programming, 34, 175-187.
76. B.N. Pshenichnyi and Yu. M. Danilin (1978). Numerical Methods for Extremal Problems. Mir, Moscow.
77. K.C. Kiwiel (1985). An exact penalty function method for nonsmooth constrained convex minimization problems. IMA Journal of Numerical Analysis, 5, 111-119.
78. K.C. Kiwiel (1987). A constraint linearization method for nondifferentiable convex minimization. Numerische Mathematik, 51, 395-414.
79. K.C. Kiwiel (1991). Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization. Mathematical Programming, 52, 285-302.
80. A. Auslender, J.T. Crouzeix and P. Fedit (1987). Penalty-proximal methods in convex programming. Journal of Optimization Theory and Applications, 55, 1-21.
81. K. Miettinen (1999). Nonlinear Multiobjective Optimization. Kluwer Academic Publishers, Boston.
82. A.P. Wierzbicki (1977). Basic properties of scalarization functionals for multiobjective optimization. Matematische Operations forschung und Statistik, Ser. Optimization, 8, 55-60.
83. K. Miettinen and M.M. Mäkelä (1995). Interactive bundle-based method for nondifferentiable multiobjective optimization: NIMBUS. Optimization, 34, 231-246.
84. K.C. Kiwiel (1985). A descent method for nonsmooth convex multiobjective minimization. Large Scale Systems, 8, 119-129.
85. S. Wang (1989). Algorithms for multiobjective and nonsmooth optimization. In: P. Kleinschmidt, F.J. Radermacher, W. Schweitzer and H. Wildermann (Eds.), Methods of Operations Research, Vol. 58, pp. 131-142. Athenäum Verlag, Frankfurt am Main.
86. H. Mukai (1980). Algorithms for multicriterion optimization. IEEE Transactions on Automatic Control, ac-25, 177-186.
87. K. Miettinen and M.M. Mäkelä (2000). Interactive multiobjective optimization system WWW-NIMBUS on the internet. Computers and Operations Research, 27, 709-723.
88. K. Miettinen and M.M. Mäkelä (1999). Comparative evaluation of some interactive reference point-based methods for multi-objective optimisation. Journal of the Operational Research Society, 50, 949-959.