We consider the problem of finding the minimum of a real-valued multivariate polynomial function constrained in a compact set defined by polynomial inequalities and equalities. This problem, called polynomial optimization problem (POP), is generally nonconvex and has been of growing interest to...

We consider polynomial optimization problems pervaded by a sparsity pattern. It has been shown in [1, 2] that the optimal solution of a polynomial programming problem with structured sparsity can be computed by solving a series of semidefinite relaxations that possess the same kind of sparsity....

We present an international portfolio optimization model where we take into account the two different sources of return of an international asset: the local returns denominated in the local currency, and the returns on the foreign exchange rates. The explicit consideration of the returns on...

Robust portfolio optimization aims to maximize the worst-case portfolio return given that the asset returns are allowed to vary within a prescribed uncertainty set. If the uncertainty set is not too large, the resulting portfolio performs well under normal market conditions. However, its...

In this paper, we address the global optimization of two interesting nonconvex problems in finance. We relax the normality assumption underlying the classical Markowitz mean-variance portfolio optimization model and consider the incorporation of skewness (third moment) and kurtosis (fourth...

We study a currency investment strategy, where we maximize the return on a portfolio of foreign currencies relative to any appreciation of the corresponding foreign exchange rates. Given the uncertainty in the estimation of the future currency values, we employ robust optimization techniques to...

Portfolio optimization problems involving Value-at-Risk (VaR) are often computationally intractable and require complete information about the return distribution of the portfolio constituents, which is rarely available in practice. These difficulties are further compounded when the portfolio...

Temporal networks describe workflows of time-consuming tasks whose processing order is constrained by precedence relations. In many cases, the durations of the network tasks can be influenced by the assignment of resources. This leads to the problem of selecting an ‘optimal’ resource...