Least squares data fitting with applications

Least Squares Data Fitting with Applications

Volumn 9781421408583, Issue , 2012, Pages 1-305

  Hansen, Per Christian ^a   Pereyra, Víctor ^a   Scherer, Godela ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84917506005     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Book

References (265)

1. J. J. Alonso, I. M. Kroo and A. Jameson, "Advanced algorithms for design and optimization of quiet supersonic platforms." AIAA Paper 02-0114, 40th AIAA Aerospace Sciences Meeting and Exhibit, Reno, NV, 2002.
2. J. J. Alonso, P. Le Gresley, E. van der Weide and J. Martins, "pyMDO: A framework for high-fidelity multidisciplinary optimization." 10th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference, Albany, NY, 2004.
3. A. Anda and H. Park, "Fast plane rotations with dynamic scaling." SIAM J. Matrix Anal. Appl. 15:162-174, 1994.
4. E. Angelosante, D. Giannakis and G. B. Grossi, "Compressed sensing of time-varying signals." Digital Signal Processing, 16th International Conference, Santorini, Greece, 2009.
5. H. Ashley and M. Landahl, Aerodynamics of Wings and Bodies. Dover, New York, 1985.
6. I. Barrodale and F. D. K. Roberts, "An improved algorithm for discrete -1 linear approximation." SIAM J. Numer. Anal. 10:839-848, 1973.
7. R. Bartels, J. Beaty and B. Barski, An Introduction to Splines for Use in Computer Graphics and Parametric Modeling. Morgan Kaufman Publishers, Los Altos, CA, 1987.
8. A. E. Beaton and J. W. Tukey, "The fitting of power series, meaning polynomials, illustrated on band-spectroscopic data." Technometrics 16:147-185, 1974.
9. D. M. Bates and D. G. Watts, Nonlinear Regression Analysis and Its Applications. J. Wiley, New York, 1988.
10. G. M. Baudet, "Asynchronous iterative methods for multiprocessors." J. ACM 15:226-244, 1978.
11. A. Beck, A. Ben-Tal and M. Teboulle, "Finding a global optimal solution for a quadratically constrained fractional quadratic problem with applications to the regularized total least squares." SIAM J. Matrix Anal. Appl. 28:425-445, 2006.
12. M. Berry, "Large scale sparse singular value computations." International J. Supercomp. Appl. 6:13-49, 1992.
13. P. R. Bevington, Data Reduction and Error Analysis for the Physical Sciences. McGraw-Hill, New York, 1969.
14. C. H. Bischof and G. Qintana-Orti, "Computing rank-revealing QR factorization of dense matrices." ACM TOMS 24:226-253, 1998.
15. C. M. Bishop, Neural Networks for Pattern Recognition. Oxford University Press, New York, 1995.
16. Å. Björck, "Solving linear least squares problems by Gram-Schmidt orthogonalization." BIT 7:1-21, 1967.
17. Å. Björck, "Iterative refinement of linear least squares solutions." BIT 7:257-278, 1967.
18. Å. Björck, "Iterative refinement of linear least squares solutions II." BIT 8:8-30, 1968.
19. Å. Björck, "Stability analysis of the method of seminormal equations for linear least squares problems." Lin. Alg. Appl. 88/89:31-48, 1987.
20. Å. Björck, Numerical Methods for Least Squares Problems. SIAM, Philadelphia, 1996.
21. Å. Björck, "The calculation of linear least squares problems." Acta Numerica 13:1-53, 2004.
22. Å. Björck and I. S. Duff, "A direct method for the solution of sparse linear least squares problems." Lin. Alg. Appl. 34:43-67, 1980.
23. Å. Björck and G. H. Golub, "Iterative refinement of linear least squares solution by Householder transformation." BIT 7:322-337, 1967.
24. Å. Björck, E. Grimme and P. Van Dooren, "An implicit shift bidiagonalization algorithm for ill-posed systems." BIT 34:510-534, 1994.
25. Å. Björck, P. Heggernes and P. Matstoms, "Methods for large scale total least squares problems." SIAM J. Matrix Anal. Appl. 22:413- 429, 2000.
26. Å. Björck and C. C. Paige, "Loss and recapture of orthogonality in the modified Gram-Schmidt algorithm." SIAM J. Matrix Anal. 13:176- 190, 1992.
27. Å. Björck and V. Pereyra, "Solution of Vandermonde systems of equations." Math. Comp. 24:893-904, 1970.
28. C. Böckman, "A modification of the trust-region Gauss-Newton method for separable nonlinear least squares problems." J. Math. Systems, Estimation and Control 5:1-16, 1995.
29. C. de Boor, A Practical Guide to Splines. Applied Mathematical Sciences 27. Springer, New York, 1994.
30. S. P. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, Cambridge, 2003.
31. R. Brent, Algorithms for Minimization Without Derivatives. Prentice Hall, Englewood Cliffs, NJ, 1973. Reprinted by Dover, New York, 2002.
32. D. Calvetti, P. C. Hansen and L. Reichel, "L-curve curvature bounds via Lanczos bidiagonalization." Electr. Transact. on Num. Anal. 14:134-149, 2002.
33. D. Calvetti, G. H. Golub and L. Reichel, "Estimation of the L-curve via Lanczos bidiagonalization algorithm for ill-posed systems." BIT 39:603-619, 1999.
34. E. J. Candes, "Compressive sampling." Proceedings of the International Congress of Mathematicians, Madrid, Spain, 2006.
35. E. J. Candes and M. B. Wakin, "People hearing without listening: An introduction to compressive sampling." Signal Processing Magazine, IEEE 25:21-30, 2008.
36. L. Carcione, J. Mould, V. Pereyra, D. Powell and G. Wojcik, "Nonlinear inversion of piezoelectrical transducer impedance data." J. Comp. Accoustics 9:899-910, 2001.
37. L. Carcione, V. Pereyra and D. Woods, GO: Global Optimization. Weidlinger Associates Report, 2005.
38. R. I. Carmichael and L. I. Erickson, "A higher order panel method for predicting subsonic or supersonic linear potential flow about arbitrary configurations." American Institute of Aeronautics and Astronautics Paper 81-1255, 1981.
39. M. Chan, "Supersonic aircraft optimization for minimizing drag and sonic boom." Ph.D. Thesis, Stanford University, Stanford, CA, 2003.
40. T. F. Chan, "Rank revealing QR-factorizations." Lin. Alg. Appl. 88/89:67-82, 1987.
41. T. F. Chan and D. E. Foulser, "Effectively well-conditioned linear systems." SIAM J. Sci. Stat. Comput. 9:963-969, 1988.
42. T. F. Chan and P. C. Hansen, "Computing truncated SVD least squares solutions by rank revealing QR-factorizations." SIAM J. Sci. Statist. Comput. 11:519-530, 1991.
43. D. Chazan and W. L. Miranker, "Chaotic relaxation." Lin. Alg. Appl. 2:199-222, 1969.
44. W. Cheney and D. Kincaid, Numerical Mathematics and Computing. Brooks/Cole, Belmont, CA, 2007.
45. S. Choi, J. J. Alonso and H. S. Chung, "Design of low-boom supersonic business jet using evolutionary algorithms and an adaptive unstructured mesh method." 45th AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics and Materials Conference, Palm Springs, CA, 2004.
46. H. S. Chung, S. Choi and J. J. Alonso, "Supersonic business jet design using knowledge-based genetic algorithms with adaptive, unstructured grid methodology." AIAA 2003-3791, 21st Applied Aerodynamic Conference, Orlando, Fl., June 2003.
47. H. S. Chung, "Multidisciplinary design optimization of supersonic business jets using approximation model-based genetic algorithms." Ph.D. Thesis, Stanford University, Stanford, CA, 2004.
48. J. F. Claerbout and F. Muir, "Robust modeling with erratic data." Geophysics 38:826-844, 1973.
49. A. K. Cline, "An elimination method for the solution of linear least squares problems." SIAM J. Numer. Anal. 10:283-289, 1973.
50. D. Coleman, P. Holland, N. Kaden, V. Klema and S. C. Peters, "A system of subroutines for iteratively reweighted least squares computations." ACM TOMS 6:328-336, 1980.
51. T. F. Coleman and Y. Li, "A globally and quadratically convergent affine scaling method for linear -1 problems." Mathematical Programming, Series A 56:189-222, 1992.
52. T. P. Collignon, "Efficient iterative solution of large linear systems on heterogeneous computing systems." Ph. D. Thesis, TU Delft, The Netherlands, 2011.
53. T. P. Collignon and M. B. van Gijzen. "Parallel scientific computing on loosely coupled networks of computers." In B. Koren and C. Vuik, editors, Advanced Computational Methods in Science and Engineering. Springer Series Lecture Notes in Computational Science and Engineering, 71:79-106. Springer Verlag, Berlin/Heidelberg, Germany, 2010.
54. G. Cybenko, "Approximation by superpositions of a sigmoidal function." Math. Control Signals Systems 2:303-314, 1989.
55. J. Dahl, P. C. Hansen, S. H. Jensen and T. L. Jensen, "Algorithms and software for total variation image reconstruction via first-order methods." Numer. Algo. 53:67-92, 2010.
56. J. Dahl and L. Vanderberghe, CVXOPT: A Python Package for Convex Optimization. http://abel.ee.ucla.edu/cvxopt, 2012.
57. G. Dahlquist and Å. Björck, Numerical Methods in Scientific Computing. SIAM, Philadelphia, 2008.
58. T. A. Davis and Y. Hu, "The University of Florida sparse matrix collection." ACM TOMS 38:1-25, 2011.
59. K. Deb, A. Pratap, S. Agrawal and T. Meyarivan, A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. Technical Report No. 2000001. Indian Institute of Technology, Kanpur, India, 2000.
60. P. Deift, J. Demmel, L.-C. Li and C. Tomei, "The bidiagonal singular value decomposition and Hamiltonian mechanics." SIAM J. Numer. Anal. 28:1463-1516, 1991.
61. R. S. Dembo, S. C. Eisenstat and T. Steihaug, "Inexact Newton methods." SIAM J. Numer. Anal. 19:400-408, 1982.
62. C. J. Demeure and L. L. Scharf, "Fast least squares solution of Vandermonde systems of equations." Acoustics, Speech and Signal Processing 4:2198-2210, 1989.
63. J. W. Demmel, Applied Numerical Linear Algebra. SIAM, Philadelphia, 1997.
64. J. Demmel, Y. Hida, W. Riedy and X. S. Li, "Extra-precise iterative refinement for overdetermined least squares problems." ACM TOMS 35:1-32, 2009.
65. J. Dennis, D. M. Gay and R. Welsch, "Algorithm 573 NL2SOL - An adaptive nonlinear least-squares algorithm." ACM TOMS 7:369-383, 1981.
66. J. Dennis and R. Schnabel, Numerical Methods for Unconstrained Optimization and Nonlinear Equations. SIAM, Philadelphia, 1996.
67. J. E. Dennis and H. F. Walker, "Convergence theorems for leastchange secant update methods." SIAM J. Num. Anal. 18:949-987, 1981.
68. A. P. Dempster, N. M. Laird and D. B. Rubin. "Maximum likelihood from incomplete data via the EM algorithm (with discussion)." Journal of the Royal Statistical Society B 39:1-38, 1977.
69. P. Dierckx, Curve and Surface Fitting with Splines. Clarendon Press, Oxford, 1993.
70. J. Dongarra, J. R. Bunch, C. B. Moler and G. W. Stewart, LINPACK User's Guide. SIAM, Philadelphia, 1979.
71. N. Draper and H. Smith, Applied Regression Analysis. J. Wiley, New York, 1981.
72. C. Eckart and G. Young, "The approximation of one matrix by another of lower rank." Psychometrika 1:211-218, 1936.
73. L. Eldén, "A note on the computation of the generalized crossvalidation function for ill-conditioned least squares problems." BIT 24:467-472, 1984.
74. L. Eldén, "Perturbation theory for the linear least squares problem with linear equality constraints." BIT 17:338-350, 1980.
75. L. Eldén, Matrix Methods in Data Mining and Pattern Recognition. SIAM, Philadelphia, 2007.
76. J. Eriksson, P.-Å. Wedin, M. E. Gulliksson and I. Söderkvist, "Regularization methods for uniformly rank-deficient nonlinear leastsquares problems." J. Optimiz. Theory and Appl. 127:1-26, 2005.
77. J. Eriksson and P.-Å. Wedin, "Truncated Gauss-Newton algorithms for ill-conditioned nonlinear least squares problems." Optimiz. Meth. and Software 19:721-737, 2004.
78. R. D. Fierro, P. C. Hansen and P. S. K. Hansen, "UTV tools: MATLAB templates for rank-revealing UTV decompositions." Numer. Algo. 20:165-194, 1999. The software is available from: htpp://www.netlib.org/numeralgo.
79. P. M. Fitzpatrick, Advanced Calculus. Second edition Brooks/Cole, Belmont, CA, 2006.
80. D. Fong and M. A. Saunders, "LSMR: An iterative algorithm for sparse least-squares problems." SIAM J. Sci. Comput. 33:2950-2971, 2011.
81. G. E. Forsythe, "Generation and use of orthogonal polynomials for data-fitting with a digital computer." J. SIAM 5:74-88, 1957.
82. J. Fox and S. Weisberg, Robust Regression in R, An Appendix to An R Companion to Applied Regression, Second edition. http://socserv.socsci.mcmaster.ca/jfox/Books/Companion/appendix.html.
83. C. F. Gauss, Theory of the Combination of Observations Least Subject to Errors. Parts 1 and 2, Supplement, G. W. Stewart. SIAM, Philadelphia, 1995.
84. D. M. Gay, Usage Summary for Selected Optimization Routines. AT&T Bell Labs. Comp. Sc. Tech. Report, 1990.
85. D. M. Gay and L. Kaufman, Tradeoffs in Algorithms for Separable Nonlinear Least Squares. AT&T Bell Labs. Num. Anal. Manuscript, 90-11, 1990.
86. D. M. Gay, NSF and NSG; PORT Library. AT&T Bell Labs. http://www.netlib.org/port, 1997.
87. P. E. Gill, G. H. Golub, W. Murray and M. A. Saunders, "Methods for modifying matrix factorisations." Math. Comp. 28:505-535, 1974.
88. P. E. Gill, S. J. Hammarling, W. Murray, M. A. Saunders and M. H. Wright, Users Guide for LSSOL (Version 1.0): A Fortran Package for Constrained Linear Least-Squares and Convex Quadratic Programming. Report 86-1 Department of Operation Research, Stanford University, CA, 1986.
89. P. E. Gill, W. Murray and M. A. Saunders, "SNOPT: An SQP algorithm for large-scale constrained optimization." SIAM Rev. 47:99- 131, 2005.
90. P. E. Gill, W. Murray, M. A. Saunders and M. H. Wright, "Maintaining LU factors of a general sparse matrix." Linear Algebra and its Applications 88-89:239-270, 1987.
91. P. E. Gill, W. Murray and M. H. Wright, Practical Optimization. Academic Press, 1981.
92. G. H. Golub, "Numerical methods for solving linear least squares problems." Numer. Math. 7:206-16, 1965.
93. G. H. Golub, P. C. Hansen and D. P. O'Leary, "Tikhonov regularization and total least squares." SIAM J. Matrix Anal. Appl. 21:185-194, 1999.
94. G. H. Golub, M. Heath and G. Wahba, "Generalized cross-validation as a method for choosing a good ridge parameter." Technometrics 21:215-223, 1979.
95. G. H. Golub, A. Hoffman and G. W. Stewart, "A generalization of the Eckhard-Young-Mirsky matrix approximation theorem." Linear Algebra Appl. 88/89:317-327, 1987.
96. G. H. Golub and W. Kahan, "Calculating the singular values and pseudo-inverse of a matrix." SIAM J, Numer. Anal. Ser. B 2:205- 224, 1965.
97. G. H. Golub, V. Klema and G. W. Stewart, Rank Degeneracy and Least Squares. Report TR-456, Computer Science Department, University of Maryland, College Park, 1977.
98. G. H. Golub and R. Le Veque, "Extensions and uses of the variable projection algorithm for solving nonlinear least squares problems." Proceedings of the Army Numerical Analysis and Computers Conference, White Sands Missile Range, New Mexico, pp. 1-12, 1979.
99. G. H. Golub and U. von Matt, "Tikhonov regularization for large problems." Workshop on Scientific Computing, Ed. G. H. Golub, S. H. Lui, F. Luk and R. Plemmons, Springer, New York, 1997.
100. G. H. Golub and V. Pereyra, The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate. STAN-CS-72-261, Stanford University, Computer Sciences Department, 1972. (It contains the original VARPRO computer code.).
101. G. H. Golub and V. Pereyra, "The differentiation of pseudo-inverses and nonlinear least squares problems whose variables separate." SIAM J. Numer. Anal. 10:413-432, 1973.
102. G. H. Golub and V. Pereyra, "Differentiation of pseudoinverses, separable nonlinear least squares problems, and other tales." Proceedings MRC Seminar on Generalized Inverses and Their Applications, Ed. Z. Nashed, pp. 302-324, Academic Press, NY, 1976.
103. G. H. Golub and V. Pereyra, "Separable nonlinear least squares: The variable projection method and its applications." Inverse Problems 19:R1-R26, 2003.
104. G. H. Golub and J. M. Varah, "On a characterization of the best -2-scaling of a matrix." SIAM J. Numer. Anal. 11:472-279, 1974.
105. G. H. Golub and C. F. Van Loan, Matrix Computations. Third edition, John Hopkins University Press, Baltimore, 1996.
106. G. H. Golub and C. F. Van Loan, "An analysis of the total least squares problem." SIAM J. Numer. Anal. 17:883-893, 1980.
107. G. H. Golub and J. H. Wilkinson, "Note on iterative refinement of least squares solutions." Numer. Math. 9:139-148, 1966.
108. J. F. Grcar, Optimal Sensitivity Analysis of Linear Least Squares. Lawrence Berkeley National Laboratory, Report LBNL-52434, 2003.
109. J. F. Grcar, "Mathematicians of Gaussian elimination." Notices of the AMS 58:782-792, 2011.
110. J. F. Grcar, "John von Neumann's analysis of Gaussian elimination and the origins of modern Numerical Analysis." SIAM Review 53:607-682, 2011.
111. A. Griewank and A. Walther, Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation. Other Titles in Applied Mathematics 105. Second edition, SIAM, Philadelphia, 2008.
112. E. Grosse, "Tensor spline approximation." Linear Algebra Appl. 34:29-41, 1980.
113. I. Gutman, V. Pereyra and H. D. Scolnik, "Least squares estimation for a class of nonlinear models." Technometrics 15:209-218, 1973.
114. Y. Y. Haimes, L. S. Ladon and D. A. Wismer, "On a bicriterion formulation of the problem of integrated system identification and system optimization." IEEE Trans. on Systems, Man and Cybernetics 1:296-297, 1971.
115. S. Hammarling, "A note on modifications to the Givens plane rotations." J. Inst. Math. Applic. 13:215-218, 1974.
116. S. Hammarling, A Survey of Numerical Aspects of Plane Rotations. University of Manchester, MIMS Eprint 2008.69, 1977.
117. M. Hanke and P. C. Hansen, "Regularization methods for large-scale problems." Surv. Math. Ind. 3:253-315, 1993.
118. P. C. Hansen, Rank-Deficient and Discrete Ill-Posed Problems. SIAM, Philadelphia, 1998.
119. P. C. Hansen, "The L-curve and its use in the numerical treatment of inverse problems." In Comp. Inverse Problems in Electrocardiology. Ed. P. Johnston, pp. 119-142, WIT Press, Southampton, UK, 2001.
120. P. C. Hansen, "Regularization tools version 4.0 for MATLAB 7.3." Numer. Algorithms 46:189-194, 2007.
121. P. C. Hansen, Discrete Inverse Problems - Insight and Algorithms. SIAM, Philadelphia, 2010.
122. P. C. Hansen, M. Kilmer and R. H. Kjeldsen, "Exploiting residual information in the parameter choice for discrete ill-posed problems." BIT 46:41-59, 2006.
123. P. C. Hansen and M. Saxild-Hansen, "AIR tools - A MATLAB package of algebraic iterative reconstruction methods." J. Comp. Appl. Math. 236:2167-2178, 2011.
124. P. C. Hansen and P. Yalamov, "Computing symmetric rank-revealing decompositions via triangular factorization." SIAM J. Matrix Anal. Appl. 23:443-458, 2001.
125. J. G. Hayes, ed., Numerical Approximation to Functions and Data. Athlone Press, London, 1970.
126. M. R. Hestenes and E. Stiefel, "Methods of conjugate gradients for solving linear systems." J. Res. Nat. Stan. B. 49:409-432, 1952.
127. N. Higham, "Analysis of the Cholesky decomposition of a semi-definite matrix." In Reliable Numerical Computing, ed. M. G. Cox and S. J. Hammarling, Oxford University Press, London, 1990.
128. N. Higham, Accuracy and Stability of Numerical Algorithms. Second edition, SIAM, Philadelphia, 2002.
129. H. P. Hong and C. T. Pan, "Rank-revealing QR factorization and SVD." Math. Comp. 58:213-232, 1992.
130. P. J. Huber and E. M. Ronchetti, Robust Statistics. Second edition, J. Wiley, NJ, 2009.
131. R. Horst, P. M. Pardalos and N. Van Thoai, Introduction to Global Optimization. Second edition, Springer, New York, 2000.
132. N. J. Horton and S. R. Lipsitz, "Multiple imputation in practice: Comparison of software packages for regression models with missing variables." The American Statistician 55, 2011.
133. I. C. F. Ipsen and C. D. Meyer, "The idea behind Krylov methods." Amer. Math. Monthly 105:889-899, 1998.
134. R. A. Johnson, Miller & Freund's Probability and Statistics for Engineers. Pearson Prentice Hall, Upper Saddle River, NJ, 2005.
135. P. Jones, Data Tables of Global and Hemispheric Temperature Anomalies http://cdiac.esd.ornl.gov/trends/temp/jonescru/data.html.
136. T. L. Jordan, "Experiments on error growth associated with some linear least squares procedures." Math. Comp. 22:579-588, 1968.
137. D. L. Jupp, "Approximation to data by splines with free knots." SIAM J. Numer. Anal. 15:328, 1978.
138. D. L. Jupp and K. Vozoff, "Stable iterative methods for the inversion of geophysical data." J. R. Astr. Soc. 42:957-976, 1975.
139. W. Karush, "Minima of functions of several variables with inequalities as side constraints." M. Sc. Dissertation. Department of Mathematics, University of Chicago, Chicago, Illinois, 1939.
140. L. Kaufman, "A variable projection method for solving nonlinear least squares problems." BIT 15:49-57, 1975.
141. L. Kaufman and G. Sylvester, "Separable nonlinear least squares with multiple right-hand sides." SIAM J. Matrix Anal. and Appl. 13:68- 89, 1992.
142. L. Kaufman and V. Pereyra, "A method for separable nonlinear least squares problems with separable equality constraints." SIAM J. Numer. Anal. 15:12-20, 1978.
143. H. B. Keller and V. Pereyra, Finite Difference Solution of Two-Point BVP. Preprint 69, Department of Mathematics, University of Southern California, 1976.
144. M. E. Kilmer and D. P. O'Leary, "Choosing regularization parameters in iterative methods for ill-posed problems." SIAM. J. Matrix Anal. Appl. 22:1204-1221, 2001.
145. H. Kim, G. H. Golub and H. Park, "Missing value estimation for DNA microarray expression data: Least squares imputation." In Proceedings of CSB'2004, Stanford, CA, pp. 572-573, 2004.
146. S. Kotz, N. L. Johnson and A. B. Read, Encyclopedia of Statistical Sciences. 6. Wiley-Interscience, New York, 1985.
147. H. W. Kuhn and A. W. Tucker, Nonlinear Programming. Proceedings of 2nd Berkeley Symposium, 481-492, University of California Press, Berkeley, 1951.
148. Lancelot: Nonlinear Programming Code http://www.numerical.rl.ac.uk/lancelot/.
149. K. Lange, Numerical Analysis for Statisticians. Second edition, Springer, New York, 2010.
150. C. Lawson and R. Hanson, Solving Least Squares Problems. Prentice Hall, Englewood Cliffs, NJ, 1974.
151. K. Levenberg, "A method for the solution of certain nonlinear problems in least squares." Quart. J. App. Math. 2:164-168, 1948.
152. R. J. A. Little and D. B. Rubin, Statistical Analysis with Missing Data. Second edition. J. Wiley, Hoboken, NJ, 2002.
153. K. Madsen and H. B. Nielsen, "A finite smoothing algorithm for linear -1 estimation." SIAM J. Optimiz. 3:223-235, 1993.
154. K. Madsen and H. B. Nielsen, Introduction to Optimization and Data Fitting. Lecture notes, Informatics and Mathematical Modelling, Technical University of Denmark, Lyngby, 2008.
155. I. Markovsky and S. Van Huffel, "Overview of total least-squares methods." Signal Processsing 87:2283-2302, 2007.
156. O. Mate, "Missing value problem." Master's Thesis, Stanford University, Stanford, CA, 2007.
157. Matrix Market. http://math.nist.gov/MatrixMarket.
158. C. D. Meyer, Matrix Analysis and Applied Linear Algebra. SIAM, Philadelphia, 2000.
159. J.-C. Miellou, "Iterations chaotiques a retards." C. R. Acad. Sci. Paris 278:957-960, 1974.
160. J.-C. Miellou, "Algorithmes de relaxation chaotique a retards." RAIRO R1:55-82, 1975.
161. K. M. Miettinen, Nonlinear Multiobjective Optimization. Kluwers Academic, Boston, 1999.
162. L. Miranian and M. Gu, "Strong rank revealing LU factorizations." Lin. Alg. Appl. 367:1-16, 2003.
163. Software for multiple imputation. http://www.stat.psu.edu/jls/misoftwa.html.
164. M. Mohlenkamp and M. C. Pereyra, Wavelets, Their Friends, and What They Can Do For You. EMS Lecture Series in Mathematics, European Mathematical Society, Zurich, Switzerland, 2008.
165. J. Moré and S. J. Wright, Optimization Software Guide. SIAM, Philadelphia, 1993.
166. A. Nedic, D. P. Bertsekas and V. S. Borkar, "Distributed asynchronous incremental subgradient methods." Studies in Computational Mathematics 8:381-407, 2001.
167. Y. Nesterov and A. Nemirovskii. Interior-Point Polynomial Methods in Convex Programming. Studies in Applied Mathematics 13. SIAM, Philadelphia, 1994.
168. L. Ngia, "System modeling using basis functions and applications to echo cancellation." Ph.D. Thesis, Chalmers Institute of Technology, Sweden, Goteborg, 2000.
169. L. Ngia, Separable Nonlinear Least Squares Methods for On-Line Estimation of Neural Nets Hammerstein Models. Department of Signals and Systems, Chalmers Institute of Technology, Sweden, 2001.
170. J. Nocedal and S. J. Wright, Numerical Optimization. Springer, New York, second edition, 2006.
171. D. P. O'Leary, "Robust regression computation using iteratively reweighted least squares." SIAM J. Matrix. Anal. Appl. 22:466-480, 1990.
172. D. P. O'Leary and B. W. Rust, "Variable projection for nonlinear least squares problems." Submitted for publication in Computational Optimization and Applications (2011). Also at: http://www.cs.umd.edu/users/oleary/software/varpro.pdf.
173. J. M. Ortega and W. C. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York, 1970.
174. M. R. Osborne, "Some special nonlinear least squares problems." SIAM J. Numer. Anal. 12:571-592, 1975.
175. M. R. Osborne and G. K. Smyth, "A modified Prony algorithm for fitting functions defined by difference equations." SIAM J. Sci. Comp. 12:362-382, 1991.
176. M. R. Osborne and G. K. Smyth, "A modified Prony algorithm for exponential function fitting." SIAM J. Sci. Comp. 16:119-138, 1995.
177. M. R. Osborne, "Separable least squares, variable projections, and the Gauss-Newton algorithm." ETNA 28:1-15, 2007.
178. A. Ostrowski, "Determinanten mit ueberwiegender Hauptdiagonale and die absolute Konvergenz von linearen Iterationsprozessen." Comm. Math. Helv. 30:175-210, 1955.
179. C. C. Paige and M. A. Saunders, "LSQR: An algorithm for sparse linear equations and sparse least squares." ACM TOMS 8:43-71, 1982.
180. C. C. Paige and Z. Strakos, "Core problems in linear algebraic systems." SIAM J. Matrix Anal. Appl. 27:861-875, 2006.
181. R. Parisi, E. D. Di Claudio, G. Orlandi and B. D. Rao, "A generalized learning paradigm exploiting the structure of feedforward neural networks." IEEE Transactions on Neural Networks 7:1450-1460, 1996.
182. Y. C. Pati and P. S. Krishnaprasad, "Analysis and synthesis of feedforward neural networks using discrete affine wavelet transformations." IEEE Trans. Neural Networks 4:73-85, 1993.
183. V. Pereyra, "Accelerating the convergence of discretization algorithms." SIAM J. Numer. Anal. 4:508-533, 1967.
184. V. Pereyra, "Iterative methods for solving nonlinear least squares problems." SIAM J. Numer. Anal. 4:27-36, 1967.
185. V. Pereyra, "Stability of general systems of linear equations." Aeq. Math. 2:194-206, 1969.
186. V. Pereyra, "Stabilizing linear least squares problems." Proc. IFIP, Suppl. 68:119-121, 1969.
187. V. Pereyra, "Modeling, ray tracing, and block nonlinear travel-time inversion in 3D." Pure and App. Geoph. 48:345-386, 1995.
188. V. Pereyra, "Asynchronous distributed solution of large scale nonlinear inversion problems." J. App. Numer. Math. 30:31-40, 1999.
189. V. Pereyra, "Ray tracing methods for inverse problems." Invited topical review. Inverse Problems 16:R1-R35, 2000.
190. V. Pereyra, "Fast computation of equispaced Pareto manifolds and Pareto fronts for multiobjective optimization problems." Math. Comp. in Simulation 79:1935-1947, 2009.
191. V. Pereyra, M. Koshy and J. Meza, "Asynchronous global optimization techniques for medium and large inversion problems." SEG Annual Meeting Extended Abstracts 65:1091-1094, 1995.
192. V. Pereyra and P. Reynolds, "Application of optimization techniques to finite element analysis of piezocomposite devices." IEEE Ultrasonics Symposium, Montreal, CANADA, 2004.
193. V. Pereyra and J. B. Rosen, Computation of the Pseudoinverse of a Matrix of Unknown Rank. Report CS 13, 39 pp. Computer Science Department, Stanford University, Stanford, CA, 1964.
194. V. Pereyra, M. Saunders and J. Castillo, Equispaced Pareto Front Construction for Constrained Biobjective Optimization. SOL Report- 2010-1, Stanford University, Stanford, CA, 2010. Also CSRCR2009- 05, San Diego State University, 2009. In Press, Mathematical and Computer Modelling, 2012.
195. V. Pereyra and G. Scherer, "Efficient computer manipulation of tensor products with applications in multidimensional approximation." Math. Comp. 27:595-605, 1973.
196. V. Pereyra and G. Scherer, "Least squares scattered data fitting by truncated SVD." Applied Numer. Math. 40:73-86, 2002.
197. V. Pereyra and G. Scherer, "Large scale least squares data fitting." Applied Numer. Math. 44:225-239, 2002.
198. V. Pereyra and G. Scherer, "Exponential data fitting." In Exponential Data Fitting and Its Applications, Ed. V. Pereyra and G. Scherer. Bentham Books, Oak Park, IL, 2010.
199. V. Pereyra, G. Scherer and F.Wong, "Variable projections neural network training." Mathematics and Computers in Simulation 73:231- 243, 2006.
200. V. Pereyra, G.Wojcik, D. Powell, C. Purcell and L. Carcione, "Folded shell projectors and virtual optimization." US Navy Workshop on Acoustic Transduction Materials and Devices, Baltimore, 2001.
201. G. Peters and J. H. Wilkinson, "The least squares problem and pseudo-inverses." The Computer Journal 13:309-316, 1969.
202. M. J. D. Powell, Approximation Theory and Methods. Cambridge University Press, New York, 1981.
203. L. Prechelt, Proben 1-A Set of Benchmark Neural Network Problems and Benchmarking Rules. Technical Report 21, Fakultaet fuer Informatik, Universitaet Karlsruhe, 1994.
204. Baron Gaspard Riche de Prony, "Essai experimental et analytique: Sur les lois de la dilatabilite de fluides elastique et sur celles de la force expansive de la vapeur de l'alkool, a differentes temperatures." J. Ecole Polyt. 1:24-76, 1795.
205. PZFLEX: Weidlinger Associates Inc. Finite Element Code to Simulate Piezoelectric Phenomena. http://www.wai.com, 2006.
206. L. Reichel, "Fast QR decomposition of Vandermonde-like matrices and polynomial least squares approximations." SIAM J. Matrix Anal. Appl. 12:552-564, 1991.
207. R. A. Renaut and H. Guo, "Efficient algorithms for solution of regularized total least squares." SIAM J. Matrix Anal. Appl. 26:457-476, 2005.
208. J. R. Rice, "Experiments on Gram-Schmidt orthogonalization." Math. Comp. 20:325-328, 1966.
209. J. B. Rosen, "Minimum and basic solutions to singular systems." J. SIAM 12:156-162, 1964.
210. J. B. Rosen and J. Kreuser, "A gradient projection algorithm for nonlinear constraints." In Numerical Methods for Non-Linear Optimization. Ed. F. A. Lootsma, Academic Press, New York, pp. 297-300, 1972.
211. J. Rosenfeld, A Case Study on Programming for Parallel Processors. Research Report RC-1864, IBM Watson Research Center, Yorktown Heights, New York, 1967.
212. Å. Ruhe and P-Å. Wedin, "Algorithms for separable non-linear least squares problems." SIAM Rev. 22:318-337, 1980.
213. B. W. Rust, "Fitting nature's basis functions." Parts I-IV, Computing in Sci. and Eng. 2001-03.
214. B. W. Rust, http://math.nist.gov/BRust/Gallery.html, 2011.
215. B. W. Rust, Truncating the Singular Value Decomposition for Ill- Posed Problems. Tech. Report NISTIR 6131, Mathematics and Computer Sciences Division, National Institute of Standards and Technology, 1998.
216. B. W. Rust and D. P. O'Leary, "Residual periodograms for choosing regularization parameters for ill-posed problems." Inverse Problems 24, 2008.
217. S. Saarinen, R. Bramley and G. Cybenko, "Ill-conditioning in neural network training problems." SIAM J. Sci. Stat. Comput. 14:693-714, 1993.
218. S. A. Savari and D. P. Bertsekas, "Finite termination of asynchronous iterative algorithms." Parallel Comp. 22:39-56, 1996.
219. J. A. Scales, A. Gersztenkorn and S. Treitel, "Fast lp solution of large, sparse, linear systems: Application to seismic travel time tomography." J. Comp. Physics 75:314-333, 1988.
220. J. L. Schafer, Analysis of Incomplete Multivariate Data. Chapman & Hall, London, 1997.
221. S. Schechter, "Relaxation methods for linear equations." Comm. Pure Appl. Math. 12:313-335, 1959.
222. M. E. Schlesinger and N. Ramankutty, "An oscillation in the global climate system of period 65-70 years." Nature 367:723-726, 1994.
223. G. A. F. Seber and C. J. Wild, Nonlinear Regression. J. Wiley, New York, 1989.
224. R. Sheriff and L. Geldart, Exploration Seismology. Cambridge University Press, second edition, Cambridge, 1995.
225. D. Sima, S. Van Huffel and G. Golub, "Regularized total least squares based on quadratic eigenvalue problem solvers." BIT 44:793-812, 2004.
226. Spline2. http://www.structureandchange.3me.tudelft.nl/.
227. J. Sjöberg and M. Viberg, "Separable non-linear least squares minimization-possible improvements for neural net fitting." IEEE Workshop in Neural Networks for Signal Processing, Amelia Island Plantation, FL, 1997.
228. N. Srivastava, R. Suaya, V. Pereyra and K. Banerjee, "Accurate calculations of the high-frequency impedance matrix for VLSI interconnects and inductors above a multi-layer substrate: A VARPRO success story." In Exponential Data Fitting and Its Applications, Eds. V. Pereyra and G. Scherer. Bentham Books, Oak Park, IL, 2010.
229. T. Steihaug and Y. Yalcinkaya, "Asynchronous methods in least squares: An example of deteriorating convergence." Proc. 15 IMACS World Congress on Scientific Computation, Modeling and Applied Mathematics, Berlin, Germany, 1997.
230. G. W. Stewart, "Rank degeneracy." SIAM J. Sci. Stat. Comput. 5:403-413, 1984.
231. G. W. Stewart, "On the invariance of perturbed null vectors under column scaling." Numer. Math. 44:61-65, 1984.
232. G. W. Stewart, Matrix Algorithms. Volume I: Basic Decompositions. SIAM, Philadelphia, 1998.
233. T. Strutz, Data Fitting and Uncertainty. Vieweg+Teubner Verlag, Wiesbaden, 2011.
234. B. J. Thijsse and B. Rust, "Freestyle data fitting and global temperatures." Computing in Sci. and Eng. pp. 49-59, 2008.
235. R. Tibshirani, "Regression shrinkage and selection via the lasso." Journal of the Royal Statistical Society. Series B (Methodological) 58:267-288, 1996.
236. A. N. Tikhonov, "On the stability of inverse problems." Dokl. Akad. Nauk SSSR 39:195-198, 1943.
237. L. N. Trefethen and D. Bau, Numerical Linear Algebra. SIAM, Philadelphia, 1997.
238. O. Troyanskaya, M. Cantor, G. Sherlock, P. Brown, T. Hastie, R. Tibshirani, D. Botstein and R. B. Altman, "Missing value estimation methods for DNA microarrays." Bioinformatics 17:520-525, 2001.
239. S. Van Huffel and J. Vandewalle, The Total Least Squares Problem. Computational Aspects and Analysis, SIAM, Philadelphia, 1991.
240. E. van den Berg and M. P. Friedlander, "Probing the Pareto frontier for basis pursuit solutions." SIAM J. Sci. Comp. 31:890-912, 2008.
241. E. van den Berg and M. P. Friedlander, "Sparse optimization with least-squares constraints." SIAM J. Optim. 21:1201-1229, 2011.
242. A. van den Bos, Parameter Estimation for Scientists and Engineers. Wiley-Interscience, Hoboken, NJ, 2007.
243. A. van der Sluis, "Condition numbers and equilibration of matrices." Numer. Math. 14:14-23, 1969.
244. J. W. van der Veen, R. de Beer, P. R. Luyten and D. Van Ormondt, "Accurate quantification of in vivo 31P NMR signals using the variable projection method and prior knowledge." Magn. Reson. Med. 6:92- 98, 1988.
245. L. Vanhamme, A. van den Boogaart and S. Van Huffel, "Improved method for accurate and efficient quantification of MRS data with use of prior knowledge." J. Magn. Reson. 129:35-43, 1997.
246. L. Vanhamme, S. Van Huffel, P. Van Hecke and D. van Ormondt, "Time-domain quantification of series of biomedical magnetic resonance spectroscopy signals." J. Magn. Reson. 140:120-130, 1999.
247. L. Vanhamme, T. Sundin, P. Van Hecke, S. Van Huffel and R. Pintelon, "Frequency-selective quantification of biomedical magnetic resonance spectroscopy data." J. Magn. Reson. 143:1-16, 2000.
248. S. Van Huffel, 'Partial singular value decomposition algorithm." J. Comp. Appl. Math. 33:105-112, 1990.
249. B. Walden, R. Karlsson and J.-G. Sun, "Optimal backward perturbation bounds for the linear least squares problem." Numer. Linear Algebra Appl. 2:271-286, 2005.
250. I. Wasito and B. Mirkin, "Nearest neighbors in least squares data imputation algorithms with different missing patterns." Comp. Stat. & Data Analysis 50: 926-949, 2006.
251. D. S. Watkins, Fundamentals of Matrix Computations. J. Wiley, New York, 2002.
252. K. Weigl and M. Berthod, Neural Networks as Dynamical Bases in Function Space. Report 2124, INRIA, Programe Robotique, Image et Vision, Sophia-Antipolis, France, 1993.
253. K. Weigl, G. Giraudon and M. Berthod, Application of Projection Learning to the Detection of Urban Areas in SPOT Satellite Images. Report #2143, INRIA, Programe Robotique, Image et Vision, Sophia-Antipolis, France, 1993.
254. K. Weigl and M. Berthod, "Projection learning: Alternative approach to the computation of the projection." Proceedings of the European Symposium on Artificial Neural Networks pp. 19-24, Brussels, Belgium, 1994.
255. J. H. Wilkinson, Rounding Errors in Algebraic Processes. Prentice- Hall, Englewood Cliffs, NJ, 1963. Reprint Dover, New York, 1994.
256. H. Wold and E. Lyttkens, "Nonlinear iterative partial least squares (NIPALS) estimation procedures." Bull. ISI 43:29-51, 1969.
257. S. Wold, A. Ruhe, H. Wold and W. J. Dunn, "The collinearity problem in linear regression. The partial least squares (PLS) approach to generalized inverses." SIAM J. Sci. Stat. Comput. 5:735-743, 1984.
258. R. Wolke and H. Schwetlick, "Iteratively reweighted least squares: Algorithms, convergence analysis, and numerical comparisons." SIAM J. Sci. Stat. Comput. 9:907-921, 1988.
259. S. J. Wright, Primal-Dual Interior-Point Methods. SIAM, Philadelphia, 1997.
260. S. J. Wright, J. N. Holt, "Algorithms for non-linear least squares with linear inequality constraints." SIAM J. Sci. and Stat. Comput. 6:1033-1048, 1985.
261. P. Zadunaisky and V. Pereyra, "On the convergence and precision of a process of successive differential corrections." Proc. IFIPS 65, 1965.
262. H. Zha, "Singular values of a classical matrix." The American Mathematical Monthly 104:172-173, 1997.
263. Netlib Repository at UTK and ORNL. http://www.netlib.org.
264. NEOS Wiki. http://www.neos-guide.org.
265. NIST/SEMATECH e-Handbook of Statistical Methods. http://www.itl.nist.gov/div898/strd/nls/nls-info.shtml, 2011.