Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Ferenc Domes"'
Publikováno v:
Studies in Computational Intelligence ISBN: 9783030310400
This paper presents rigorous filtering methods for constraint satisfaction problems based on the interval union arithmetic. Interval unions are finite sets of closed and disjoint intervals that generalize the interval arithmetic. They allow a natural
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef4ef1585393b8fdec4da086efcdef21
https://doi.org/10.1007/978-3-030-31041-7_14
https://doi.org/10.1007/978-3-030-31041-7_14
Publikováno v:
Journal of Global Optimization
This paper considers the task of finding the smallest circle into which one can pack a fixed number of non-overlapping unit squares that are free to rotate. Due to the rotation angles, the packing of unit squares into a container is considerably hard
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eb6a867d2bbaf99259e5bc21649e4790
https://doi.org/10.1007/s10898-018-0711-5
https://doi.org/10.1007/s10898-018-0711-5
Publikováno v:
Journal of Global Optimization
One of the relevant research topics to which Chris Floudas contributed was quadratically constrained quadratic programming (QCQP). This paper considers one of the simplest hard cases of QCQP, the two trust region subproblem (TTRS). In this case, one
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3c939b6da83e817123c8eeb9ddfb3da2
https://doi.org/10.1007/s10898-018-0649-7
https://doi.org/10.1007/s10898-018-0649-7
Publikováno v:
Bit. Numerical Mathematics
An interval union is a finite set of closed and disjoint intervals. In this paper we introduce the interval union Gauss–Seidel procedure to rigorously enclose the solution set of linear systems with uncertainties given by intervals or interval unio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ee251f7dce5633fbde35081856b22864
http://europepmc.org/articles/PMC6399682
http://europepmc.org/articles/PMC6399682
Publikováno v:
Numerical Algorithms. 76:163-189
Tearing is a long-established decomposition technique, widely adapted across many engineering fields. It reduces the task of solving a large and sparse nonlinear system of equations to that of solving a sequence of low-dimensional ones. The most seri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c54a6acb454107196a241f2d10db00a8
https://doi.org/10.1007/s11075-016-0249-x
https://doi.org/10.1007/s11075-016-0249-x
Autor:
Arnold Neumaier, Ferenc Domes
Publikováno v:
Journal of Global Optimization. 65:457-486
This paper presents new techniques for filtering boxes in the presence of an additional quadratic constraint, a problem relevant for branch and bound methods for global optimization and constraint satisfaction. This is done by generating powerful lin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::653c3b0da8b4231145e08176521fcf10
https://doi.org/10.1007/s10898-015-0381-5
https://doi.org/10.1007/s10898-015-0381-5
Autor:
Arnold Neumaier, Ferenc Domes
Publikováno v:
Mathematical Programming. 155:375-401
In rigorous constrained global optimization, upper bounds on the objective function help to reduce the search space. Obtaining a rigorous upper bound on the objective requires finding a narrow box around an approximately feasible solution, which then
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5a89b9fe93a487d99a7ca40464491bae
https://doi.org/10.1007/s10107-014-0851-4
https://doi.org/10.1007/s10107-014-0851-4
Autor:
Ferenc Domes, Alexandre Goldsztejn
Publikováno v:
Journal of Global Optimization
Journal of Global Optimization, Springer Verlag, 2017, 68 (1), pp.1-22. ⟨10.1007/s10898-016-0462-0⟩
Journal of Global Optimization, Springer Verlag, 2017, 68 (1), pp.1-22. ⟨10.1007/s10898-016-0462-0⟩
The aim of this paper is to find the global solutions of uncertain optimization problems having a quadratic objective function and quadratic inequality constraints. The bounded epistemic uncertainties in the constraint coefficients are represented us
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fdc410dae1ce92f2a1dc402523052194
https://hal.archives-ouvertes.fr/hal-01730670
https://hal.archives-ouvertes.fr/hal-01730670
Autor:
Ferenc Domes, Arnold Neumaier
Publikováno v:
Journal of Global Optimization. 61:255-278
This paper considers the problem of finding and verifying feasible points for constraint satisfaction problems (CSPs), including those with uncertain coefficients. The main part is devoted to the problem of finding a narrow box around an approximatel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::24acc65dca6a9d8ccdc4fb2558678689
https://doi.org/10.1007/s10898-014-0158-2
https://doi.org/10.1007/s10898-014-0158-2
Publikováno v:
Optimization and Engineering. 15:443-468
The Optimization Test Environment is an interface to efficiently test different optimization solvers. It is designed as a tool for both developers of solver software and practitioners who just look for the best solver for their specific problem class
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b0155975c89a9ad99b323cc3875c0027
https://doi.org/10.1007/s11081-013-9234-6
https://doi.org/10.1007/s11081-013-9234-6