A recursive implementation of the ALIENOR optimization method

Autor: Peri, Daniele

Publikováno v: International Journal of Intelligent Computing and Cybernetics, 2021, Vol. 14, Issue 2, pp. 81-103.

Externí odkaz: http://www.emeraldinsight.com/doi/10.1108/IJICC-04-2020-0041

Adaptive points to estimate the Lebesgue constant on the simplex

Autor: Jiménez Ramos, Albert, Gargallo Peiró, Abel, Roca, Xevi

We present a novel adaptive sampling method to estimate the Lebesgue constant of nodal sets in n-dimensional simplices. The main application of this estimation is to assess the interpolation capabilities of a nodal distribution. Given such distributi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______3484::31cc061f99c8e4070acfaf6dc0fa397b
https://hdl.handle.net/2117/383623

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties

Autor: Jaroslav Fowkes, Nicholas I. M. Gould, Coralia Cartis

Publikováno v: Cartis, C, Fowkes, J M & Gould, N I M 2015, ' Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties ', Journal of Global Optimization, vol. 61, no. 3, pp. 429-457 . https://doi.org/10.1007/s10898-014-0199-6
Cartis, C, Fowkes, J & Gould, N 2013, Branching and Bounding Improvements for Global Optimization Algorithms with Lipschitz Continuity Properties . vol. 13-010 .

We present improvements to branch and bound techniques for globally optimizing functions with Lipschitz continuity properties by developing novel bounding procedures and parallelisation strategies. The bounding procedures involve nonconvex quadratic

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6f43468199cfae376bcecde0afda50f8
https://ora.ox.ac.uk/objects/uuid:7806d930-6121-4676-b896-a873c18a0b04

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.