An Efficient Algorithm for Generating Univariate Cubic L1 Splines

被引：0
|
作者：
Hao Cheng
Shu-Cherng Fang
John E. Lavery
机构：
[1] North Carolina State University,Industrial Engineering and Operations Research
[2] Army Research Laboratory,Mathematics Division, Army Research Office
来源：
Computational Optimization and Applications | 2004年 / 29卷
关键词：
active set method; convex programming; cubic ; spline; geometric programming;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
An active set based algorithm for calculating the coefficients of univariate cubic L1 splines is developed. It decomposes the original problem in a geometric-programming setting into independent optimization problems of smaller sizes. This algorithm requires only simple algebraic operations to obtain an exact optimal solution in a finite number of iterations. In stability and computational efficiency, the algorithm outperforms a currently widely used discretization-based primal affine algorithm.
引用
收藏
页码：219 / 253
页数：34
相关论文
共 50 条
  • [31] Semismooth Newton Algorithm for Efficient Projections onto l1,∞-norm Ball
    Chu, Dejun
    Zhang, Changshui
    Sun, Shiliang
    Tao, Qing
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 119, 2020, 119
  • [32] Semismooth Newton Algorithm for Efficient Projections onto l1,∞-norm Ball
    Chu, Dejun
    Zhang, Changshui
    Sun, Shiliang
    Tao, Qing
    25TH AMERICAS CONFERENCE ON INFORMATION SYSTEMS (AMCIS 2019), 2019,
  • [33] ONE-SIDED L1 APPROXIMATION BY SPLINES WITH FIXED KNOTS
    PINKUS, A
    JOURNAL OF APPROXIMATION THEORY, 1976, 18 (02) : 130 - 135
  • [34] Generalized fairing algorithm of parametric cubic splines
    Wang Y.-J.
    Cao Y.
    Journal of Zhejiang University-SCIENCE A, 2006, 7 (9): : 1572 - 1577
  • [35] FAST L1 SMOOTHING SPLINES WITH AN APPLICATION TO KINECT DEPTH DATA
    Tepper, Mariano
    Sapiro, Guillermo
    2013 20TH IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP 2013), 2013, : 504 - 508
  • [36] Generalized fairing algorithm of parametric cubic splines
    WANG Yuan-jun
    Journal of Zhejiang University Science A(Science in Engineering), 2006, (09) : 1572 - 1577
  • [37] L1 APPROXIMATION OF GENERALIZED CONVEX FUNCTIONS BY SPLINES WITH FREE NODES
    JETTER, K
    MATHEMATISCHE ZEITSCHRIFT, 1978, 164 (01) : 53 - 66
  • [38] Fluency in writing - Generating text in L1 and L2
    Chenoweth, NA
    Hayes, JR
    WRITTEN COMMUNICATION, 2001, 18 (01) : 80 - 98
  • [39] Efficient computations of l1 and l∞ rearrangement distances
    Amir, Amihood
    Aumann, Yonatan
    Indyk, Piotr
    Levy, Avivit
    Porat, Ely
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (43) : 4382 - 4390
  • [40] Efficient computations of l1 and l∞ rearrangement distances
    Amir, Amihood
    Aumann, Yonatan
    Indyk, Piotr
    Levy, Avivit
    Porat, Ely
    STRING PROCESSING AND INFORMATION RETRIEVAL, PROCEEDINGS, 2007, 4726 : 39 - +
12345