All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1 Next

Displaying 1 – 20 of 118

Showing per page

A factor graph based genetic algorithm

B. Hoda Helmi, Adel T. Rahmani, Martin Pelikan (2014)

International Journal of Applied Mathematics and Computer Science

We propose a new linkage learning genetic algorithm called the Factor Graph based Genetic Algorithm (FGGA). In the FGGA, a factor graph is used to encode the underlying dependencies between variables of the problem. In order to learn the factor graph from a population of potential solutions, a symmetric non-negative matrix factorization is employed to factorize the matrix of pair-wise dependencies. To show the performance of the FGGA, encouraging experimental results on different separable problems...

A note on the convergence rate in regularized stochastic programming

Evgueni I. Gordienko, Yury Gryazin (2021)

Kybernetika

We deal with a stochastic programming problem that can be inconsistent. To overcome the inconsistency we apply Tikhonov's regularization technique, and, using recent results on the convergence rate of empirical measures in Wasserstein metric, we treat the following two related problems: 1. A choice of regularization parameters that guarantees the convergence of the minimization procedure. 2. Estimation of the rate of convergence in probability. Considering both light and heavy tail distributions...

A smoothing SAA method for a stochastic mathematical program with complementarity constraints

Jie Zhang, Li-wei Zhang, Yue Wu (2012)

Applications of Mathematics

A smoothing sample average approximation (SAA) method based on the log-exponential function is proposed for solving a stochastic mathematical program with complementarity constraints (SMPCC) considered by Birbil et al. (S. I. Birbil, G. Gürkan, O. Listes: Solving stochastic mathematical programs with complementarity constraints using simulation, Math. Oper. Res. 31 (2006), 739–760). It is demonstrated that, under suitable conditions, the optimal solution of the smoothed SAA problem converges almost...

A stochastic programming approach to managing liquid asset portfolios

Helgard Raubenheimer, Machiel F. Kruger (2010)

Kybernetika

Maintaining liquid asset portfolios involves a high carry cost and is mandatory by law for most financial institutions. Taking this into account a financial institution's aim is to manage a liquid asset portfolio in an “optimal” way, such that it keeps the minimum required liquid assets to comply with regulations. In this paper we propose a multi-stage dynamic stochastic programming model for liquid asset portfolio management. The model allows for portfolio rebalancing decisions over a multi-period...

A two-stage stochastic optimization model for a gas sale retailer

F. Maggioni, Maria Teresa Vespucci, E. Allevi, Marida Bertocchi, M. Innorta (2008)

Kybernetika

The paper deals with a new stochastic optimization model, named OMoGaS–SV (Optimization Modelling for Gas Seller–Stochastic Version), to assist companies dealing with gas retail commercialization. Stochasticity is due to the dependence of consumptions on temperature uncertainty. Due to nonlinearities present in the objective function, the model can be classified as an NLP mixed integer model, with the profit function depending on the number of contracts with the final consumers, the typology of...

An asset – liability management stochastic program of a leasing company

Tomáš Rusý, Miloš Kopa (2018)

Kybernetika

We build a multi-stage stochastic program of an asset-liability management problem of a leasing company, analyse model results and present a stress-testing methodology suited for financial applications. At the beginning, the business model of such a company is formulated. We introduce three various risk constraints, namely the chance constraint, the Value-at-Risk constraint and the conditional Value-at-Risk constraint along with the second-order stochastic dominance constraint, which are applied...

Approximative solutions of stochastic optimization problems

Petr Lachout (2010)

Kybernetika

The aim of this paper is to present some ideas how to relax the notion of the optimal solution of the stochastic optimization problem. In the deterministic case, ε -minimal solutions and level-minimal solutions are considered as desired relaxations. We call them approximative solutions and we introduce some possibilities how to combine them with randomness. Relations among random versions of approximative solutions and their consistency are presented in this paper. No measurability is assumed, therefore,...

Currently displaying 1 – 20 of 118

Page 1 Next