A polynomial optimization problem (POP) consists of minimizing a multivariate real polynomial on a semi-algebraic set K described by polynomial inequalities and equations. In its full generality it is a non-convex, multi-extremal, difficult global optimization problem. More than an decade ago, J. B. Lasserre proposed to solve POPs by a hierarchy of convex semidefinite programming (SDP) relaxati...

‎linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints‎. ‎in this paper‎, ‎to solve this problem‎, ‎we combine a discretization method and a neural network method‎. ‎by a simple discretization of the infinite constraints,we convert the linear semi-infinite programming problem into linear programming problem‎. ‎then‎, ‎we use...

in this paper, in order to optimize the portfolio consisting of selected industrial stocks of petroleum products, automobiles and parts, electrical industry and extraction of minerals from tehran stock exchange member, first, time – varying conditional covariance matrix has been estimated based on the following multivariate garch models: diagonal-vech (1,1), ccc (1,1) and diagonal -bekk (1,1). ...

The problem of portfolio optimization which deals with the twin objectives of minimizing risk and maximizing expected portfolio return can turn complex when constraints that model investor preferences and market norms such as bounding, cardinality and class constraints, and short sales are included in it. A complex-constrained portfolio optimization such as this has been beyond the reach of sol...

In this paper, we propose formulations and algorithms for robust portfolio optimization under both aleatory uncertainty (i.e., natural variability) and epistemic uncertainty (i.e., imprecise probabilistic information) arising from interval data. Epistemic uncertainty is represented using two approaches: (1) moment bounding approach and (2) likelihood-based approach. This paper first proposes a ...

To find out an effective way to solve the real estate portfolio optimization, an improved Ant Colony Algorithm based on information entropy was proposed. The information entropy was used to control the path selection and evolutional strategy by self-adjusting to overcome the premature convergence problem of the basic Ant Colony Algorithm. Simulation study on Traveling Salesman Problem and the a...

return maximization or risk minimization is goal in portfolio optimization based on mean variance theory. the structure of correlation matrices and individual variance of each asset are two main factors in optimization with risk minimization object. it’s necessary to use appropriate variance and correlation coefficient for time series with clustering volatilities feature, too. in this research,...

Swarm Intelligence (SI) is a relatively new technology that takes its inspiration from the behavior of social insects and flocking animals. In this paper, we focus on two main SI algorithms: Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO). An extension of ACO algorithm and a PSO algorithm has been implemented to solve the portfolio optimization problem, which is a continuous...

This paper provides an overview of the one-stage R&D portfolio optimization problem. It provides a novel problem model that can be solved with stochastic combinatorial optimization methods. Current solution methods are reviewed an a new method, Stochastic Gradient Portfolio Optimization (SGPO), is proposed. We proved global convergence under certain conditions. SGPO is numerically compared to c...