메뉴 건너뛰기




Volumn 52, Issue 8, 2004, Pages 2177-2188

Linear minimax regret estimation of deterministic parameters with bounded data uncertainties

Author keywords

[No Author keywords available]

Indexed keywords

DATA PROCESSING; DATA STRUCTURES; EIGENVALUES AND EIGENFUNCTIONS; ERROR ANALYSIS; LEAST SQUARES APPROXIMATIONS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; MATRIX ALGEBRA; PARAMETER ESTIMATION; THEOREM PROVING; VECTORS;

EID: 3543077522     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2004.831144     Document Type: Article
Times cited : (84)

References (30)
  • 6
    • 84942484786 scopus 로고
    • Ridge regression: Biased estimation for nonorthogonal problems
    • Feb
    • A. E. Hoerl and R. W. Kennard, "Ridge regression: Biased estimation for nonorthogonal problems," Technometr., vol. 12, pp. 55-67, Feb. 1970.
    • (1970) Technometr. , vol.12 , pp. 55-67
    • Hoerl, A.E.1    Kennard, R.W.2
  • 7
    • 84952099094 scopus 로고
    • On biased estimation in linear models
    • Aug
    • L. S. Mayer and T. A. Willke, "On biased estimation in linear models," Technometr., vol. 15, pp. 497-508, Aug. 1973.
    • (1973) Technometr. , vol.15 , pp. 497-508
    • Mayer, L.S.1    Willke, T.A.2
  • 8
    • 0037333839 scopus 로고    scopus 로고
    • Covariance shaping least-squares estimation
    • Mar
    • Y. C. Eldar and A. V. Oppenheim, "Covariance shaping least-squares estimation," IEEE Trans. Signal Processing, vol. 51, pp. 686-697, Mar. 2003.
    • (2003) IEEE Trans. Signal Processing , vol.51 , pp. 686-697
    • Eldar, Y.C.1    Oppenheim, A.V.2
  • 9
    • 0003157339 scopus 로고
    • Robust estimation of a location parameter
    • P. J. Huber, "Robust estimation of a location parameter," Ann. Math. Statist., vol. 35, pp. 73-101, 1964.
    • (1964) Ann. Math. Statist. , vol.35 , pp. 73-101
    • Huber, P.J.1
  • 11
    • 3142717028 scopus 로고
    • A note on minimax filtering
    • L. Breiman, "A note on minimax filtering," Ann. Probab., vol. 1, pp. 175-179, 1973.
    • (1973) Ann. Probab. , vol.1 , pp. 175-179
    • Breiman, L.1
  • 12
    • 0017544596 scopus 로고
    • Robust Wiener filters
    • Oct./Nov
    • S. A. Kassam and T. L. Lim, "Robust Wiener filters," J. Franklin Inst., vol. 304, pp. 171-185, Oct./Nov. 1977.
    • (1977) J. Franklin Inst. , vol.304 , pp. 171-185
    • Kassam, S.A.1    Lim, T.L.2
  • 13
    • 0019031651 scopus 로고
    • On robust Wiener filtering
    • June
    • H. V. Poor, "On robust Wiener filtering," IEEE Trans. Automat. Contr., vol. AC-25, pp. 521-526, June 1980.
    • (1980) IEEE Trans. Automat. Contr. , vol.AC-25 , pp. 521-526
    • Poor, H.V.1
  • 14
    • 0021388394 scopus 로고
    • Robust Wiener-Kolmogorov theory
    • Mar
    • K. S. Vastola and H. V. Poor, "Robust Wiener-Kolmogorov theory," IEEE Trans. Inform. Theory, vol. IT-30, pp. 316-327, Mar. 1984.
    • (1984) IEEE Trans. Inform. Theory , vol.IT-30 , pp. 316-327
    • Vastola, K.S.1    Poor, H.V.2
  • 15
    • 3142695104 scopus 로고
    • Minimax-robust prediction of discrete time series
    • J. Franke, Minimax-robust prediction of discrete time series, in Z. Wahrscheinlichkeitstheorie verw. Gebiete, vol. 68, pp. 337-364, 1985.
    • (1985) Z Wahrscheinlichkeitstheorie Verw. Gebiete , vol.68 , pp. 337-364
    • Franke, J.1
  • 17
    • 3142711365 scopus 로고    scopus 로고
    • A competitive minimax approach to robust estimation in linear models
    • July
    • Y. C. Eldar and N. Merhav, "A competitive minimax approach to robust estimation in linear models," IEEE Trans. Signal Processing, vol. 52, pp. 1931-1946, July 2004.
    • (2004) IEEE Trans. Signal Processing , vol.52 , pp. 1931-1946
    • Eldar, Y.C.1    Merhav, N.2
  • 18
    • 0000056062 scopus 로고
    • Optimal filtering of square-integrable signals in Gaussian noise
    • M. S. Pinsker, "Optimal filtering of square-integrable signals in Gaussian noise," Problems Inform. Trans., vol. 16, pp. 120-133, 1980.
    • (1980) Problems Inform. Trans. , vol.16 , pp. 120-133
    • Pinsker, M.S.1
  • 19
    • 0022034007 scopus 로고
    • Robust techniques for signal processing: A survey
    • Mar
    • S. A. Kassam and H. V. Poor, "Robust techniques for signal processing: a survey," Proc. IEEE, vol. 73, pp. 433-481, Mar. 1985.
    • (1985) Proc. IEEE , vol.73 , pp. 433-481
    • Kassam, S.A.1    Poor, H.V.2
  • 20
    • 0021392809 scopus 로고
    • On minimax robustness: A general approach applications
    • Mar
    • S. Verdü and H. V. Poor, "On minimax robustness: a general approach and applications," IEEE Trans. Inform. Theory, vol. IT-30, pp. 328-340, Mar. 1984.
    • (1984) IEEE Trans. Inform. Theory , vol.IT-30 , pp. 328-340
    • Verdü, S.1    Poor, H.V.2
  • 21
    • 0020592869 scopus 로고
    • Robust signal processing for communication systems
    • S. A. Kassam and H. V. Poor, "Robust signal processing for communication systems," IEEE Commun. Mag., vol. 21, pp. 20-28, 1983.
    • (1983) IEEE Commun. Mag. , vol.21 , pp. 20-28
    • Kassam, S.A.1    Poor, H.V.2
  • 22
    • 84979885468 scopus 로고    scopus 로고
    • Robust mean-squared error estimation with bounded data uncertainties
    • to be published
    • Y. C. Eldar, A. Ben-Tal, and A. Nemirovski, ""Robust mean-squared error estimation with bounded data uncertainties," IEEE Trans. Signal Processing, to be published.
    • IEEE Trans. Signal Processing
    • Eldar, Y.C.1    Ben-Tal, A.2    Nemirovski, A.3
  • 23
    • 0015681549 scopus 로고
    • Universal noiseless coding
    • Nov
    • L. D. Davisson, "Universal noiseless coding," IEEE Trans. Inform. Theory, vol. IT-19, pp. 783-795, Nov. 1973.
    • (1973) IEEE Trans. Inform. Theory , vol.IT-19 , pp. 783-795
    • Davisson, L.D.1
  • 24
    • 0036612335 scopus 로고    scopus 로고
    • Universal composite hypothesis testing: A competitive minimax approach
    • June
    • M. Feder and N. Merhav, "Universal composite hypothesis testing: a competitive minimax approach," IEEE Trans. Inform. Theory, vol. 48, pp. 1504-1517, June 2002.
    • (2002) IEEE Trans. Inform. Theory , vol.48 , pp. 1504-1517
    • Feder, M.1    Merhav, N.2
  • 25
    • 0036671367 scopus 로고    scopus 로고
    • A competitive Neyman-Pearson approach to universal hypothesis testing with applications
    • Aug
    • E. Levitan and N. Merhav, "A competitive Neyman-Pearson approach to universal hypothesis testing with applications," IEEE Trans. Inform. Theory, vol. 48, pp. 2215-2229, Aug. 2002.
    • (2002) IEEE Trans. Inform. Theory , vol.48 , pp. 2215-2229
    • Levitan, E.1    Merhav, N.2
  • 30


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.