A compressed primal-dual method for generating bivariate cubic L1 splines

Journal of Computational and Applied Mathematics

Volumn 201, Issue 1, 2007, Pages 69-87

  Wang, Yong ^a   Fang, Shu Cherng ^b,d   Lavery, John E ^c  

^a SAS INSTITUTE INC   (United States)

^b NORTH CAROLINA STATE UNIVERSITY   (United States)

^c U S ARMY RESEARCH LABORATORY   (United States)

^d TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; NUMERICAL METHODS; OPTIMIZATION; PROBLEM SOLVING;

CONVEX PROGRAMMING PROBLEMS; INTERIOR POINT METHODS; MATRIX STRUCTURE; OPTIMIZATION MODELS;

MATRIX ALGEBRA;

EID: 33846164431     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cam.2006.02.005     Document Type: Article

References (28)

1. 1 splines-A geometric programming approach. Math. Methods Oper. Res. 56 (2002) 197-229
2. 1 splines. Comput. Optim. Appl. 29 (2004) 219-253
3. 1 splines. J. Comput. Appl. Math. 174 (2005) 361-382
4. Dennis J.E. Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Classics in Applied Mathematics vol. 16 (1996), SIAM, Philadelphia, PA
5. Fang S.-C., and Puthenpura S. Linear Optimization and Extensions: Theory and Algorithms (1993), Prentice-Hall, Englewood Cliffs, NJ
6. Foulds L.R. Optimization Techniques: An Introduction (1981), Springer, New York
7. 1 smoothing splines. In: Chui C.K., Schumaker L.L., and Stöckler J. (Eds). Approximation Theory X: Wavelets, Splines, and Applications (2002), Vanderbilt University Press, Nashville, TN 283-293
8. Golub G., and Van Loan C. Matrix Computations (1983), The Johns Hopkins University Press, Baltimore, MD
9. 1 piecewise cubics. SIAM J. Numer. Anal. 34 (1997) 569-585
10. J.-B. Hiriart-Urruty, C. Lemaréchal, Convex Analysis and Minimization Algorithms, Grundlehren der Mathematischen Wissenschaften, vols. 305, 306, Springer, New York, 1993.
11. Kuijt F., and van Damme R. Shape preserving interpolatory subdivision schemes for nonuniform data. J. Approx. Theory 114 (2002) 1-32
12. 1 splines. Comput. Aided Geom. Design 17 (2000) 319-336
13. 1 smoothing splines. Comput. Aided Geom. Design 17 (2000) 715-727
14. 1 splines. Comput. Aided Geom. Design 18 (2001) 321-343
15. 1 splines. In: Lucian M.L., and Neamtu M. (Eds). Proceedings of SIAM Conference on Geometric Design Computing (2004), Nashboro Press, Brentwood, TN 365-376
16. Lobo M.S., Vandenberghe L., Boyd S., and Lebret H. Applications of second-order cone programming. Linear Algebra Appl. 284 (1998) 193-228
17. Lustig I.J., Marsten R.E., and Shanno D.F. Interior point methods for linear programming: computational state of the art. ORSA J. Comput. 6 (1994) 1-14
18. Nesterov Y.E., and Nemirovski A. Interior-Point Polynomial Algorithms in Convex Programming (1994), SIAM, Philadelphia, PA
19. Peters J. Smoothness, fairness and the need for better multisided patches. In: Goldman R., and Krasauskas R. (Eds). Topics in Algebraic Geometry and Geometric Modeling, Contemporary Mathematics vol. 334 (2003), American Mathematical Society, Providence, RI 55-64
20. Ross K., Terlaky T., and Vial J.-P. Theory and Algorithms for Linear Optimization: An Interior Point Approach (1997), Wiley, Chichester
21. Utreras F.I. The variational approach to shape preservation. In: Laurent P.J., Le Mehauté A., and Schumaker L.L. (Eds). Curves and Surfaces (1991), Academic Press, New York 461-476
22. Vandenberghe L., and Boyd S. Semidefinite programming. SIAM Rev. 38 (1996) 49-95
23. Vanderbei R.J. Affine-scaling for linear programs with free variables. Math. Program. 43 (1989) 31-44
24. R.J. Vanderbei, LOQO: An interior point code for quadratic programming, Statistics and Operations Research Technical Report SOR-94-15, Princeton University, 1995.
25. Vanderbei R.J. Linear Programming: Foundations and Extensions. second ed. (2001), Kluwer Academic, Boston
26. Vanderbei R.J., Meketon M.J., and Freedman B.A. A modification of Karmarkar's linear programming algorithm. Algorithmica 1 (1986) 395-407
27. 1 splines. Comp. Math. Appl. 49 (2005) 481-514
28. Wright S.J. Primal-dual Interior-point Methods (1997), SIAM, Philadelphia, PA