Global Interval Methods for Local Nonsmooth Optimization

Journal of Global Optimization

Volumn 14, Issue 2, 1999, Pages 157-179

  Görges, Christiane ^a   Ratschek, Helmut ^a  

^a HEINRICH HEINE UNIVERSITY   (Germany)

Author keywords

Global optimization; Interval methods; Local nonsmooth optimization; Scientific computing

Indexed keywords

EID: 0343042418     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008224107486     Document Type: Article

References (54)

1. Androulakis, I.P., Maranas, C.D. and Floudas, C.A. (1995), αBB: A global optimization method for general constrained nonconvex problems, Journal of Global Optimization 7: 337-363.
2. Auslender, A., et al. (eds.) (1981), Lecture Notes in Control and Information Sciences, Vol. 30. Springer Verlag, Berlin.
3. Berner, S. (1995), Ein paralleles Verfahren zur verifizierten globalen Optimierung. Ph.D. Thesis, Wuppertal.
4. Clarke, F.H. (1983), Optimization and Nonsmooth Analysis, SIAM. New York.
5. Evtushenko, Y.G. and Potapov, M.A. (1994), Deterministic Global Optimization, in [50], pp. 481-500.
6. Goldstein, A.A. (1977), Optimization of Lipschitz continuous functions, Mathematical Programming 13: 14-22.
7. Giannessi, F. (ed.) (1992), Nonsmooth Optimization: Methods and Applications. Gordon and Breach, Philadelphia.
8. Hansen, E. (1992), Global Optimization Using Interval Analysis. Dekker, New York.
9. Hansen, P., Jaumard, B. and Lu, Ski-Hin (1991), An analytical approach to global optimization, Mathematical Programming 52: 227-254.
10. Hansen, P., Jaumard, B. and Xiong, J. (1993), Decomposition and interval arithmetic applied to the global minimization of polynomial and rational functions, Journal of Global Optimization 3: 421-437.
11. Hansen, P. and Jaumard, B. (1995), Lipschitz optimization, in [15], pp. 407-493.
12. Herzberger, H. (ed.) (1994), Topics in Validated Computations. Elsevier, Amsterdam.
13. Hiriart-Urruty, J.-B. and Lemaréchal, C. (1993), Convex Analysis and Minimization Algorithms I. Springer Verlag, Berlin.
14. Hiriart-Urruty, J.-B. and Lemaréchal, C. (1993), Convex Analysis and Minimization Algorithms II. Springer Verlag, Berlin.
15. Horst, R. and Pardalos, P.M. (eds.) (1995), Handbook of Global Optimization. Kluwer, Dordrecht.
16. Horst, R., Pardalos, P.M. and Thoai, N.V. (1995), Introduction to Global Optimization. Kluwer, Dordrecht.
17. Horst, R. and Tuy, H. (1990), Global Optimization: Deterministic Approaches. Springer Verlag, Berlin.
18. Jansson, C. (1994), On self-validating methods for optimization problems, in [12], pp. 381-438.
19. Jansson, C. and Knüppel, O. (1995), A branch and bound algorithm for bound constrained optimization problems without derivatives, Journal of Global Optimization 7: 297-331.
20. Kearfott, R.B. (1996), A review of techniques in the verified solution of constrained global optimization problems, in [22], pp. 23-59.
21. Kearfott, R.B. (1996), Interval extensions of non-smooth functions for global optimization and nonlinear systems solvers, Computing 57: 149-162.
22. Kearfott, R.B. and V. Kreinovich, (eds.) (1996), Applications of Interval Computations. Kluwer, Dordrecht.
23. Kiwiel, K.C. (1985), Methods of Descent in Nonsmooth Optimization. Springer Verlag, Berlin.
24. Kiwiel, K.C. (1992), A restricted step proximal bundle method for nonconvex nondifferentiable optimization, in [7], pp. 175-188.
25. Lemaréchal, C. (1981), A view of line-searches, in [2], pp. 59-78.
26. Lemaréchal, C. (1989), Nondifferentiable optimization, in [37], pp. 529-572.
27. Lemaréchal, C. (1992), Langrangian decomposition and nonsmooth optimization: Bundle algorithm, prox iteration, augmented langrangian, in [7], pp. 201-216.
28. Lemaréchal, C. and Zowe, J. (1994), A condensened introduction to bundle methods in nonsmooth optimization, in [50], pp. 357-382.
29. McCormick, G.P. (1983), Nonlinear Programming. Wiley, New York.
30. Mäkelä, M. and Neittaanmäki, P. (1992), Nonsmooth Optimization - Analysis and Algorithms with Applications to Optimal Control. World Scientific, Singapore.
31. Mayne, D.Q. and Polak, E. (1984), Outer approximation algorithm for nondifferentiable optimization problems, Journal of Optimization Theory and Applications 42: 19-30.
32. Mayne, D.Q., Polak, E. and Wardi, Y. (1983), On the extension of constrained optimization algorithms from differentiable to nondifferentiable problems, SIAM Journal of Control and Optimization 21: 179-203.
33. Mifflin, R. (1982), A Modification and an extension of Lemaréchal's algorithm for nonsmooth minimization, Mathematical Programming Study 17: 77-90.
34. Mifflin, R. (1992), Ideas for developing a rapidly convergent algorithm for nonsmooth minimization, in [7], pp. 228-239.
35. Moore, R.E. (1966), Interval Analysis. Prentice-Hall, Englewood Cliffs, NJ.
36. Moore, R.E. (ed.) (1988), Reliability in Computing: The Role of Interval Mathematics. Academic Press, San Diego.
37. Nemhauser, et al. (1989), Handbooks in Operation Research & Management Science, Vol. I: Optimization. Elsevier Science Publishers, Amsterdam.
38. Pintér, J.D. (1996), Global Optimization in Action. Kluwer, Dordrecht.
39. Ratschek, H. (1988), Some recent aspects of interval algorithms for global optimization, in [36], pp. 325-339.
40. Ratschek, H. and Rokne, J. (1984), Computer Methods for the Range of Functions. Horwood, Chichester.
41. Ratschek, H. and Rokne, J. (1988), New Computer Methods for Global Optimization. Horwood, Chichester.
42. Ratschek, H. and Rokne, J. (1995), Interval methods, in [15], pp. 751-828.
43. Ratschek, H. and Voller, R. (1990), Unconstrained optimization over unbounded domains, SIAM Journal of Control and Optimization 28: 528-539.
44. Ratz, D. (1992), Automatische Ergebnisverifikation bei globalen Optimierungsproblemen. Ph.D. thesis, Karlsruhe.
45. Ratz, D. and Csendes, T. (1995), On the selection of subdivision directions in interval branch-and-bound methods for global optimization, Journal of Global Optimization 7: 183-207.
46. Robinson, S.M. (1973), Computable error bounds for nonlinear programming, Mathematical Programming 5: 235-242.
47. Schittkowski, K. (ed.) (1985), Computational Mathematical Programming. Springer Verlag, Berlin.
48. Schramm, H. and Zowe, J. (1992), A version of the bundle idea for minimizing a non-smooth function: Conceptual idea, convergence analysis, numerical results. SIAM Journal of Optimization 2: 121-152.
49. Shor, N.Z. (1985), Minimization Methods for Nondifferentiable Functions. Springer Verlag, Berlin.
50. Spedicato, E. (ed.) (1994), Algorithms for Continuous Optimization: The State of Art. Kluwer, Dordrecht.
51. Stahl, V. (1995), Interval Methods for Bounding the Range of Polynomials and Solving Systems of Linear Equations. Ph.D. thesis, Linz.
52. Törn, A.A. and Zilinkas, A. (1989), Global Optimization. Springer Verlag, Berlin.
53. Wolfe, M.A. and Zhang, L.S. (1994), An interval algorithm for nondifferentiable global optimization, Applied Mathematics and Computation 63: 101-122.
54. Zowe, J. (1985), Nondifferentiable optimization, in [47], pp. 323-356.