Branch and bound with simplicial partitions and combination of lipschitz bounds for glpoabratlit oioptnism

20th International Conference EURO Mini Conference "Continuous Optimization and Knowledge-Based Technologies", EurOPT 2008

Volumn , Issue , 2008, Pages 54-58

  Paulavicius, Remigijus ^a,b   Žilinskas, Julius ^a,c  

^a VILNIUS UNIVERSITY   (Lithuania)

^b VYTAUTAS MAGNUS UNIVERSITY   (Lithuania)

^c VILNIUS GEDIMINAS TECHNICAL UNIVERSITY   (Lithuania)

Author keywords

Branch and bound; Global optimization; Lipschitz optimization

Indexed keywords

BRANCH AND BOUND METHOD; GLOBAL OPTIMIZATION; KNOWLEDGE BASED SYSTEMS; OPTIMIZATION;

BRANCH-AND-BOUND ALGORITHMS; GLOBAL OPTIMIZATION ALGORITHM; LIPSCHITZ; LIPSCHITZ BOUND;

ALGORITHMS;

EID: 71049116035     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. Hansen, P. and Jaumard, B. 1995. Lipshitz optimization, in: Horst, R. and Pardalos, P. (eds.). Handbook of Global Optimization. Kluwer Academic Publishers, 404-493.
2. Jansson, C. and Knppel, O. 1992. A Global Minimization Method: The Multi-Dimensional Case .Technical Report, TU Hamburg-Harburg.
3. Madsen, K. and Žilinskas, J. 2000. Testing Branch-and-Bound Methods for Global Optimization . Technical Report IMM-REP-2000-05, Technical University of Denmark.
4. Paulavicius, R. and Žilinskas, J. 2006. Analysis of different norms and corresponding Lipschitz constants for global optimization, Technological and Economic Development of Economy 12(4): 301-306.
5. Paulavicius, R. and Žilinskas, J. 2007. Analysis of different norms and corresponding Lipschitz constants for global optimization in multidimensional case, Information Technology and Control 36(4): 383-388.
6. Paulavicius, R. and Žilinskas, J. 2008. Improved Lipschitz bounds with first norm for function values over multidimensional simplex, Mathematical Modelling and Analysis, submitted.
7. Žilinskas, J. 2000. Optimization of Lipschitzian functions by simplex-based branch and bound, Information Technology and Control 14(1): 45-50.