BOUNDS FOR THE ADDITIONAL COST OF NEAR-OPTIMAL CONTROLS

被引:1
|
作者
STEINBERG, AM
FORTE, I
机构
关键词
D O I
10.1007/BF01262980
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:385 / 395
页数:11
相关论文
共 50 条
  • [31] Online Markov Decoding: Lower Bounds and Near-Optimal Approximation Algorithms
    Garg, Vikas K.
    Pichkhadze, Tamar
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), 2019, 32
  • [32] Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness
    Garg, Ankit
    Kothari, Robin
    Netrapalli, Praneeth
    Sherif, Suhail
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021, 34
  • [33] MULTIITEM GROUPING ALGORITHM YIELDING NEAR-OPTIMAL LOGISTICS COST
    BUFFA, FP
    MUNN, JR
    DECISION SCIENCES, 1990, 21 (01) : 14 - 34
  • [34] Nonlinear optimal and near-optimal controls of a space robotic system via parallel computation
    Qu, ZH
    Zalewski, J
    SPACE ROBOTICS (SPRO'98), 1999, : 103 - 109
  • [35] Near-optimal Distortion Bounds for Embedding Doubling Spaces into L1
    Lee, James R.
    Sidiropoulos, Anastasios
    STOC 11: PROCEEDINGS OF THE 43RD ACM SYMPOSIUM ON THEORY OF COMPUTING, 2011, : 765 - 772
  • [36] Near-optimal blacklisting
    Dimitrakakis, Christos
    Mitrokotsa, Aikaterini
    COMPUTERS & SECURITY, 2017, 64 : 110 - 121
  • [37] Distributed saddle point problems: lower bounds, near-optimal and robust algorithms
    Beznosikov, Aleksandr
    Samokhin, Valentin
    Gasnikov, Alexander
    OPTIMIZATION METHODS & SOFTWARE, 2025,
  • [38] Near-optimal bounds on bounded-round quantum communication complexity of disjointness
    Braverman, Mark
    Garg, Ankit
    Ko, Young Kun
    Mao, Jieming
    Touchette, Dave
    2015 IEEE 56TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2015, : 773 - 791
  • [39] Near-Optimal Small-Depth Lower Bounds for Small Distance Connectivity
    Chen, Xi
    Oliveira, Igor C.
    Servedio, Rocco A.
    Tan, Li-Yang
    STOC'16: PROCEEDINGS OF THE 48TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2016, : 612 - 625
  • [40] Improved bounds for discretization of Langevin diffusions: Near-optimal rates without convexity
    Mou, Wenlong
    Flammarion, Nicolas
    Wainwright, Martin J.
    Bartlett, Peter L.
    BERNOULLI, 2022, 28 (03) : 1577 - 1601