Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Marco Locatelli"'
Publikováno v:
Computational optimization and applications (Dordr., Online) 79 (2021): 561–599. doi:10.1007/s10589-021-00282-7
info:cnr-pdr/source/autori:Liuzzi G.; Locatelli M.; Piccialli V.; Rass S./titolo:Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems/doi:10.1007%2Fs10589-021-00282-7/rivista:Computational optimization and applications (Dordr., Online)/anno:2021/pagina_da:561/pagina_a:599/intervallo_pagine:561–599/volume:79
Computational optimization and applications (2020).
info:cnr-pdr/source/autori:G. Liuzzi, M. Locatelli, V. Piccialli, S. Rass/titolo:Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems/doi:/rivista:Computational optimization and applications/anno:2020/pagina_da:/pagina_a:/intervallo_pagine:/volume
info:cnr-pdr/source/autori:Liuzzi G.; Locatelli M.; Piccialli V.; Rass S./titolo:Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems/doi:10.1007%2Fs10589-021-00282-7/rivista:Computational optimization and applications (Dordr., Online)/anno:2021/pagina_da:561/pagina_a:599/intervallo_pagine:561–599/volume:79
Computational optimization and applications (2020).
info:cnr-pdr/source/autori:G. Liuzzi, M. Locatelli, V. Piccialli, S. Rass/titolo:Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems/doi:/rivista:Computational optimization and applications/anno:2020/pagina_da:/pagina_a:/intervallo_pagine:/volume
In this paper we address game theory problems arising in the context of network security. In traditional game theory problems, given a defender and an attacker, one searches for mixed strategies which minimize a linear payoff functional. In the probl
Publikováno v:
Computational Optimization and Applications. 76:201-232
The problem of minimizing the sum of a convex quadratic function and the ratio of two quadratic functions can be reformulated as a Celis–Dennis–Tapia (CDT) problem and, thus, according to some recent results, can be polynomially solved. However,
Publikováno v:
Computational Optimization and Applications. 73:101-128
In this paper, we address a class of specially structured problems that include speed planning, for mobile robots and robotic manipulators, and dynamic programming. We develop two new numerical procedures, that apply to the general case and to the li
Publikováno v:
Computational Optimization and Applications. 70:61-90
Range reduction techniques often considerably enhance the performance of algorithmic approaches for the solution of nonconvex problems. In this paper we propose a range reduction technique for a class of optimization problems with some special struct
Publikováno v:
Computational Optimization and Applications. 64:513-533
In this paper we discuss optimality-based domain reductions for Global Optimization problems both from the theoretical and from the computational point of view. When applying an optimality-based domain reduction we can easily define a lower limit for
Publikováno v:
Computational Optimization and Applications. 55:427-457
In this paper we consider a mathematical model for magmatic mixtures based on the Gibbs free energy. Different reformulations of the problem are presented and some theoretical results about the existence and number of solutions are derived. Finally,
Publikováno v:
Computational Optimization and Applications. 45:257-281
Very hard optimization problems, i.e., problems with a large number of variables and local minima, have been effectively attacked with algorithms which mix local searches with heuristic procedures in order to widely explore the search space. A Popula
Autor:
Marco Locatelli, Daniele Depetrini
Publikováno v:
Computational Optimization and Applications. 44:275-288
In this paper we consider the problem of minimizing the product of two affine functions over a polyhedral set. An approximation algorithm is proposed and it is proved that it is a Fully Polynomial Time Approximation Scheme. We will also present and c
Publikováno v:
Computational Optimization and Applications. 43:23-37
In this paper we consider global optimization algorithms based on multiple local searches for the Molecular Distance Geometry Problem (MDGP). Three distinct approaches (Multistart, Monotonic Basin Hopping, Population Basin Hopping) are presented and
Publikováno v:
Computational Optimization and Applications. 38:351-370
In this paper we perform a computational analysis of a population based approach for global optimization, Population Basin Hopping (PBH), which was proven to be very efficient on very challenging global optimization problems by the authors (see http: