Zobrazeno 1 - 10
of 89
pro vyhledávání: '"Marco Locatelli"'
Autor:
Marco Locatelli
Publikováno v:
Journal of Global Optimization. 83:201-220
In this paper we describe how to derive the convex envelope of a function f over the n-dimensional unit simplex $$\Delta _n$$ at different levels of detail, depending on the properties of function f, by starting from its definition as the supremum of
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:
Journal of Optimization Theory and Applications. 184:1083-1108
For a vehicle on an assigned path, we consider the problem of finding the time-optimal speed law that satisfies kinematic and dynamic constraints, related to maximum speed and maximum tangential and transversal acceleration. We show that the problem
Autor:
Marco Locatelli
Publikováno v:
Journal of Global Optimization. 76:1-24
In recent years many papers have derived polyhedral and non-polyhedral convex envelopes for different classes of functions. Except for the univariate cases, all these classes of functions share the property that the generating set of their convex env
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
Convex envelopes of separable functions over regions defined by separable functions of the same type
Autor:
Marco Locatelli
Publikováno v:
Optimization Letters. 12:1725-1739
In this paper we derive the convex envelope of separable functions obtained as a linear combination of strictly convex coercive one-dimensional functions over compact regions defined by linear combinations of the same one-dimensional functions. As a
Autor:
Marco Locatelli
Publikováno v:
Journal of Global Optimization. 72:277-303
In this paper we exploit a slight variant of a result previously proved in Locatelli and Schoen (Math Program 144:65–91, 2014) to define a procedure which delivers the convex envelope of some bivariate functions over polytopes. The procedure is bas
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
Autor:
Marco Locatelli, Zhi-Quan Luo
Publikováno v:
IEEE Transactions on Information Theory. 63:6622-6627
Consider a multi-tone multi-user communication system with $\mathbf {K}$ interfering users and $\mathbf {N}$ available tones. An effective approach to mitigate interference is through power control at transmitters. In this paper, we consider optimal