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 条
  • [31] Adaptive Stochastic Gradient Descent Method for Convex and Non-Convex Optimization
    Chen, Ruijuan
    Tang, Xiaoquan
    Li, Xiuting
    FRACTAL AND FRACTIONAL, 2022, 6 (12)
  • [32] Nonlinear optimization filters for stochastic time-varying convex optimization
    Simonetto, Andrea
    Massioni, Paolo
    INTERNATIONAL JOURNAL OF ROBUST AND NONLINEAR CONTROL, 2024, 34 (12) : 8065 - 8089
  • [33] Two stochastic optimization algorithms for convex optimization with fixed point constraints
    Iiduka, H.
    OPTIMIZATION METHODS & SOFTWARE, 2019, 34 (04): : 731 - 757
  • [34] Distributed Stochastic Subgradient Projection Algorithms for Convex Optimization
    Ram, S. Sundhar
    Nedic, A.
    Veeravalli, V. V.
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2010, 147 (03) : 516 - 545
  • [35] Delayed Algorithms for Distributed Stochastic Weakly Convex Optimization
    Gao, Wenzhi
    Deng, Qi
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,
  • [36] Stochastic sensor scheduling via distributed convex optimization
    Li, Chong
    Elia, Nicola
    AUTOMATICA, 2015, 58 : 173 - 182
  • [37] Stochastic intermediate gradient method for convex optimization problems
    Gasnikov, A. V.
    Dvurechensky, P. E.
    DOKLADY MATHEMATICS, 2016, 93 (02) : 148 - 151
  • [38] Lower bounds for non-convex stochastic optimization
    Arjevani, Yossi
    Carmon, Yair
    Duchi, John C.
    Foster, Dylan J.
    Srebro, Nathan
    Woodworth, Blake
    MATHEMATICAL PROGRAMMING, 2023, 199 (1-2) : 165 - 214
  • [39] Never Go Full Batch (in Stochastic Convex Optimization)
    Amir, Idan
    Carmon, Yair
    Koren, Tomer
    Livni, Roi
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021, 34
  • [40] The Complexity of Making the Gradient Small in Stochastic Convex Optimization
    Foster, Dylan J.
    Sekhari, Ayush
    Shamir, Ohad
    Srebro, Nathan
    Sridharan, Karthik
    Woodworth, Blake
    CONFERENCE ON LEARNING THEORY, VOL 99, 2019, 99