Related papers: Recursive utility optimization with concave coeffi…
This article studies problems of optimal transport, by embedding them in a general functional analytic framework of convex optimization. This provides a unified treatment of a large class of related problems in probability theory and allows…
We present a convex-concave reformulation of the reversible Markov chain estimation problem and outline an efficient numerical scheme for the solution of the resulting problem based on a primal-dual interior point method for monotone…
We study the dual formulation of the utility maximization problem in incomplete markets when the utility function is finitely valued on the whole real line. We extend the existing results in this literature in two directions. First, we…
We provide three new proofs of the strong concavity of the dual function of some convex optimization problems. For problems with nonlinear constraints, we show that the the assumption of strong convexity of the objective cannot be weakened…
In this article we investigate the possibilities of accelerating the double smoothing technique when solving unconstrained nondifferentiable convex optimization problems. This approach relies on the regularization in two steps of the…
A new directional derivative and a new subdifferential for set-valued convex functions are constructed, and a set-valued version of the so-called 'max-formula' is proven. The new concepts are used to characterize solutions of convex…
In this article we develop a duality principle suitable for a large class of problems in optimization. The main result is obtained through basic tools of convex analysis and duality theory. We establish a correct relation between the…
This paper is mainly a survey of recent research developments regarding methods for risk minimization in financial markets modeled by It\^o-L\'evy processes, but it also contains some new results on the underlying stochastic maximum…
We revisit the smooth convex-concave bilinearly-coupled saddle-point problem of the form $\min_x\max_y f(x) + \langle y,\mathbf{B} x\rangle - g(y)$. In the highly specific case where each of the functions $f(x)$ and $g(y)$ is either affine…
This paper extends the SQP-approach of the well-known bundle-Newton method for nonsmooth unconstrained minimization to the nonlinearly constrained case. Instead of using a penalty function or a filter or an improvement function to deal with…
This paper firstly presents the necessary and sufficient conditions for a kind of discrete-time robust stochastic optimal control problem with convex control domains. As it is an "inf sup problem", the classical variational method is…
Consider the seller's problem of finding optimal prices for her $n$ (divisible) goods when faced with a set of $m$ consumers, given that she can only observe their purchased bundles at posted prices, i.e., revealed preferences. We study…
This note establishes a limiting formula for the conic Lagrangian dual of a convex infinite optimization problem, correcting the classical version of Karney [Math. Programming 27 (1983) 75-82] for convex semi-infinite programs. A…
We show that every symmetric random variable with log-concave tails satisfies the convex infimum convolution inequality with an optimal cost function (up to scaling). As a result, we obtain nearly optimal comparison of weak and strong…
This article studies the sensitivity of the power utility maximization problem with respect to the investor's relative risk aversion, the statistical probability measure, the investment constraints and the market price of risk. We extend…
We expose a theoretical hedging optimization framework with variational preferences under convex risk measures. We explore a general dual representation for the composition between risk measures and utilities. We study the properties of the…
It is well known that the minimal superhedging price of a contingent claim is too high for practical use. In a continuous-time model uncertainty framework, we consider a relaxed hedging criterion based on acceptable shortfall risks.…
We consider the classical problem of maximizing the expected utility of terminal net wealth with a final random liability in a simple jump-diffusion model. In the spirit of Horst et al. (2014) and Santacroce-Trivellato (2014), under…
We consider strongly convex optimization problems with affine-type restrictions. We build dual problem and solve dual problem by Fast Gradient Method. We use primal-dual structure of this method to construct the solution of the primal…
We derive a closed form portfolio optimization rule for an investor who is diffident about mean return and volatility estimates, and has a CRRA utility. The novelty is that confidence is here represented using ellipsoidal uncertainty sets…