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 条
  • [21] Private Stochastic Convex Optimization with Optimal Rates
    Bassily, Raef
    Feldman, Vitaly
    Talwar, Kunal
    Thakurta, Abhradeep
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), 2019, 32
  • [22] A Stochastic Newton Algorithm for Distributed Convex Optimization
    Bullins, Brian
    Patel, Kumar Kshitij
    Shamir, Ohad
    Srebro, Nathan
    Woodworth, Blake
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021, 34
  • [23] Faster Rates of Private Stochastic Convex Optimization
    Su, Jinyan
    Hu, Lijie
    Wang, Di
    INTERNATIONAL CONFERENCE ON ALGORITHMIC LEARNING THEORY, VOL 167, 2022, 167
  • [24] High probability guarantees for stochastic convex optimization
    Davis, Damek
    Drusvyatskiy, Dmitriy
    CONFERENCE ON LEARNING THEORY, VOL 125, 2020, 125
  • [25] ReSQueing Parallel and Private Stochastic Convex Optimization
    Carmon, Yair
    Jambulapati, Arun
    Jin, Yujia
    Lee, Yin Tat
    Liu, Daogao
    Sidford, Aaron
    Tian, Kevin
    2023 IEEE 64TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS, 2023, : 2031 - 2058
  • [26] INCREMENTAL STOCHASTIC SUBGRADIENT ALGORITHMS FOR CONVEX OPTIMIZATION
    Ram, S. Sundhar
    Nedic, A.
    Veeravalli, V. V.
    SIAM JOURNAL ON OPTIMIZATION, 2009, 20 (02) : 691 - 717
  • [27] On approximate solutions in convex vector optimization
    Deng, S
    SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1997, 35 (06) : 2128 - 2136
  • [28] STABILITY OF SOLUTIONS TO CONVEX PROBLEMS OF OPTIMIZATION
    MALANOWSKI, K
    LECTURE NOTES IN CONTROL AND INFORMATION SCIENCES, 1987, 93 : 3 - 134
  • [29] Optimization Filters for Stochastic Time-Varying Convex Optimization
    Simonetto, Andrea
    Massioni, Paolo
    2023 EUROPEAN CONTROL CONFERENCE, ECC, 2023,
  • [30] A STOCHASTIC APPROACH TO THE CONVEX OPTIMIZATION OF NON-CONVEX DISCRETE ENERGY SYSTEMS
    Burger, Eric M.
    Moura, Scott J.
    PROCEEDINGS OF THE ASME 10TH ANNUAL DYNAMIC SYSTEMS AND CONTROL CONFERENCE, 2017, VOL 3, 2017,