Branch and bound with simplicial partitions and combination of Lipschitz bounds for global optimization

Paulavičius, Remigijus; Žilinskas, Julius

Use this URL to cite this publication: https://hdl.handle.net/20.500.14911/121002

Branch and bound with simplicial partitions and combination of Lipschitz bounds for global optimization

Details

Publication Type (CRIS)

Straipsnis konferencijos medžiagoje Web of Science duomenų bazėje / Article in conference proceedings in Web of Science database (P1a1)

Publication Type (eLABa)

Straipsnis konferencijos darbų leidinyje Web of Science DB / Article in conference proceedings Web of Science DB (P1a)

Author(s)

Author	Affiliation
Paulavičius, Remigijus	Matematikos ir informatikos institutas	Lietuvos edukologijos universitetas
Žilinskas, Julius	Matematikos ir informatikos institutas	Matematinio modeliavimo katedra / Department of Mathematical Modelling (1023)

Title

Branch and bound with simplicial partitions and combination of Lipschitz bounds for global optimization

[en]

Remigijus Paulavičius, Julius Žilinskas

Is part of

EURO mini conference Continuous optimization and knowledge-based technologies (EurOPT'2008): the 20th international conference. May 20-23, 2008, Neringa, Lithuania : selected papers

Published In

Year	Start Page	End Page
2008	54	58

Publisher

Vilnius : Technika, 2008

Referenced in Database(s)(DBs)

Conference Proceedings Citation Index - Science (Web of Science)

Extent

p. 54-58

URI

URI
https://hdl.handle.net/20.500.14911/121002

Cited references

Science / Art Area

Gamtos mokslai / Natural Sciences (N)

Field of Science / Art

Informatika / Informatics (N009)

Keywords (en)

Abstract (en)

The proposed branch and bound algorithm with simplicial partitions for global optimization uses combination of two types of Lipschitz bounds. One is improved Lipschitz bound with first norm. Another is combination of simple bounds with different norms. The efficiency of the proposed global optimization algorithm is evaluated experimentally. It is shown that the proposed bound improves results considerably.