Related papers: Convex Order and Arbitrage

We revisit mean-risk portfolio selection in a one-period financial market where risk is quantified by a positively homogeneous risk measure $\rho$. We first show that under mild assumptions, the set of optimal portfolios for a fixed return…

In this paper we introduce and study the concept of optimal and surely optimal dual martingales in the context of dual valuation of Bermudan options, and outline the development of new algorithms in this context. We provide a…

This paper investigates arbitrage properties of financial markets under distributional uncertainty using Wasserstein distance as the ambiguity measure. The weak and strong forms of the classical arbitrage conditions are considered. A…

We provide improved convergence rates for constrained convex-concave min-max problems and monotone variational inequalities with higher-order smoothness. In min-max settings where the $p^{th}$-order derivatives are Lipschitz continuous, we…

We develop a novel unified randomized block-coordinate primal-dual algorithm to solve a class of nonsmooth constrained convex optimization problems, which covers different existing variants and model settings from the literature. We prove…

In this paper, a new optimization framework is defined that includes the optimization framework recently proposed in [1]-[2] as a special case. The convex optimization in [1]-[2] includes centralized optimization and distributed…

This paper proposes a dynamic primal-dual type algorithm to solve the optimal scheduling problem in wireless networks subject to uncertain parameters, which are generated by stochastic network processes such as random packet arrivals,…

Let $G = (V,E)$ be a connected graph. A probability measure $\mu$ on $V$ is called "balanced" if it has the following property: if $T_\mu(v)$ denotes the "earth mover's" cost of transporting all the mass of $\mu$ from all over the graph to…

This paper deals with a Tikhonov regularized second-order inertial dynamical system that incorporates time scaling, asymptotically vanishing damping and Hessian-driven damping for solving convex optimization problems. Under appropriate…

We provide a unifying interpretation of various optimal transport problems as a minimisation of a linear functional over the set of all Choquet representations of a given pair of probability measures ordered with respect to a certain convex…

Let $\mu$ and $\nu$ be two non-degenerate finite signed Borel measures defined on a proper convex cone of $\mathbb{R}^n$. We prove that if all convolution powers of $\mu$ and $\nu$ are appropriately equal (and non-zero) on a proper concave…

Given any domain $X\subseteq \mathbb{R}^d$ and a probability measure $\rho$ on $X$, we study the problem of approximating in $L^2(X,\rho)$ a given function $u:X\to\mathbb{R}$, using its noiseless pointwise evaluations at random samples. For…

We continue our study of the Widom factors for $L_p(\mu)$ extremal polynomials initiated in [4]. In this work we characterize sets for which the lower bounds obtained in [4] are saturated, establish continuity of the Widom factors with…

This paper proposes a novel non-parametric multidimensional convex regression estimator which is designed to be robust to adversarial perturbations in the empirical measure. We minimize over convex functions the maximum (over Wasserstein…

Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. Under an ordering condition on the slopes of the functions at the origin, an algorithm that determines the optimum…

Cyclic arbitrage chances exist abundantly among decentralized exchanges (DEXs), like Uniswap V2. For an arbitrage cycle (loop), researchers or practitioners usually choose a specific token, such as Ether as input, and optimize their input…

In this paper, we refine and generalize closed forms for worst-case law invariant convex risk measures with uncertainty sets based on: i) closed balls under $p$-norms and Wasserstein distance; and ii) moment constraints involving mean and…

In the contest design problem, there are $n$ strategic contestants, each of whom decides an effort level. A contest designer with a fixed budget must then design a mechanism that allocates a prize $p_i$ to the $i$-th rank based on the…

This paper proposes a novel first-order algorithm that solves composite nonsmooth and stochastic convex optimization problem with function constraints. Most of the works in the literature provide convergence rate guarantees on the…

We propose and analyze several inexact regularized Newton-type methods for finding a global saddle point of convex-concave unconstrained min-max optimization problems. Compared to first-order methods, our understanding of second-order…