A geometric programming framework for univariate cubic L1 smoothing splines

Annals of Operations Research

Volumn 133, Issue 1-4, 2005, Pages 229-248

  Cheng, Hao ^a   Fang, Shu Cherng ^a   Lavery, John E ^b  

^a North Carolina State University   (United States)

^b U S ARMY RESEARCH LABORATORY   (United States)

Author keywords

Data fitting; Geometric programming; Sensitivity analysis; Shape preservation; Smoothing spline

Indexed keywords

EID: 15244346812     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-004-5035-9     Document Type: Conference Paper

References (13)

1. 1 Splines - a Geometric Programming Approach." Mathematical Methods of Operations Research 56, 197-229.
2. Duffin, R.J., E.L. Peterson, and C. Zener. (1967). Geometric Programming: Theory and Application. New York: Wiley.
3. Fang, S.-C. and S. Puthenpura. (1993). Linear Optimization and Extensions: Theory and Algorithms. Englewood Cliffs, NJ: Prentice-Hall.
4. Farin, G.E. (1997). Curves and Surfaces for Computer Aided Geometric Design: A Practical Guide. San Diego: Academic Press.
5. Hoschek, J. and D. Lasser. (1993). Fundamentals of Computer Aided Geometric Design. Wellesley: A K Peters.
6. 1 Splines." Computer Aided Geometric Design 17, 319-336.
7. 1 Smoothing Splines." Computed Aided Geometric Design 17, 715-727.
8. Peterson, E.L. (1970). "Symmetric Duality for Generalized Unconstrained Geometric Programming." SIAM J. Applied Mathematics 19, 487-526.
9. Peterson, E.L. (1976). "Geometric Programming." SIAM Review 18, 1-51.
10. Peterson, E.L. (1977). "The Duality between Suboptimization and Parameter Deletion." Mathematics of Operations Research 2, 311-319.
11. Rockafellar, R.T. (1970). Convex Analysis. Princeton: Princeton Univ. Press.
12. Schumaker, L.L. (1981). Spline Functions: Basic Theory. New York: Wiley.
13. Scott, C. and S.-C. Fang (eds.). (2001). Geometric Programming. Annals of Operations Research 105.