BOUNDS FOR THE ADDITIONAL COST OF NEAR-OPTIMAL CONTROLS

被引：1
|
作者：
STEINBERG, AM
FORTE, I
机构：
来源：
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS | 1980年 / 31卷 / 03期
关键词：
D O I：
10.1007/BF01262980
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：385 / 395
页数：11
相关论文
共 50 条
  • [21] Performance bounds analyzing on a near-optimal algorithm of Qm || Cmax
    Li Dong
    Yang Dan
    Deng Lin
    Wang Shi-long
    Proceedings of 2005 Chinese Control and Decision Conference, Vols 1 and 2, 2005, : 1812 - 1814
  • [22] On necessary and sufficient conditions for near-optimal singular stochastic controls
    Hafayed, Mokhtar
    Abbas, Syed
    Veverka, Petr
    OPTIMIZATION LETTERS, 2013, 7 (05) : 949 - 966
  • [23] The dynamics and near-optimal controls of a dengue model with threshold policy
    You, Wei
    Meyer-Baese, Anke
    Xu, Xinzhong
    Zhang, Qimin
    MATHEMATICAL METHODS IN THE APPLIED SCIENCES, 2024, 47 (17) : 13313 - 13335
  • [24] On necessary and sufficient conditions for near-optimal singular stochastic controls
    Mokhtar Hafayed
    Syed Abbas
    Petr Veverka
    Optimization Letters, 2013, 7 : 949 - 966
  • [25] Stochastic near-optimal controls: Necessary and sufficient conditions for near-optimality
    Zhou, XY
    SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1998, 36 (03) : 929 - 947
  • [26] Near-optimal Per-Action Regret Bounds for Sleeping Bandits
    Quan Nguyen
    Mehta, Nishant A.
    INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 238, 2024, 238
  • [27] NUMERICAL EVALUATION OF SAMPLING BOUNDS FOR NEAR-OPTIMAL RECONSTRUCTION IN COMPRESSED SENSING
    Le Montagner, Yoann
    Marim, Marcio
    Angelini, Elsa
    Olivo-Marin, Jean-Christophe
    2011 18TH IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP), 2011,
  • [28] Collaborative Linear Bandits with Adversarial Agents: Near-Optimal Regret Bounds
    Mitra, Aritra
    Adibi, Arman
    Pappas, George J.
    Hassani, Hamed
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35 (NEURIPS 2022), 2022,
  • [29] Near-Optimal Bounds for Learning Gaussian Halfspaces with Random Classification Noise
    Diakonikolas, Ilias
    Diakonikolas, Jelena
    Kane, Daniel M.
    Wang, Puqian
    Zarifis, Nikos
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,
  • [30] Near-Optimal Regret Bounds for Multi-batch Reinforcement Learning
    Zhang, Zihan
    Jiang, Yuhang
    Zhou, Yuan
    Ji, Xiangyang
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35, NEURIPS 2022, 2022,
12345