Dual Solutions in Convex Stochastic Optimization

被引:0
|
作者
Pennanen, Teemu [1 ]
Perkkioe, Ari-Pekka [2 ]
机构
[1] Kings Coll London, Dept Math, London WC2R 2LS, England
[2] Ludwig Maximilian Univ Munchen, Math Inst, D-80333 Munich, Germany
关键词
stochastic programming; convexity; duality; optimality conditions; OPTIMALITY CONDITIONS; DISCRETE-TIME; RECOURSE;
D O I
10.1287/moor.2022.0270
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
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 space of random variables. It implies, in particular, the necessity of scenario-wise optimality conditions that are behind many fundamental results in operations research, stochastic optimal control, and financial mathematics. Our analysis builds on the theory of Fre<acute accent>chet spaces of random variables whose topological dual can be identified with the direct sum of another space of random variables and a space of singular functionals. The results are illustrated by deriving sufficient and necessary optimality conditions for several more specific problem classes. We obtain significant extensions to earlier models, for example, on stochastic optimal control, portfolio optimization, and mathematical programming.
引用
收藏
页数:31
相关论文
共 50 条
  • [41] Stochastic structural topology optimization: existence of solutions and sensitivity analyses
    Evgrafov, A
    Patriksson, M
    Petersson, J
    ZEITSCHRIFT FUR ANGEWANDTE MATHEMATIK UND MECHANIK, 2003, 83 (07): : 479 - 492
  • [42] Duality and Optimality Conditions in Stochastic Optimization and Mathematical Finance
    Biagini, Sara
    Pennanen, Teemu
    Perkkioe, Ari-Pekka
    JOURNAL OF CONVEX ANALYSIS, 2018, 25 (02) : 403 - 420
  • [43] Introduction to convex optimization in financial markets
    Pennanen, Teemu
    MATHEMATICAL PROGRAMMING, 2012, 134 (01) : 157 - 186
  • [44] On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives
    Zhe Hong
    Guang-Ri Piao
    Do Sang Kim
    Optimization Letters, 2019, 13 : 891 - 906
  • [45] OPTIMALITY CONDITIONS FOR PORTFOLIO OPTIMIZATION PROBLEMS WITH CONVEX DEVIATION MEASURES AS OBJECTIVE FUNCTIONS
    Bot, Radu Ioan
    Lorenz, Nicole
    Wanka, Gert
    TAIWANESE JOURNAL OF MATHEMATICS, 2009, 13 (2A): : 515 - 533
  • [46] New optimality criteria for convex continuous-time problems of vector optimization
    Jovic, Aleksandar
    Marinkovic, Boban
    OPTIMIZATION, 2022, 71 (15) : 4555 - 4570
  • [47] Stochastic semidefinite programming: A new paradigm for stochastic optimization
    Ariyawansa K.A.
    Zhu Y.
    4OR, 2006, 4 (3) : 65 - 79
  • [48] Characteristics of semi-convex frontier optimization
    Li, Xuesong
    Liu, J. J.
    OPTIMIZATION, 2016, 65 (01) : 87 - 106
  • [49] A homogeneous predictor-corrector algorithm for stochastic nonsymmetric convex conic optimization with discrete support
    Alzalg, Baha
    Alabedalhadi, Mohammad
    COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 2023, 8 (03) : 531 - 559
  • [50] Relatively accelerated stochastic gradient algorithm for a class of non-smooth convex optimization problem
    Zhang, Wenjuan
    Feng, Xiangchu
    Xiao, Feng
    Huang, Shujuan
    Li, Huan
    Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University, 2024, 51 (03): : 147 - 157