1.

Record Nr.

UNINA9910463265003321

Autore

Gilbert-Roberts Terri-Ann P.

Titolo

The politics of integration : Caribbean sovereignty revisited / / Terri-Ann Gilbert-Roberts

Pubbl/distr/stampa

Kingston ; ; Miami : , : Ian Randle Publishers, , [2013]

©2013

ISBN

976-637-654-9

Descrizione fisica

1 online resource (xvii, 320 pages)

Disciplina

337.1729

Soggetti

Regionalism - Caribbean Area

Sovereignty

Electronic books.

Caribbean Area Politics and government 1945-

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Bibliographic Level Mode of Issuance: Monograph

Nota di bibliografia

Includes bibliographical references (pages 287-311) and index.



2.

Record Nr.

UNINA9910816159303321

Autore

Edman Christine

Titolo

Black box optimization with exact subsolvers : a radial basis function algorithm for problems with convex constraints / / vorgelegt von Christine Edman

Pubbl/distr/stampa

Trier : , : Logos Verlag Berlin GmbH, , [2016]

©2016

ISBN

3-8325-9146-X

Descrizione fisica

1 online resource (iv, 114 pages) : illustrations

Disciplina

511.42

Soggetti

Radial basis functions

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

"Dissertation zur Erlangung des akademischen Grades eines Doktors der Naturwissenschaften (Dr. rer. nat.) ... Dem Fachberich IV der Universität Trier, Trier, 2016."

Nota di bibliografia

Includes bibliographical references (111-114).

Sommario/riassunto

Long description: We consider expensive optimization problems, that is to say problems where each evaluation of the objective function is expensive in terms of computing time, consumption of resources, or cost. This often happens in situations where the objective function is not available in analytic form, e.g. crash tests, best composition of chemicals, or soil contamination. Due to this lack of analytical representation we also speak about `black box functions'. In order to use as few function evaluations as possible within the optimization process, a sophisticated strategy to determine the evaluation points is necessary. In this thesis we present an algorithm which belongs to the class of the wellknown Radial basis function (RBF)-methods. RBF-methods usually incorporate subproblems which are difficult to solve exact. In order to solve these problems exact, we developed a Branch & Bound routine. This routine computes lower bounds by using the property of `conditional positive definiteness' of the RBF. We present a formula for the inverse of a blockmatrix with solely singular diagonal blocks. We also present a partitioning rule for multidimensional rectangles, which gives much freedom in the choice of the bisection point subject to preserve the important property of `exhaustiveness'.



We tested our algorithm and present results for both expensive problems with only box constraints and expensive problems with general convex constraints.