Non-linear Global Optimization using Interval Arithmetic and Constraint Propagation

Publication: Research - peer-reviewBook chapter – Annual report year: 2006

Documents

  • Imm4427

    221 KB, application/octet-stream

View graph of relations

In this Chapter a new branch-and-bound method for global optimization is presented. The method combines the classical interval global optimization method with constraint propagation techniques. The latter is used for including solutions of the necessary condition f'(x)=0. The constraint propagation is implemented as an extension of the automatic differentiation library FADBAD, which implements forward and backward differentiation. Thus the user of the integrated programme only has to implement the function expression. For illustration purposes the performance is illustrated through a couple of numerical examples.
Original languageEnglish
TitleModels and Algorithms for Global Optimization
Publication date2006
StatePublished
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

ID: 2750456