CONSTRAINED REGULARIZED LEAST-SQUARES PROBLEMS

被引：0
|
作者：
ELFVING, T
机构：
来源：
LECTURE NOTES IN MATHEMATICS | 1991年 / 1497卷
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
下载
收藏
页码：153 / 166
页数：14
相关论文
共 50 条
  • [31] Optimal rates for the regularized least-squares algorithm
    Caponnetto, A.
    De Vito, E.
    FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2007, 7 (03) : 331 - 368
  • [32] Optimal Rates for the Regularized Least-Squares Algorithm
    A. Caponnetto
    E. De Vito
    Foundations of Computational Mathematics, 2007, 7 : 331 - 368
  • [33] Sparsity regularized recursive total least-squares
    Tanc, A. Korhan
    DIGITAL SIGNAL PROCESSING, 2015, 40 : 176 - 180
  • [34] Efficient retrieval of the regularized least-squares solution
    Sundaram, R
    OPTICAL ENGINEERING, 1998, 37 (04) : 1283 - 1289
  • [35] A direct method for a regularized least-squares problem
    Elfving, Tommy
    Skoglund, Ingegerd
    NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, 2009, 16 (08) : 649 - 675
  • [36] Model selection for regularized least-squares classification
    Yang, HH
    Wang, XY
    Wang, Y
    Gao, HH
    ADVANCES IN NATURAL COMPUTATION, PT 1, PROCEEDINGS, 2005, 3610 : 565 - 572
  • [37] Parallel Feature Selection for Regularized Least-Squares
    Okser, Sebastian
    Airola, Antti
    Aittokallio, Tero
    Salakoski, Tapio
    Pahikkala, Tapio
    APPLIED PARALLEL AND SCIENTIFIC COMPUTING (PARA 2012), 2013, 7782 : 280 - 294
  • [38] ALGEBRAIC CONNECTIONS BETWEEN THE LEAST-SQUARES AND TOTAL LEAST-SQUARES PROBLEMS
    VANHUFFEL, S
    VANDEWALLE, J
    NUMERISCHE MATHEMATIK, 1989, 55 (04) : 431 - 449
  • [39] Efficient AUC Maximization with Regularized Least-Squares
    Pahikkala, Tapio
    Airola, Antti
    Suominen, Hanna
    Boberg, Jorma
    Salakoski, Tapio
    TENTH SCANDINAVIAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2008, 173 : 12 - 19
  • [40] CONSTRAINED LEAST-SQUARES INTERVAL ESTIMATION
    PIERCE, JE
    RUST, BW
    SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1985, 6 (03): : 670 - 683
12345