Minimizing nonconvex nonsmooth functions via cutting planes and proximity control

SIAM Journal on Optimization

Volumn 14, Issue 3, 2004, Pages 743-756

  Fuduli, A ^a   Gaudioso, M ^b   Giallombardo, G ^c  

^a UNIVERSITY OF SALENTO   (Italy)

^b UNIVERSITY OF CALABRIA   (Italy)

^c UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Bundle methods; Cutting planes; Nonsmooth optimization; Proximal trajectory

Indexed keywords

EID: 4043148628     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623402411459     Document Type: Article

References (24)

1. E. W. CHENEY AND A. A. GOLDSTEIN, Newton's method for convex programming and Tcheby-cheff approximation, Numer. Math., 1 (1959), pp. 253-268.
2. F. CLARKE, Optimization and Nonsmooth Analysis, John Wiley and Sons, New York, 1983.
3. V. F. DEMYANOV AND A. RUBINOV, Quasidifferential Calculus, Optimization Software Inc., New York, 1986.
4. V. F. DEMYANOV AND A. RUBINOV, Constructive Nonsmooth Analysis, Peter Lang, Frankfurt am Main, Germany, 1995.
5. G. DI PILLO, L. GRIPPO, AND S. LUCIDI, A smooth method for the finite minimax problem, Math. Program., 60 (1993), pp. 187-214.
6. A. FUDULI AND M. GAUDIOSO, The Proximal Trajectory Algorithm for Convex Minimization, Tech. Report 7/98, Laboratorio di Logistica, Dipartimento di Elettronica Informatica e Sistemistica, Università della Calabria, Italy, 1998.
7. M. GAUDIOSO, Nonsmooth optimization, in Handbook of Applied Optimization, M. G. C. Resende and P. Pardalos, eds., Oxford University Press, New York, 2002, pp. 299-310.
8. D. GOLDFARB AND A. IDNANI, A numerically stable dual method for solving strictly convex quadratic program, Math. Program., 27 (1983), pp. 1-33.
9. J.-B. HIRIART-URRUTY AND C. LEMARÉCHAL, Convex Analysis and Minimization Algorithms. Vol. I, Springer-Verlag, Berlin, 1993.
10. J.-B. HIRIART-URRUTY AND C. LEMARÉCHAL, Convex Analysis and Minimization Algorithms. Vol. II, Springer-Verlag, Berlin, 1993.
11. J. E. KELLEY, JR., The cutting-plane method for solving convex programs, J. Soc. Indust. Appl. Math., 8 (1960), pp. 703-712.
12. K. C. KIWIEL, An aggregate subgradient method for nonsmooth convex minimization, Math. Program., 27 (1983), pp. 320-341.
13. K. C. KIWIEL, Proximity control in bundle methods for convex nondifferentiable minimization, Math. Program., 46 (1990), pp. 105-122.
14. K. C. KIWIEL, Finding normal solutions in piecewise linear programming, Appl. Math. Optim., 32 (1995), pp. 235-254.
15. K. C. KIWIEL, Restricted step and Levenberg-Marquardt techniques in proximal bundle methods for nonconvex nondifferentiable optimization, SIAM J. Optim., 6 (1996), pp. 227-249.
16. C. LEMARÉCHAL, A view of line-searches, in Optimization and Optimal Control, Lecture Notes in Control and Inform. Sci. 30, A. Auslender, W. Oettli, and J. Stoer, eds., Springer-Verlag, Berlin, New York, 1981, pp. 59-78.
17. L. LUKŠAN AND J. VLČEK, Test Problems for Nonsmooth Unconstrained and Linearly Constrained Optimization, Tech. Report 798, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague, 2000.
18. M. MÄKELÄ, Survey of bundle methods for nonsmooth optimization, Optim. Methods Softw., 17 (2002), pp. 1-29.
19. M. MÄKELÄ AND P. NEITTAANMÄKI, Nonsmooth Optimization, World Scientific, River Edge, NJ, 1992.
20. R. MIFFLIN, An algorithm for constrained optimization with semismooth functions, Math. Oper. Res., 2 (1977), pp. 191-207.
21. E. POLAK, D. MAYNE, AND J. HIGGINS, A superlinear convergent algorithm for min-max problems, in Proceedings of the 28th IEEE Conference on Decision and Control, Tampa, FL, 1989, pp. 894-898.
22. R. T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
23. 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., 2 (1992), pp. 121-152.
24. N. SHOR, Minimizations Methods for Nondifferentiable Functions, Springer-Verlag, Berlin, 1985.