Beyond convex? Global optimization is feasible only for convex objective functions: A theorem

Journal of Global Optimization

Volumn 33, Issue 4, 2005, Pages 617-624

  Kreinovich, Vladik ^a   Kearfott, R Baker ^b  

^a 500 W University Avenue   (United States)

^b UNIVERSITY OF LOUISIANA AT LAFAYETTE   (United States)

Author keywords

Computational complexity; Global optimization; Non convexity

Indexed keywords

GLOBAL MINIMIZATION; NON-CONVEXITY;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GLOBAL OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING;

FUNCTIONS;

EID: 28044458309     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-004-2120-1     Document Type: Article

References (7)

1. Jaulin, L., Kieffer, M., Didrit, O. and Walter, E. (2001), Applied Interval Analysis, with Examples in Parameter and State Estimation, Robust Control and Robotics, Springer-Verlag, London.
2. Kearfott, R.B. (1996). Rigorous Global Search: Continuous Problems, Kluwer, Boston, MA.
3. Kearfott R.B. and Kreinovich V. 1996, (eds.), Applications of Interval Computations, Kluwer, Boston. Massachusetts.
4. Kreinovich, V., Lakeyev, A., Rohn, J. and Kahl, P. (1997), Computational Complexity and Feasibility of Data Processing and Interval Computations, Kluwer, Dordrecht.
5. Papadimitriou, C.H. (1994), Computational Complexity, Addison-Wesley, Reading, Massachusetts.
6. Sahni, S. (1974), Computationally related problems, SIAM J. Comput. 3 267-279.
7. Vavasis, S.A. (1991), Nonlinear Optimization: Complexity Issues, Oxford University Press, New York.