NONRANDOM PARAMETER ESTIMATION USING MIN-MAX THEORY

被引:2
|
作者
BHAT, MV [1 ]
DORAISWAMY, R [1 ]
机构
[1] UNIV WATERLOO,WATERLOO,ONTARIO,CANADA
关键词
D O I
10.1109/TR.1975.5215110
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:121 / 125
页数:5
相关论文
共 50 条
  • [21] On a min-max theorem
    Wu G.R.
    Huang W.H.
    Shen Z.H.
    Applied Mathematics-A Journal of Chinese Universities, 1997, 12 (3) : 293 - 298
  • [22] Min-max and min-max regret versions of combinatorial optimization problems: A survey
    Aissi, Hassene
    Bazgan, Cristina
    Vanderpooten, Daniel
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 197 (02) : 427 - 438
  • [23] Pseudo-polynomial algorithms for min-max and min-max regret problems
    Aissi, Hassene
    Bazgan, Cristina
    Vanderpooten, Daniel
    Operations Research and Its Applications, 2005, 5 : 171 - 178
  • [24] Min-max and min-max (relative) regret approaches to representatives selection problem
    Dolgui, Alexandre
    Kovalev, Sergey
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2012, 10 (02): : 181 - 192
  • [25] Faster min-max resource sharing in theory and practice
    Müller D.
    Radke K.
    Vygen J.
    Mathematical Programming Computation, 2011, 3 (1) : 1 - 35
  • [26] Min-max theory, Willmore conjecture and the energy of links
    Marques, Fernando C.
    Neves, Andre
    BULLETIN OF THE BRAZILIAN MATHEMATICAL SOCIETY, 2013, 44 (04): : 681 - 707
  • [27] A viscosity method in the min-max theory of minimal surfaces
    Riviere, Tristan
    PUBLICATIONS MATHEMATIQUES DE L IHES, 2017, 126 (01): : 177 - 246
  • [28] Min-max theory for networks of constant geodesic curvature
    Zhou, Xin
    Zhu, Jonathan J.
    ADVANCES IN MATHEMATICS, 2020, 361
  • [29] Min-max theory, Willmore conjecture and the energy of links
    Fernando C. Marques
    André Neves
    Bulletin of the Brazilian Mathematical Society, New Series, 2013, 44 : 681 - 707
  • [30] Min-max theory for constant mean curvature hypersurfaces
    Zhou, Xin
    Zhu, Jonathan J.
    INVENTIONES MATHEMATICAE, 2019, 218 (02) : 441 - 490