Related papers: Duality in convex stochastic optimization
This article studies convex duality in stochastic optimization over finite discrete-time. The first part of the paper gives general conditions that yield explicit expressions for the dual objective in many applications in operations…
This paper studies duality and optimality conditions for general convex stochastic optimization problems. The main result gives sufficient conditions for the absence of a duality gap and the existence of dual solutions in a locally convex…
This paper studies the dynamic programming principle for general convex stochastic optimization problems introduced by Rockafellar and Wets in [30]. We extend the applicability of the theory by relaxing compactness and boundedness…
The shadow price of information has played a central role in stochastic optimization ever since its introduction by Rockafellar and Wets in the mid-seventies. This article studies the concept in an extended formulation of the problem and…
This paper studies convex duality in optimal investment and contingent claim valuation in markets where traded assets may be subject to nonlinear trading costs and portfolio constraints. Under fairly general conditions, the dual expressions…
We consider the pricing problem facing a seller of a contingent claim. We assume that this seller has some general level of partial information, and that he is not allowed to sell short in certain assets. This pricing problem, which is our…
We develop a methodology for closing duality gap and guaranteeing strong duality in infinite convex optimization. Specifically, we examine two new Lagrangian-type dual formulations involving infinitely many dual variables and infinite sums…
We examine the duality theory for a class of non-convex functions obtained by composing a convex function with a continuous one. Using Fenchel duality, we derive a dual problem that satisfies weak duality under general assumptions. To…
We present new results on optimization problems where the involved functions are evenly convex. By means of a generalized conjugation scheme and the perturbation theory introduced by Rockafellar, we propose an alternative dual problem for a…
This paper proposes a general duality framework for the problem of minimizing a convex integral functional over a space of stochastic processes adapted to a given filtration. The framework unifies many well-known duality frameworks from…
We develop a general theory of convex duality for certain singular control problems, taking the abstract results by Kramkov and Schachermayer (1999) for optimal expected utility from nonnegative random variables to the level of optimal…
This paper studies convex problems of Bolza in the conjugate duality framework of Rockafellar. We parameterize the problem by a general Borel measure which has direct economic interpretation in problems of financial economics. We derive a…
The first part of this work established the foundations of a radial duality between nonnegative optimization problems, inspired by the work of (Renegar, 2016). Here we utilize our radial duality theory to design and analyze projection-free…
We study problems arising in real-time auction markets, common in e-commerce and computational advertising, where bidders face the problem of calculating optimal bids. We focus upon a contract management problem where a demand aggregator is…
This paper introduces a dual problem to study a continuous-time consumption and investment problem with incomplete markets and stochastic differential utility. For Epstein-Zin utility, duality between the primal and dual problems is…
This article develops a duality principle for a class of optimization problems in $\mathbb{R}^n$. The results are obtained based on standard tools of convex analysis and on a well known result of Toland for D.C. optimization. Global…
We investigate pricing-hedging duality for American options in discrete time financial models where some assets are traded dynamically and others, e.g. a family of European options, only statically. In the first part of the paper we…
Hidden convexity is a powerful idea in optimization: under the right transformations, nonconvex problems that are seemingly intractable can be solved efficiently using convex optimization. We introduce the notion of a Lagrangian dual…
This paper studies parameterized stochastic optimization problems in finite discrete time that arise in many applications in operations research and mathematical finance. We prove the existence of solutions and the absence of a duality gap…
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…