Lipschitz programming via increasing convex-along-rays functions

Optimization Methods and Software

Volumn 10, Issue 6, 1999, Pages 763-781

  Rubinov, Alexander ^a   Andramonov, Mikhail ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING;

CUTTING ANGLE METHODS; INCREASING CONVEX-ALONG-RAYS FUNCTIONS; LIPSCHITZ PROGRAMMING;

MATHEMATICAL PROGRAMMING;

EID: 0033316870     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556789908805740     Document Type: Article

References (25)

1. Abasov, T. M. and Rubinov, A. M. (1994). On the class of H-convex functions, Russian Acad. Sci. Dokl. Math., 48, 95-97.
2. Abasov, T. M. and Rubinov, A. M. (1995). Subdifferentials of some classes of non-smooth functions, in Mathematics topics in Nonsmooth Modelling, V. F. Demyanov (ed), S.-Petersburg University Press, 8-18.
3. Andramonov, M. Yu. and Glover, F. An embedded min-type problem, manuscript.
4. Andramonov, M. Yu., Rubinov, A. M. and Glover, B. M. Cutting angle methods in global optimization (accepted to Applied Mathematics Letters).
5. Aubin, J.-P. and Ekeland, I. (1984). Applied Nonlinear Analysis, Wiley & Sons.
6. Branin, F. H. and Hoo, S. K. (1972). A method for finding multiple extrema of a function of n variables, in: Lootsma, F. A. (ed.), Numerical Methods of Nonlinear Optimization, Academic Press, London, 231-237.
7. Ehnbat, R. (1996). An algorithm for maximizing a convex function over a simple set, Journal of Global Optimization, 8, 379-391.
8. Fiacco, A. V. and McCormick, G. P. (1968). Nonlinear Programming: Sequential Unconstrained Minimization Techniques, John Wiley, New York.
9. Floudas, C. A. and Pardalos, P. (1990). A Collection of Test Problems for Constrained Global Optimization Algorithms, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 455.
10. Hiriart-Urruty, J. B. and Lemarechal, C. (1993). Convex Analysis and Minimization Algorithms, Springer-Verlag, Berlin, II.
11. Horst, R. and Pardalos, P. (eds) (1996). Handbook on Global Optimization, Kluwer Academic Publishers.
12. Karmarkar, N. (1984). A new polynomial-time algorithm for linear programming, Combinatorica, 4, 375-395.
13. Kelley, J. (1960). The cutting plane method for solving convex programs, SIAM Journal, 8(4), 703-712.
14. Kutateladze, S. S. and Rubinov, A. M. (1976). Minkowski Duality and its Applications, Nauka, Novosibirsk.
15. Mladineo, R. H. (1986). An algorithm for finding the global maximum of a multimodal, multivariate function, Mathematical Programming, 34, 188-200.
16. Pallaschke, D. and Rolewicz, S. (1997). Foundations of Mathematical Optimization, Kluwer Academic Publishers.
17. Pijavski, S. A. (1972). An algorithm for finding the absolute extremum of a function, USSR Comput. Math. and Math. Phys., 2, 57-67.
18. Pintér, J. (1996). Global Optimization in Action. Continuous and Lipschitz Optimization: Algorithms, Implementations and Applications, Kluwer Academic Publishers.
19. Rastrigin, L. A. (1974). Systems of Extremal Control, Nauka, Moscow (in Russian).
20. Rubinov, A. M. and Glover, B. M. (1995). Characterizations of optimality for homogeneous programming problems with applications, Recent Advances in Nonsmooth Optimization, D.-Z. Du, L. Qi and R. S. Womersley eds., 351-380.
21. Rubinov, A. M. and Glover, B. M. (1996). Increasing convex along rays functions with applications to global optimization, (accepted to Journal of Optimization Theory and Applications).
22. Singer, I. (1997). Abstract Convex Analysis, Wiley & Sons.
23. Törn, A. and Z̃ilinskas, A. (1987). Global Optimization, Lecture Notes in Computer Science, 350, Springer Verlag.
24. Wood, G. R. (1992). The bisection method in higher dimensions, Mathematical Programming, 55, 319-337.
25. Zhang, B., Wood, G. R. and Baritompa, W. P. (1993). Multidimensional bisection: the performance and the context, Journal of Global Optimization, 3, 337-358.