00755nam a2200217 i 450099100268401970753620020503172233.0990507s1980 it ||| | ita b10399835-39ule_instEXGIL108062ExLBiblioteca InterfacoltàitaGrabar, André386791L'età d'oro di GiustinianoMilano :Rizzoli,1980408 p. ;19 cm..b1039983502-04-1427-06-02991002684019707536LE002 Fondo Giudici M 72712002000721358le002-E0.00-no 00000.i1046677027-06-02Età d'oro di Giustiniano220647UNISALENTOle00201-01-99ma -itait 2101759oam 2200433 a 450 991069909620332120091217140915.0(CKB)5470000002398919(OCoLC)428978494(EXLCZ)99547000000239891920090803d2008 ua 0engurbn|||||||||txtrdacontentcrdamediacrrdacarrierStatus of the six-party talks for the denuclearization of the Korean peninsula[electronic resource] hearing before the Committee on Foreign Relations, United States Senate, One Hundred Tenth Congress, second session, February 6 2008Washington :U.S. G.P.O.,2008.1 online resource (iii, 40 pages)S. hrg. ;110-617Title from title screen (viewed on Aug. 3, 2009).Status of the six-party talks for the denuclearization of the Korean peninsula Nuclear disarmamentKorea (North)Nuclear weaponsKorea (North)Diplomatic negotiations in international disputesNuclear nonproliferationKorea (North)International cooperationUnited StatesForeign relationsKorea (North)Korea (North)Foreign relationsUnited StatesNuclear disarmamentNuclear weaponsDiplomatic negotiations in international disputes.Nuclear nonproliferationInternational cooperation.GPOGPOGPOBOOK9910699096203321Status of the six-party talks for the denuclearization of the Korean peninsula3468476UNINA02903nam 2200409 450 991081615930332120230626121434.03-8325-9146-X(CKB)4910000000017349(MiAaPQ)EBC58504005a8e86f4-3ba8-4dc9-8206-66c5b0dd2d03(EXLCZ)99491000000001734920190909d2016 uy 0engurcnu||||||||txtrdacontentcrdamediacrrdacarrierBlack box optimization with exact subsolvers a radial basis function algorithm for problems with convex constraints /vorgelegt von Christine EdmanTrier :Logos Verlag Berlin GmbH,[2016]©20161 online resource (iv, 114 pages) illustrations"Dissertation zur Erlangung des akademischen Grades eines Doktors der Naturwissenschaften (Dr. rer. nat.) ... Dem Fachberich IV der Universität Trier, Trier, 2016."3-8325-4329-5 Includes bibliographical references (111-114).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.Radial basis functionsRadial basis functions.511.42Edman Christine1676087MiAaPQMiAaPQMiAaPQBOOK9910816159303321Black box optimization with exact subsolvers4042040UNINA