Displaying similar documents to “Expected utility maximization and conditional value-at-risk deviation-based Sharpe ratio in dynamic stochastic portfolio optimization”

Stochastic optimization problems with second order stochastic dominance constraints via Wasserstein metric

Vlasta Kaňková, Vadim Omelčenko (2018)

Kybernetika

Similarity:

Optimization problems with stochastic dominance constraints are helpful to many real-life applications. We can recall e. g., problems of portfolio selection or problems connected with energy production. The above mentioned constraints are very suitable because they guarantee a solution fulfilling partial order between utility functions in a given subsystem 𝒰 of the utility functions. Especially, considering 𝒰 : = 𝒰 1 (where 𝒰 1 is a system of non decreasing concave nonnegative utility functions)...

Integral representations of risk functions for basket derivatives

Michał Barski (2012)

Applicationes Mathematicae

Similarity:

The risk minimizing problem E [ l ( ( H - X T x , π ) ) ] π m i n in the multidimensional Black-Scholes framework is studied. Specific formulas for the minimal risk function and the cost reduction function for basket derivatives are shown. Explicit integral representations for the risk functions for l(x) = x and l ( x ) = x p , with p > 1 for digital, quantos, outperformance and spread options are derived.

On risk reserve under distribution constraints

Mariusz Michta (2000)

Discussiones Mathematicae Probability and Statistics

Similarity:

The purpose of this work is a study of the following insurance reserve model: R ( t ) = η + 0 t p ( s , R ( s ) ) d s + 0 t σ ( s , R ( s ) ) d W s - Z ( t ) , t ∈ [0,T], P(η ≥ c) ≥ 1-ϵ, ϵ ≥ 0. Under viability-type assumptions on a pair (p,σ) the estimation γ with the property: i n f 0 t T P R ( t ) c γ is considered.

Limiting average cost control problems in a class of discrete-time stochastic systems

Nadine Hilgert, Onesimo Hernández-Lerma (2001)

Applicationes Mathematicae

Similarity:

We consider a class of d -valued stochastic control systems, with possibly unbounded costs. The systems evolve according to a discrete-time equation x t + 1 = G ( x t , a t ) + ξ t (t = 0,1,... ), for each fixed n = 0,1,..., where the ξ t are i.i.d. random vectors, and the Gₙ are given functions converging pointwise to some function G as n → ∞. Under suitable hypotheses, our main results state the existence of stationary control policies that are expected average cost (EAC) optimal and sample path average cost (SPAC)...

Hamilton-Jacobi flows and characterization of solutions of Aronsson equations

Petri Juutinen, Eero Saksman (2007)

Annali della Scuola Normale Superiore di Pisa - Classe di Scienze

Similarity:

In this note, we verify the conjecture of Barron, Evans and Jensen [3] regarding the characterization of viscosity solutions of general Aronsson equations in terms of the properties of associated forward and backwards Hamilton-Jacobi flows. A special case of this result is analogous to the characterization of infinity harmonic functions in terms of convexity and concavity of the functions r max y B r ( x ) u ( y ) and r min y B r ( x ) u ( y ) , respectively.

Combination of t-norms and their conorms

Karel Zimmermann (2023)

Kybernetika

Similarity:

Non-negative linear combinations of t min -norms and their conorms are used to formulate some decision making problems using systems of max-separable equations and inequalities and optimization problems under constraints described by such systems. The systems have the left hand sides equal to the maximum of increasing functions of one variable and on the right hand sides are constants. Properties of the systems are studied as well as optimization problems with constraints given by the systems...

Nash -equilibria for stochastic games with total reward functions: an approach through Markov decision processes

Francisco J. González-Padilla, Raúl Montes-de-Oca (2019)

Kybernetika

Similarity:

The main objective of this paper is to find structural conditions under which a stochastic game between two players with total reward functions has an ϵ -equilibrium. To reach this goal, the results of Markov decision processes are used to find ϵ -optimal strategies for each player and then the correspondence of a better answer as well as a more general version of Kakutani’s Fixed Point Theorem to obtain the ϵ -equilibrium mentioned. Moreover, two examples to illustrate the theory developed...

Stochastic convolution in separable Banach spaces and the stochastic linear Cauchy problem

Zdzisław Brzeźniak, Jan van Neerven (2000)

Studia Mathematica

Similarity:

Let H be a separable real Hilbert space and let E be a separable real Banach space. We develop a general theory of stochastic convolution of ℒ(H,E)-valued functions with respect to a cylindrical Wiener process W t H t [ 0 , T ] with Cameron-Martin space H. This theory is applied to obtain necessary and sufficient conditions for the existence of a weak solution of the stochastic abstract Cauchy problem (ACP) d X t = A X t d t + B d W t H (t∈ [0,T]), X 0 = 0 almost surely, where A is the generator of a C 0 -semigroup S ( t ) t 0 of bounded linear...

Exact l 1 penalty function for nonsmooth multiobjective interval-valued problems

Julie Khatri, Ashish Kumar Prasad (2024)

Kybernetika

Similarity:

Our objective in this article is to explore the idea of an unconstrained problem using the exact l 1 penalty function for the nonsmooth multiobjective interval-valued problem (MIVP) having inequality and equality constraints. First of all, we figure out the KKT-type optimality conditions for the problem (MIVP). Next, we establish the equivalence between the set of weak LU-efficient solutions to the problem (MIVP) and the penalized problem (MIVP ρ ) with the exact l 1 penalty function. The...

Linearization techniques for 𝕃 See PDF-control problems and dynamic programming principles in classical and 𝕃 See PDF-control problems

Dan Goreac, Oana-Silvia Serea (2012)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

The aim of the paper is to provide a linearization approach to the 𝕃 See PDF-control problems. We begin by proving a semigroup-type behaviour of the set of constraints appearing in the linearized formulation of (standard) control problems. As a byproduct we obtain a linear formulation of the dynamic programming principle. Then, we use the 𝕃 p See PDF approach and the associated linear formulations. This seems to be the most appropriate tool for treating 𝕃 See PDF problems in continuous and...

A stochastic mirror-descent algorithm for solving A X B = C over an multi-agent system

Yinghui Wang, Songsong Cheng (2021)

Kybernetika

Similarity:

In this paper, we consider a distributed stochastic computation of A X B = C with local set constraints over an multi-agent system, where each agent over the network only knows a few rows or columns of matrixes. Through formulating an equivalent distributed optimization problem for seeking least-squares solutions of A X B = C , we propose a distributed stochastic mirror-descent algorithm for solving the equivalent distributed problem. Then, we provide the sublinear convergence of the proposed algorithm....

Systems of Bellman Equations to Stochastic Differential Games with Discount Control

Alain Bensoussan, Jens Frehse (2008)

Bollettino dell'Unione Matematica Italiana

Similarity:

We consider two dimensional diagonal elliptic systems Δ u + a u = H ( x , u , u ) which arise from stochastic differential games with discount control. The Hamiltonians H have quadratic growth in u and a special structure which has notyet been covered by regularity theory. Without smallness condition on H , the existence of a regular solution is established.

Saddle point criteria for second order η -approximated vector optimization problems

Anurag Jayswal, Shalini Jha, Sarita Choudhury (2016)

Kybernetika

Similarity:

The purpose of this paper is to apply second order η -approximation method introduced to optimization theory by Antczak [2] to obtain a new second order η -saddle point criteria for vector optimization problems involving second order invex functions. Therefore, a second order η -saddle point and the second order η -Lagrange function are defined for the second order η -approximated vector optimization problem constructed in this approach. Then, the equivalence between an (weak) efficient solution...