activity
20112025
most citedStochastic programs without duality gaps for objectives without a lower bound

6 citations · 13 across the 11 of their papers we have counts for

collaborators
Showing math.OCShow all

11 papers · 1 filter

math.OC2025

Optimal Operation and Valuation of Electricity Storages in Intraday Markets

Jean-Philippe Chancelier, Michel de Lara, François Pacaud +3

This paper applies computational techniques of convex stochastic optimization to optimal operation and valuation of electricity storages in the face of uncertain electricity prices…

math.OC2025★ 1 cited

Optimal Operation and Valuation of Electricity Storages

Jean-Philippe Chancelier, Michel De Lara, François Pacaud +2

This paper applies computational techniques of convex stochastic optimization to optimal operation and valuation of electricity storages in the face of uncertain electricity prices…

math.OC2022★ 1 cited

Dynamic programming in convex stochastic optimization

Teemu Pennanen, Ari-Pekka Perkkiö

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…

math.OC2018

Convex integral functionals of cadlag processes

Ari-Pekka Perkkiö, Erick Treviño-Aguilar

This article characterizes conjugates and subdifferentials of convex integral functionals over linear spaces of cadlag stochastic processes. The approach is based on new measurabil…

math.OC2018

Optimal stopping without Snell envelopes

Teemu Pennanen, Ari-Pekka Perkkiö

This paper proves the existence of optimal stopping times via elementary functional analytic arguments. The problem is first relaxed into a convex optimization problem over a close…

math.OC2016

Convex integral functionals of processes of bounded variation

Teemu Pennanen, Ari-Pekka Perkkiö

This article characterizes conjugates and subdifferentials of convex integral functionals over the linear space of stochastic processes of essentially bounded v…

math.OC2015★ 3 cited

Duality and optimality conditions in stochastic optimization and mathematical finance

Sara Biagini, Teemu Pennanen, Ari-Pekka Perkkiö

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 t…

math.OC2015★ 2 cited

Non-convex dynamic programming and optimal investment

Teemu Penannen, Ari-Pekka Perkkiö, Miklós Rásonyi

We establish the existence of minimizers in a rather general setting of dynamic stochastic optimization without assuming either convexity or coercivity of the objective function. W…

math.OC2013

Duality in convex problems of Bolza over functions of bounded variation

Teemu Pennanen, Ari-Pekka Perkkiö

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 inte…

math.OC2013

Continuous essential selections and integral functionals

Ari-Pekka Perkkiö

Given a strictly positive measure, we characterize inner semicontinuous solid convex-valued mappings for which continuous functions which are selections almost everywhere are selec…

math.OC2011

Stochastic programs without duality gaps

Teemu Pennanen, Ari-Pekka Perkkiö

This paper studies dynamic stochastic optimization problems parametrized by a random variable. Such problems arise in many applications in operations research and mathematical fina…